Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
........................
/home/mcc/execution
total 172K
-rw-r--r-- 1 mcc users 3.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.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.9K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SwimmingPool-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732258100654
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528188941630

info: Time: 3600 - MCC
===========================================================================================
prep: translating SwimmingPool-PT-03 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SwimmingPool-PT-03 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ SwimmingPool-PT-03 @ 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: 16/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from SwimmingPool-PT-03-LTLFireability.task
lola: A (G (G (G (X (F (FIREABLE(Enter))))))) : A ((FIREABLE(RelK) U F (F (F (FIREABLE(GetK)))))) : A (((F (FIREABLE(GetK2)) U G (FIREABLE(GetB))) U G (G (G (FIREABLE(Enter)))))) : A (F (X (G (F (G (FIREABLE(RelK))))))) : A (G (X (X ((FIREABLE(RKey) U FIREABLE(Enter)))))) : A ((F (X (FIREABLE(GetB))) U (G (FIREABLE(GetB)) U FIREABLE(GetK2)))) : A (((FIREABLE(RelK) U F (FIREABLE(GetB))) U X (X (F (FIREABLE(Enter)))))) : A (G (X (X ((FIREABLE(Enter) U FIREABLE(RBag)))))) : A (G (G (F (FIREABLE(RelK))))) : A ((X ((FIREABLE(Enter) U FIREABLE(GetB))) U G (X (FIREABLE(GetB))))) : A (F (G ((FIREABLE(RKey) U FIREABLE(Enter))))) : A ((G (FIREABLE(RKey)) U (FIREABLE(GetK2) U X (FIREABLE(RBag))))) : A (FIREABLE(GetK)) : A (FIREABLE(GetK)) : A (X (G (F (G (G (FIREABLE(RelK))))))) : A (G ((FIREABLE(RBag) U F (X (FIREABLE(GetK2))))))
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: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(GetK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(GetK)
lola: processed formula length: 14
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-03-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SwimmingPool-PT-03-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(GetK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(GetK)
lola: processed formula length: 14
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-03-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SwimmingPool-PT-03-LTLFireability-13 FALSE 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 ((F (FIREABLE(GetB)) U X (X (F (FIREABLE(Enter))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (FIREABLE(GetB)) U X (X (F (FIREABLE(Enter))))))
lola: processed formula length: 54
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-03-LTLFireability.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 7 markings, 8 edges
lola: ========================================

FORMULA SwimmingPool-PT-03-LTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((F (FIREABLE(RBag)) AND (FIREABLE(Enter) OR FIREABLE(RBag)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((F (FIREABLE(RBag)) AND (FIREABLE(Enter) OR FIREABLE(RBag)))))))
lola: processed formula length: 76
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-03-LTLFireability.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: 810027 markings, 1959710 edges
lola: ========================================

FORMULA SwimmingPool-PT-03-LTLFireability-7 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 (((FIREABLE(Enter) U FIREABLE(GetB)) U G (FIREABLE(GetB)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((FIREABLE(Enter) U FIREABLE(GetB)) U G (FIREABLE(GetB)))))
lola: processed formula length: 65
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-03-LTLFireability.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: 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: 126 markings, 126 edges
lola: ========================================

FORMULA SwimmingPool-PT-03-LTLFireability-9 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 (((FIREABLE(GetK2) U X (FIREABLE(RBag))) OR (G (FIREABLE(RKey)) AND X (F (FIREABLE(RBag))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((FIREABLE(GetK2) U X (FIREABLE(RBag))) OR (G (FIREABLE(RKey)) AND X (F (FIREABLE(RBag))))))
lola: processed formula length: 95
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-03-LTLFireability.task
lola: the resulting Büchi automaton has 10 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: 1686185 markings, 4306003 edges
lola: ========================================

FORMULA SwimmingPool-PT-03-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((F (FIREABLE(Enter)) AND (FIREABLE(RKey) OR FIREABLE(Enter)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((F (FIREABLE(Enter)) AND (FIREABLE(RKey) OR FIREABLE(Enter)))))))
lola: processed formula length: 77
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-03-LTLFireability.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: 2502274 markings, 6954794 edges, 500455 markings/sec, 0 secs
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: 2849305 markings, 7938798 edges
lola: ========================================

FORMULA SwimmingPool-PT-03-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F (FIREABLE(GetB))) U (FIREABLE(GetK2) OR (G (FIREABLE(GetB)) AND F (FIREABLE(GetK2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F (FIREABLE(GetB))) U (FIREABLE(GetK2) OR (G (FIREABLE(GetB)) AND F (FIREABLE(GetK2))))))
lola: processed formula length: 96
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-03-LTLFireability.task
lola: the resulting Büchi automaton has 8 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: 1994603 markings, 7919141 edges, 398921 markings/sec, 0 secs
lola: 3768143 markings, 15325583 edges, 354708 markings/sec, 5 secs
lola: 5615467 markings, 22861031 edges, 369465 markings/sec, 10 secs
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: 6975269 markings, 28729884 edges

FORMULA SwimmingPool-PT-03-LTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F (FIREABLE(GetK2)))) AND A (G ((FIREABLE(RBag) OR X (F (FIREABLE(GetK2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(GetK2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(GetK2))))
lola: processed formula length: 27
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-03-LTLFireability.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: ========================================
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: 78979 markings, 138421 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(RBag) OR X (F (FIREABLE(GetK2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((FIREABLE(RBag) OR X (F (FIREABLE(GetK2))))))
lola: processed formula length: 51
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-03-LTLFireability.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: 2020067 markings, 6356384 edges, 404013 markings/sec, 0 secs
lola: 3633819 markings, 11536338 edges, 322750 markings/sec, 5 secs
lola: 5222569 markings, 16647758 edges, 317750 markings/sec, 10 secs
lola: 6745107 markings, 21570672 edges, 304508 markings/sec, 15 secs
lola: 8244600 markings, 26437795 edges, 299899 markings/sec, 20 secs
lola: 9610388 markings, 30908431 edges, 273158 markings/sec, 25 secs
lola: 10965086 markings, 35364967 edges, 270940 markings/sec, 30 secs
lola: 12342525 markings, 39939201 edges, 275488 markings/sec, 35 secs
lola: 13736122 markings, 44572521 edges, 278719 markings/sec, 40 secs
lola: 15135492 markings, 49245174 edges, 279874 markings/sec, 45 secs
lola: 16537338 markings, 53945106 edges, 280369 markings/sec, 50 secs
lola: 17941365 markings, 58656602 edges, 280805 markings/sec, 55 secs
lola: 19348537 markings, 63392338 edges, 281434 markings/sec, 60 secs
lola: 20757533 markings, 68137653 edges, 281799 markings/sec, 65 secs
lola: 22171188 markings, 72886117 edges, 282731 markings/sec, 70 secs
lola: 23577379 markings, 77626135 edges, 281238 markings/sec, 75 secs
lola: 24993817 markings, 82384620 edges, 283288 markings/sec, 80 secs
lola: 26408198 markings, 87147056 edges, 282876 markings/sec, 85 secs
lola: 27828195 markings, 91929804 edges, 283999 markings/sec, 90 secs
lola: 29252184 markings, 96721156 edges, 284798 markings/sec, 95 secs
lola: 30682279 markings, 101530698 edges, 286019 markings/sec, 100 secs
lola: 32118566 markings, 106369397 edges, 287257 markings/sec, 105 secs
lola: 33559797 markings, 111231861 edges, 288246 markings/sec, 110 secs
lola: 35010339 markings, 116129262 edges, 290108 markings/sec, 115 secs
lola: 36483839 markings, 121106255 edges, 294700 markings/sec, 120 secs
lola: 37996907 markings, 126226260 edges, 302614 markings/sec, 125 secs
lola: 39632284 markings, 131758706 edges, 327075 markings/sec, 130 secs
lola: 39876299 markings, 136717436 edges, 48803 markings/sec, 135 secs
lola: 39891329 markings, 140907062 edges, 3006 markings/sec, 140 secs
lola: 39903442 markings, 144935419 edges, 2423 markings/sec, 145 secs
lola: 39914975 markings, 148883083 edges, 2307 markings/sec, 150 secs
lola: 39925695 markings, 152769954 edges, 2144 markings/sec, 155 secs
lola: 39936388 markings, 156614713 edges, 2139 markings/sec, 160 secs
lola: 39946660 markings, 160421533 edges, 2054 markings/sec, 165 secs
lola: 39956585 markings, 164200878 edges, 1985 markings/sec, 170 secs
lola: 39966132 markings, 167954475 edges, 1909 markings/sec, 175 secs
lola: 39975689 markings, 171694650 edges, 1911 markings/sec, 180 secs
lola: 39985157 markings, 175419790 edges, 1894 markings/sec, 185 secs
lola: 39994502 markings, 179140300 edges, 1869 markings/sec, 190 secs
lola: 40003467 markings, 182839142 edges, 1793 markings/sec, 195 secs
lola: 40012581 markings, 186533124 edges, 1823 markings/sec, 200 secs
lola: 40021555 markings, 190199630 edges, 1795 markings/sec, 205 secs
lola: 40030709 markings, 193842659 edges, 1831 markings/sec, 210 secs
lola: 40039937 markings, 197446640 edges, 1846 markings/sec, 215 secs
lola: 40049311 markings, 201002001 edges, 1875 markings/sec, 220 secs
lola: 40058408 markings, 204458744 edges, 1819 markings/sec, 225 secs
lola: 40067641 markings, 207768100 edges, 1847 markings/sec, 230 secs
lola: 40077095 markings, 211012068 edges, 1891 markings/sec, 235 secs
lola: 40087252 markings, 214323510 edges, 2031 markings/sec, 240 secs
lola: 40097972 markings, 217768635 edges, 2144 markings/sec, 245 secs
lola: 40110062 markings, 221544504 edges, 2418 markings/sec, 250 secs
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: 40122176 markings, 225877296 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA SwimmingPool-PT-03-LTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 468 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(GetK)))
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: NOT FIREABLE(GetK)
lola: processed formula length: 18
lola: 46 rewrites
lola: closed formula file SwimmingPool-PT-03-LTLFireability.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: 1 markings, 0 edges
lola: ========================================

FORMULA SwimmingPool-PT-03-LTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 546 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(RelK))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(RelK))))
lola: processed formula length: 26
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-03-LTLFireability.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6762 markings, 10116 edges
lola: ========================================

FORMULA SwimmingPool-PT-03-LTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 656 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(Enter))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(Enter))))
lola: processed formula length: 27
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-03-LTLFireability.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 10844 markings, 16013 edges
lola: ========================================

FORMULA SwimmingPool-PT-03-LTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 820 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(RelK))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(RelK))))
lola: processed formula length: 26
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-03-LTLFireability.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: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
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: 287 markings, 302 edges
lola: ========================================

