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 276K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.8K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 110K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is DES-PT-60a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r214-smll-152732265200159
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527424965301


BK_STOP 1527425453858

--------------------
content from stderr:

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DES-PT-60a as instance name.
Using DES as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': None, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 598619, 'Memory': 2291.98, 'Tool': 'lola'}, {'Time': 598863, 'Memory': 2308.84, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola DES-PT-60a...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
DES-PT-60a: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
DES-PT-60a: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ DES-PT-60a @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 665/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 354 places, 311 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 336 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-60a-LTLCardinality.task
lola: A (((2 <= p319) U ((p6 <= p301) U (1 <= p329)))) : A (G ((G ((p1 <= p218)) U G ((3 <= p264))))) : A (G (F (F ((p117 <= p348))))) : A ((F (F ((1 <= p299))) U G (F ((3 <= p162))))) : A (G (F (G (X ((p347 <= p338)))))) : A ((((1 <= p314) U (3 <= p106)) U F (F ((2 <= p104))))) : A (F (X (((3 <= p256) U (2 <= p319))))) : A (F ((p310 <= p185))) : A ((F ((1 <= p271)) U G (X ((p130 <= p207))))) : A ((G (G ((p309 <= p66))) U F (X ((2 <= p98))))) : A (G (F ((p231 <= p110)))) : A (F (G (G (F ((3 <= p311)))))) : A ((2 <= p173)) : A (F ((F ((p287 <= p112)) U (2 <= p244)))) : A (F ((F ((1 <= p74)) U F ((p247 <= p72))))) : A (((2 <= p293) U G (F ((2 <= p49)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p319) U ((p6 <= p301) U (1 <= p329))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= p319) U ((p6 <= p301) U (1 <= p329))))
lola: processed formula: A (((2 <= p319) U ((p6 <= p301) U (1 <= p329))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 unused bits
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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((p1 <= p218)) U G ((3 <= p264)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((G ((p1 <= p218)) U G ((3 <= p264)))))
lola: processed formula: A (G ((G ((p1 <= p218)) U G ((3 <= p264)))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 21 unused bits
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: 40 markings, 40 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (F ((p117 <= p348)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F ((p117 <= p348))))
lola: processed formula: A (G (F ((p117 <= p348))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 unused bits
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: 122 markings, 148 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((1 <= p299))) U G (F ((3 <= p162)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((1 <= p299)) U G (F ((3 <= p162)))))
lola: processed formula: A ((F ((1 <= p299)) U G (F ((3 <= p162)))))
lola: processed formula length: 43
lola: 1 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 22 unused bits
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: 28 markings, 29 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (X ((p347 <= p338))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X ((p347 <= p338)))))
lola: processed formula: A (F (G (X ((p347 <= p338)))))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 unused bits
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: 233 markings, 566 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p314) U (3 <= p106)) U F (F ((2 <= p104)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= p314) U (3 <= p106)) U F ((2 <= p104))))
lola: processed formula: A ((((1 <= p314) U (3 <= p106)) U F ((2 <= p104))))
lola: processed formula length: 51
lola: 1 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 24 unused bits
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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((3 <= p256) U (2 <= p319)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (((3 <= p256) U (2 <= p319)))))
lola: processed formula: A (F (X (((3 <= p256) U (2 <= p319)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 unused bits
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: 45 markings, 45 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p310 <= p185)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p310 <= p185)))
lola: processed formula: A (F ((p310 <= p185)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 24 unused bits
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: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((1 <= p271)) U G (X ((p130 <= p207)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((1 <= p271)) U G (X ((p130 <= p207)))))
lola: processed formula: A ((F ((1 <= p271)) U G (X ((p130 <= p207)))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 504025 markings, 3595717 edges, 100805 markings/sec, 0 secs
lola: 932697 markings, 7022378 edges, 85734 markings/sec, 5 secs
lola: 1347253 markings, 10350097 edges, 82911 markings/sec, 10 secs
lola: 1775282 markings, 13676803 edges, 85606 markings/sec, 15 secs
lola: 2133916 markings, 16897763 edges, 71727 markings/sec, 20 secs
lola: 2515853 markings, 20311505 edges, 76387 markings/sec, 25 secs
lola: 2918784 markings, 23597709 edges, 80586 markings/sec, 30 secs
lola: 3250069 markings, 26816906 edges, 66257 markings/sec, 35 secs
lola: 3594261 markings, 30167166 edges, 68838 markings/sec, 40 secs
lola: 3943315 markings, 33438459 edges, 69811 markings/sec, 45 secs
lola: 4331275 markings, 36927645 edges, 77592 markings/sec, 50 secs
lola: 4712193 markings, 40487432 edges, 76184 markings/sec, 55 secs
lola: 5108594 markings, 43950508 edges, 79280 markings/sec, 60 secs
lola: 5492498 markings, 47329602 edges, 76781 markings/sec, 65 secs
lola: 5900669 markings, 50869813 edges, 81634 markings/sec, 70 secs
lola: 6361511 markings, 54434927 edges, 92168 markings/sec, 75 secs
lola: 6799652 markings, 57885896 edges, 87628 markings/sec, 80 secs
lola: 7247263 markings, 61447321 edges, 89522 markings/sec, 85 secs
lola: 7644621 markings, 64780426 edges, 79472 markings/sec, 90 secs
lola: 8014538 markings, 68019941 edges, 73983 markings/sec, 95 secs
lola: 8409630 markings, 71375072 edges, 79018 markings/sec, 100 secs
lola: 8811971 markings, 74558144 edges, 80468 markings/sec, 105 secs
lola: 9240234 markings, 77905686 edges, 85653 markings/sec, 110 secs
lola: 9674081 markings, 81382307 edges, 86769 markings/sec, 115 secs
lola: 10039138 markings, 84765783 edges, 73011 markings/sec, 120 secs
lola: 10432308 markings, 88138006 edges, 78634 markings/sec, 125 secs
lola: 10784100 markings, 91515994 edges, 70358 markings/sec, 130 secs
lola: 11182886 markings, 94859857 edges, 79757 markings/sec, 135 secs
lola: 11497754 markings, 98114917 edges, 62974 markings/sec, 140 secs
lola: 11850076 markings, 101589690 edges, 70464 markings/sec, 145 secs
lola: 12211229 markings, 104881828 edges, 72231 markings/sec, 150 secs
lola: 12526163 markings, 108120345 edges, 62987 markings/sec, 155 secs
lola: 12779317 markings, 111167258 edges, 50631 markings/sec, 160 secs
lola: 13131779 markings, 114462219 edges, 70492 markings/sec, 165 secs
lola: 13461945 markings, 117871509 edges, 66033 markings/sec, 170 secs
lola: 13803540 markings, 121432246 edges, 68319 markings/sec, 175 secs
lola: 14141269 markings, 124988790 edges, 67546 markings/sec, 180 secs
lola: 14504386 markings, 128412839 edges, 72623 markings/sec, 185 secs
lola: 14847204 markings, 131790548 edges, 68564 markings/sec, 190 secs
lola: 15208888 markings, 135280658 edges, 72337 markings/sec, 195 secs
lola: 15614618 markings, 138817903 edges, 81146 markings/sec, 200 secs
lola: 15992360 markings, 142152358 edges, 75548 markings/sec, 205 secs
lola: 16371957 markings, 145590013 edges, 75919 markings/sec, 210 secs
lola: 16758163 markings, 149046755 edges, 77241 markings/sec, 215 secs
lola: 17084475 markings, 152215602 edges, 65262 markings/sec, 220 secs
lola: 17408276 markings, 155429442 edges, 64760 markings/sec, 225 secs
lola: 17767327 markings, 158741083 edges, 71810 markings/sec, 230 secs
lola: 18121961 markings, 161888718 edges, 70927 markings/sec, 235 secs
lola: 18492856 markings, 165142945 edges, 74179 markings/sec, 240 secs
lola: 18885505 markings, 168564944 edges, 78530 markings/sec, 245 secs
lola: 19262770 markings, 172109060 edges, 75453 markings/sec, 250 secs
lola: 19611861 markings, 175531643 edges, 69818 markings/sec, 255 secs
lola: 19968056 markings, 178868837 edges, 71239 markings/sec, 260 secs
lola: 20326657 markings, 182197288 edges, 71720 markings/sec, 265 secs
lola: 20649076 markings, 185524427 edges, 64484 markings/sec, 270 secs
lola: 20940087 markings, 188857065 edges, 58202 markings/sec, 275 secs
lola: 21278506 markings, 192235858 edges, 67684 markings/sec, 280 secs
lola: 21612539 markings, 195534109 edges, 66807 markings/sec, 285 secs
lola: 21894604 markings, 198764900 edges, 56413 markings/sec, 290 secs
lola: 22140238 markings, 201906946 edges, 49127 markings/sec, 295 secs
lola: 22482697 markings, 205231322 edges, 68492 markings/sec, 300 secs
lola: 22806453 markings, 208689583 edges, 64751 markings/sec, 305 secs
lola: 23128204 markings, 212244555 edges, 64350 markings/sec, 310 secs
lola: 23442321 markings, 215810525 edges, 62823 markings/sec, 315 secs
lola: 23819645 markings, 219582659 edges, 75465 markings/sec, 320 secs
lola: 24163925 markings, 223104805 edges, 68856 markings/sec, 325 secs
lola: 24498340 markings, 226564551 edges, 66883 markings/sec, 330 secs
lola: 24855235 markings, 230101841 edges, 71379 markings/sec, 335 secs
lola: 25176401 markings, 233768409 edges, 64233 markings/sec, 340 secs
lola: 25524246 markings, 237460855 edges, 69569 markings/sec, 345 secs
lola: 25902151 markings, 240999224 edges, 75581 markings/sec, 350 secs
lola: 26270964 markings, 244369479 edges, 73763 markings/sec, 355 secs
lola: 26648486 markings, 247801199 edges, 75504 markings/sec, 360 secs
lola: 26980648 markings, 251370780 edges, 66432 markings/sec, 365 secs
lola: 27308277 markings, 254901448 edges, 65526 markings/sec, 370 secs
lola: 27646553 markings, 258215103 edges, 67655 markings/sec, 375 secs
lola: 27911397 markings, 261135332 edges, 52969 markings/sec, 380 secs
lola: 28250930 markings, 264414403 edges, 67907 markings/sec, 385 secs
lola: 28577950 markings, 267781999 edges, 65404 markings/sec, 390 secs
lola: 28904183 markings, 271198016 edges, 65247 markings/sec, 395 secs
lola: 29238098 markings, 274408120 edges, 66783 markings/sec, 400 secs
lola: 29599922 markings, 277670184 edges, 72365 markings/sec, 405 secs
lola: 29936685 markings, 281117441 edges, 67353 markings/sec, 410 secs
lola: 30257683 markings, 284589759 edges, 64200 markings/sec, 415 secs
lola: 30623363 markings, 288047777 edges, 73136 markings/sec, 420 secs
lola: 30968463 markings, 291612549 edges, 69020 markings/sec, 425 secs
lola: 31280108 markings, 295046708 edges, 62329 markings/sec, 430 secs
lola: 31603607 markings, 298432130 edges, 64700 markings/sec, 435 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((p309 <= p66))) U F (X ((2 <= p98)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((p309 <= p66))) U F (X ((2 <= p98)))))
lola: processed formula: A ((G (G ((p309 <= p66))) U F (X ((2 <= p98)))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 unused bits
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: 45 markings, 45 edges
lola: ========================================
lola: subprocess 10 will run for 516 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p231 <= p110))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F ((p231 <= p110))))
lola: processed formula: A (G (F ((p231 <= p110))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 unused bits
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: 723 markings, 877 edges
lola: ========================================
lola: subprocess 11 will run for 619 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (F ((3 <= p311))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (G (F ((3 <= p311))))))
lola: processed formula: A (F (G (G (F ((3 <= p311))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 unused bits
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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 12 will run for 774 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p173))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p173)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-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: ========================================
lola: subprocess 13 will run for 1032 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((p287 <= p112)) U (2 <= p244))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((p287 <= p112)) U (2 <= p244))))
lola: processed formula: A (F ((F ((p287 <= p112)) U (2 <= p244))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 24 unused bits
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: 44 markings, 44 edges
lola: ========================================
lola: subprocess 14 will run for 1549 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((1 <= p74)) U F ((p247 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((1 <= p74)) U F ((p247 <= p72)))))
lola: processed formula: A (F ((F ((1 <= p74)) U F ((p247 <= p72)))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 24 unused bits
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: ========================================
lola: subprocess 15 will run for 3098 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p293) U G (F ((2 <= p49)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= p293) U G (F ((2 <= p49)))))
lola: processed formula: A (((2 <= p293) U G (F ((2 <= p49)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 22 unused bits
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: 26 markings, 26 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no no yes unknown no no no no no yes no
FORMULA DES-PT-60a-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished 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="DES-PT-60a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-full"
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/DES-PT-60a.tgz
mv DES-PT-60a 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 mcc4mcc-full"
echo " Input is DES-PT-60a, 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 r214-smll-152732265200159"
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 '' LTLCardinality.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 ;