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)
...............
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is PolyORBLF-COL-S06J06T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-smll-149440869900410
=====================================================================

--------------------
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 PolyORBLF-COL-S06J06T06-LTLCardinality-0
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-1
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-15
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-2
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-3
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-4
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-5
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-6
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-7
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-8
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1494672602718


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ PolyORBLF-COL-S06J06T06 @ 3540 seconds
----- Start make result stdout -----
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: 11440/65536 symbol table entries, 3572 collisions
lola: preprocessing...
lola: finding significant places
lola: 700 places, 10740 transitions, 642 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3155 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J06T06-LTLCardinality.task
lola: A (F (F (((3 <= p374 + p375 + p376 + p377 + p378 + p379) U (p82 <= p662 + p663 + p664 + p665 + p666 + p667))))) : A ((G (F ((p48 <= p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460))) U F (G ((1 <= p495))))) : A (F (G (G (G ((2 <= p185 + p186 + p187 + p188 + p189 + p190)))))) : A ((p97 <= p62)) : A (X (((p462 <= p551 + p552 + p553 + p554 + p555 + p556) U X ((1 <= p179 + p180 + p181 + p182 + p183 + p184))))) : A ((X (F ((p399 <= p380 + p381 + p382 + p383 + p384 + p385))) U G ((1 <= p239)))) : A (F ((p49 <= p62))) : A (F (X (G (G ((1 <= p110 + p111 + p112 + p113 + p114 + p115)))))) : A (G (((2 <= p89) U (p324 <= p87 + p86 + p85 + p84 + p83 + p88)))) : A (F ((F ((3 <= p104 + p105 + p106 + p107 + p108 + p109)) U G ((p367 <= p374 + p375 + p376 + p377 + p378 + p379))))) : A (G (G (G (X ((p551 + p552 + p553 + p554 + p555 + p556 <= p110 + p111 + p112 + p113 + p114 + p115)))))) : A ((((p116 + p117 + p118 + p119 + p120 + p121 <= p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317) U (p418 + p419 + p420 + p421 + p422 + p423 <= p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460)) U (3 <= p557 + p558 + p559 + p560 + p561 + p563 + p564 + p565 + p566 + p567 + p569 + p570 + p571 + p572 + p573 + p575 + p576 + p577 + p578 + p579 + p581 + p582 + p583 + p584 + p585 + p587 + p588 + p589 + p590 + p591 + p598 + p597 + p596 + p595 + p594 + p593 + p592 + p586 + p580 + p574 + p568 + p562))) : A ((2 <= p374 + p375 + p376 + p377 + p378 + p379)) : A ((1 <= p599 + p600 + p601 + p602 + p603 + p604)) : A (X (F (X ((1 <= p674 + p675 + p676 + p677 + p678 + p679))))) : A (F (F (X (F ((1 <= p100 + p101 + p102 + p103 + p98 + p99))))))
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 (F (F (((3 <= p374 + p375 + p376 + p377 + p378 + p379) U (p82 <= p662 + p663 + p664 + p665 + p666 + p667)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((3 <= p374 + p375 + p376 + p377 + p378 + p379) U (p82 <= p662 + p663 + p664 + p665 + p666 + p667))))
lola: processed formula: A (F (((3 <= p374 + p375 + p376 + p377 + p378 + p379) U (p82 <= p662 + p663 + p664 + p665 + p666 + p667))))
lola: processed formula length: 107
lola: 1 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 bytes per marking, with 31 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: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((p48 <= p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460))) U F (G ((1 <= p495)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((p48 <= p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460))) U F (G ((1 <= p495)))))
lola: processed formula: A ((G (F ((p48 <= p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460))) U F (G ((1 <= p495)))))
lola: processed formula length: 294
lola: 0 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 bytes per marking, with 30 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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (G ((2 <= p185 + p186 + p187 + p188 + p189 + p190))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G (G ((2 <= p185 + p186 + p187 + p188 + p189 + p190))))))
lola: processed formula: A (F (G (G (G ((2 <= p185 + p186 + p187 + p188 + p189 + p190))))))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 bytes per marking, with 30 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: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p97 <= p62))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p97 <= p62)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T06-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: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((p462 <= p551 + p552 + p553 + p554 + p555 + p556) U X ((1 <= p179 + p180 + p181 + p182 + p183 + p184)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p462 <= p551 + p552 + p553 + p554 + p555 + p556) U X ((1 <= p179 + p180 + p181 + p182 + p183 + p184)))))
lola: processed formula: A (X (((p462 <= p551 + p552 + p553 + p554 + p555 + p556) U X ((1 <= p179 + p180 + p181 + p182 + p183 + p184)))))
lola: processed formula length: 112
lola: 0 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 bytes per marking, with 29 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: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((p399 <= p380 + p381 + p382 + p383 + p384 + p385))) U G ((1 <= p239))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((p399 <= p380 + p381 + p382 + p383 + p384 + p385))) U G ((1 <= p239))))
lola: processed formula: A ((X (F ((p399 <= p380 + p381 + p382 + p383 + p384 + p385))) U G ((1 <= p239))))
lola: processed formula length: 81
lola: 0 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 bytes per marking, with 29 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: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p49 <= p62)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((p49 <= p62)))
lola: processed formula: A (F ((p49 <= p62)))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 bytes per marking, with 31 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: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (G (G ((1 <= p110 + p111 + p112 + p113 + p114 + p115))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (G (G ((1 <= p110 + p111 + p112 + p113 + p114 + p115))))))
lola: processed formula: A (F (X (G (G ((1 <= p110 + p111 + p112 + p113 + p114 + p115))))))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 bytes per marking, with 30 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: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p89) U (p324 <= p87 + p86 + p85 + p84 + p83 + p88))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((2 <= p89) U (p324 <= p87 + p86 + p85 + p84 + p83 + p88))))
lola: processed formula: A (G (((2 <= p89) U (p324 <= p87 + p86 + p85 + p84 + p83 + p88))))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 bytes per marking, with 30 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: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((3 <= p104 + p105 + p106 + p107 + p108 + p109)) U G ((p367 <= p374 + p375 + p376 + p377 + p378 + p379)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((3 <= p104 + p105 + p106 + p107 + p108 + p109)) U G ((p367 <= p374 + p375 + p376 + p377 + p378 + p379)))))
lola: processed formula: A (F ((F ((3 <= p104 + p105 + p106 + p107 + p108 + p109)) U G ((p367 <= p374 + p375 + p376 + p377 + p378 + p379)))))
lola: processed formula length: 116
lola: 0 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 bytes per marking, with 30 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: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (G (X ((p551 + p552 + p553 + p554 + p555 + p556 <= p110 + p111 + p112 + p113 + p114 + p115))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (G (X ((p551 + p552 + p553 + p554 + p555 + p556 <= p110 + p111 + p112 + p113 + p114 + p115))))))
lola: processed formula: A (G (G (G (X ((p551 + p552 + p553 + p554 + p555 + p556 <= p110 + p111 + p112 + p113 + p114 + p115))))))
lola: processed formula length: 104
lola: 0 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 bytes per marking, with 30 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: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p116 + p117 + p118 + p119 + p120 + p121 <= p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317) U (p418 + p419 + p420 + p421 + p422 + p423 <= p425 + p426 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p116 + p117 + p118 + p119 + p120 + p121 <= p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317) U (p418 + p419 + p420 + p421 + p422 + p423 <= p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460)) U (3 <= p557 + p558 + p559 + p560 + p561 + p563 + p564 + p565 + p566 + p567 + p569 + p570 + p571 + p572 + p573 + p575 + p576 + p577 + p578 + p579 + p581 + p582 + p583 + p584 + p585 + p587 + p588 + p589 + p590 + p591 + p598 + p597 + p596 + p595 + p594 + p593 + p592 + p586 + p580 + p574 + p568 + p562)))
lola: processed formula: A ((((p116 + p117 + p118 + p119 + p120 + p121 <= p276 + p277 + p278 + p279 + p280 + p281 + p282 + p283 + p284 + p285 + p286 + p287 + p288 + p289 + p290 + p291 + p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312 + p313 + p314 + p315 + p316 + p317) U (p418 + p419 + p420 + p421 + p422 + p423 <= p425 + p426 ... (shortened)
lola: processed formula length: 942
lola: 0 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 bytes per marking, with 30 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: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p374 + p375 + p376 + p377 + p378 + p379))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p374 + p375 + p376 + p377 + p378 + p379)
lola: processed formula length: 46
lola: 1 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T06-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: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p599 + p600 + p601 + p602 + p603 + p604))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p599 + p600 + p601 + p602 + p603 + p604)
lola: processed formula length: 46
lola: 1 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T06-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: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X ((1 <= p674 + p675 + p676 + p677 + p678 + p679)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (X ((1 <= p674 + p675 + p676 + p677 + p678 + p679)))))
lola: processed formula: A (X (F (X ((1 <= p674 + p675 + p676 + p677 + p678 + p679)))))
lola: processed formula length: 62
lola: 0 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 bytes per marking, with 30 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X (F ((1 <= p100 + p101 + p102 + p103 + p98 + p99))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F ((1 <= p100 + p101 + p102 + p103 + p98 + p99)))))
lola: processed formula: A (F (X (F ((1 <= p100 + p101 + p102 + p103 + p98 + p99)))))
lola: processed formula length: 60
lola: 1 rewrites
lola: formula mentions 0 of 700 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J06T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2572 bytes per marking, with 30 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: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no yes no no no no no no no yes no
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494672603579

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="PolyORBLF-COL-S06J06T06"
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/PolyORBLF-COL-S06J06T06.tgz
mv PolyORBLF-COL-S06J06T06 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is PolyORBLF-COL-S06J06T06, 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 r048-smll-149440869900410"
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 ;