FORMULA SwimmingPool-PT-03-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1093 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(RelK))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(RelK))))
lola: processed formula length: 26
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-03-LTLFireability.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: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
lola: add low 1
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: 287 markings, 302 edges
lola: ========================================

FORMULA SwimmingPool-PT-03-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1640 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F (FIREABLE(Enter)) AND (FIREABLE(RKey) OR FIREABLE(Enter))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F (FIREABLE(Enter)) AND (FIREABLE(RKey) OR FIREABLE(Enter))))))
lola: processed formula length: 73
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-03-LTLFireability.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: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 0
lola: add low 6
lola: add low 1
lola: add low 0
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: 80598 markings, 126180 edges
lola: ========================================

FORMULA SwimmingPool-PT-03-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3281 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((F (FIREABLE(GetK2)) U G (FIREABLE(GetB))) U G (FIREABLE(Enter))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F (FIREABLE(GetK2)) U G (FIREABLE(GetB))) U G (FIREABLE(Enter))))
lola: processed formula length: 70
lola: 44 rewrites
lola: closed formula file SwimmingPool-PT-03-LTLFireability.task
lola: the resulting Büchi automaton has 9 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: 44578 markings, 89521 edges
lola: ========================================

FORMULA SwimmingPool-PT-03-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no no no yes yes no yes no no no no no no yes
lola:
preliminary result: yes yes no no no yes yes no yes no no no no no no yes
lola: memory consumption: 14652 KB
lola: time consumption: 289 seconds

BK_STOP 1528189231351

--------------------
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="SwimmingPool-PT-03"
export BK_EXAMINATION="LTLFireability"
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/SwimmingPool-PT-03.tgz
mv SwimmingPool-PT-03 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 SwimmingPool-PT-03, examination is LTLFireability"
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-152732258100654"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;