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-S04J04T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-smll-149440869800320
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494624380615


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ PolyORBLF-COL-S04J04T06 @ 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: 3552/65536 symbol table entries, 457 collisions
lola: preprocessing...
lola: finding significant places
lola: 554 places, 2998 transitions, 504 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1821 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S04J04T06-LTLCardinality.task
lola: A (X ((F ((3 <= p89 + p88 + p87 + p86 + p85 + p84)) U (p123 + p124 + p125 + p126 + p127 + p128 <= p393)))) : A (G (F (G (X ((p464 + p465 + p466 + p467 + p468 + p469 <= p123 + p124 + p125 + p126 + p127 + p128)))))) : A (G (G ((3 <= p54 + p53 + p52 + p51 + p50 + p55)))) : A ((2 <= p95 + p94 + p93 + p92 + p91 + p96)) : A ((G (F ((p30 + p31 + p32 + p33 + p34 <= p100 + p101 + p102 + p98 + p97 + p99))) U ((p286 + p287 + p288 + p289 + p290 + p291 <= p395) U (p110 + p111 + p112 + p113 + p114 + p115 <= p422 + p423 + p424 + p425 + p426 + p427)))) : A (X (F (F (G ((1 <= p470 + p471 + p472 + p473 + p474 + p475)))))) : A (F ((F ((1 <= p89 + p88 + p87 + p86 + p85 + p84)) U X ((1 <= p470 + p471 + p472 + p473 + p474 + p475))))) : A ((X (G ((3 <= p529))) U (p109 <= p83))) : A ((G ((3 <= p507 + p508 + p509 + p510 + p511 + p512)) U G ((3 <= p273 + p274 + p275 + p276 + p277 + p278)))) : A ((p476 + p477 + p478 + p479 + p480 + p481 <= p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382)) : A ((1 <= p90)) : A ((p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 <= p384)) : A ((X (F ((2 <= p434 + p435 + p436 + p437 + p438 + p439))) U (p89 + p88 + p87 + p86 + p85 + p84 <= p24 + p25 + p26 + p27 + p28 + p29))) : A (F (F (((1 <= p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) U (3 <= p110 + p111 + p112 + p113 + p114 + p115))))) : A (F (F (F (X ((p65 + p64 + p63 + p62 + p61 + p60 <= p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463)))))) : A ((2 <= p528))
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 (X ((F ((3 <= p89 + p88 + p87 + p86 + p85 + p84)) U (p123 + p124 + p125 + p126 + p127 + p128 <= p393))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((3 <= p89 + p88 + p87 + p86 + p85 + p84)) U (p123 + p124 + p125 + p126 + p127 + p128 <= p393))))
lola: processed formula: A (X ((F ((3 <= p89 + p88 + p87 + p86 + p85 + p84)) U (p123 + p124 + p125 + p126 + p127 + p128 <= p393))))
lola: processed formula length: 106
lola: 0 rewrites
lola: formula mentions 0 of 554 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (X ((p464 + p465 + p466 + p467 + p468 + p469 <= p123 + p124 + p125 + p126 + p127 + p128))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X ((p464 + p465 + p466 + p467 + p468 + p469 <= p123 + p124 + p125 + p126 + p127 + p128)))))
lola: processed formula: A (F (G (X ((p464 + p465 + p466 + p467 + p468 + p469 <= p123 + p124 + p125 + p126 + p127 + p128)))))
lola: processed formula length: 100
lola: 1 rewrites
lola: formula mentions 0 of 554 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G ((3 <= p54 + p53 + p52 + p51 + p50 + p55))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G ((3 <= p54 + p53 + p52 + p51 + p50 + p55))))
lola: processed formula: A (G (G ((3 <= p54 + p53 + p52 + p51 + p50 + p55))))
lola: processed formula length: 52
lola: 0 rewrites
lola: formula mentions 0 of 554 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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 ((2 <= p95 + p94 + p93 + p92 + p91 + p96))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p95 + p94 + p93 + p92 + p91 + p96)
lola: processed formula length: 40
lola: 1 rewrites
lola: formula mentions 0 of 554 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T06-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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((p30 + p31 + p32 + p33 + p34 <= p100 + p101 + p102 + p98 + p97 + p99))) U ((p286 + p287 + p288 + p289 + p290 + p291 <= p395) U (p110 + p111 + p112 + p113 + p114 + p115 <= p422 + p423 + p424 + p425 + p426 + p427))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((p30 + p31 + p32 + p33 + p34 <= p100 + p101 + p102 + p98 + p97 + p99))) U ((p286 + p287 + p288 + p289 + p290 + p291 <= p395) U (p110 + p111 + p112 + p113 + p114 + p115 <= p422 + p423 + p424 + p425 + p426 + p427))))
lola: processed formula: A ((G (F ((p30 + p31 + p32 + p33 + p34 <= p100 + p101 + p102 + p98 + p97 + p99))) U ((p286 + p287 + p288 + p289 + p290 + p291 <= p395) U (p110 + p111 + p112 + p113 + p114 + p115 <= p422 + p423 + p424 + p425 + p426 + p427))))
lola: processed formula length: 224
lola: 0 rewrites
lola: formula mentions 0 of 554 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 29 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (G ((1 <= p470 + p471 + p472 + p473 + p474 + p475))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (G ((1 <= p470 + p471 + p472 + p473 + p474 + p475)))))
lola: processed formula: A (X (F (G ((1 <= p470 + p471 + p472 + p473 + p474 + p475)))))
lola: processed formula length: 62
lola: 1 rewrites
lola: formula mentions 0 of 554 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((1 <= p89 + p88 + p87 + p86 + p85 + p84)) U X ((1 <= p470 + p471 + p472 + p473 + p474 + p475)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((1 <= p89 + p88 + p87 + p86 + p85 + p84)) U X ((1 <= p470 + p471 + p472 + p473 + p474 + p475)))))
lola: processed formula: A (F ((F ((1 <= p89 + p88 + p87 + p86 + p85 + p84)) U X ((1 <= p470 + p471 + p472 + p473 + p474 + p475)))))
lola: processed formula length: 107
lola: 0 rewrites
lola: formula mentions 0 of 554 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((3 <= p529))) U (p109 <= p83)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((3 <= p529))) U (p109 <= p83)))
lola: processed formula: A ((X (G ((3 <= p529))) U (p109 <= p83)))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 554 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G ((3 <= p507 + p508 + p509 + p510 + p511 + p512)) U G ((3 <= p273 + p274 + p275 + p276 + p277 + p278))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((3 <= p507 + p508 + p509 + p510 + p511 + p512)) U G ((3 <= p273 + p274 + p275 + p276 + p277 + p278))))
lola: processed formula: A ((G ((3 <= p507 + p508 + p509 + p510 + p511 + p512)) U G ((3 <= p273 + p274 + p275 + p276 + p277 + p278))))
lola: processed formula length: 109
lola: 0 rewrites
lola: formula mentions 0 of 554 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 bytes per marking, with 29 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 ((p476 + p477 + p478 + p479 + p480 + p481 <= p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p476 + p477 + p478 + p479 + p480 + p481 <= p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382)
lola: processed formula length: 252
lola: 1 rewrites
lola: formula mentions 0 of 554 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T06-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 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p90))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p90)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 554 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T06-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 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 <= p384))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 <= p384)
lola: processed formula length: 175
lola: 1 rewrites
lola: formula mentions 0 of 554 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T06-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 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((2 <= p434 + p435 + p436 + p437 + p438 + p439))) U (p89 + p88 + p87 + p86 + p85 + p84 <= p24 + p25 + p26 + p27 + p28 + p29)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((2 <= p434 + p435 + p436 + p437 + p438 + p439))) U (p89 + p88 + p87 + p86 + p85 + p84 <= p24 + p25 + p26 + p27 + p28 + p29)))
lola: processed formula: A ((X (F ((2 <= p434 + p435 + p436 + p437 + p438 + p439))) U (p89 + p88 + p87 + p86 + p85 + p84 <= p24 + p25 + p26 + p27 + p28 + p29)))
lola: processed formula length: 135
lola: 0 rewrites
lola: formula mentions 0 of 554 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((1 <= p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) U (3 <= 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 (((1 <= p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) U (3 <= p110 + p111 + p112 + p113 + p114 + p115))))
lola: processed formula: A (F (((1 <= p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197) U (3 <= p110 + p111 + p112 + p113 + p114 + p115))))
lola: processed formula length: 231
lola: 1 rewrites
lola: formula mentions 0 of 554 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (X ((p65 + p64 + p63 + p62 + p61 + p60 <= p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((p65 + p64 + p63 + p62 + p61 + p60 <= p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463))))
lola: processed formula: A (F (X ((p65 + p64 + p63 + p62 + p61 + p60 <= p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463))))
lola: processed formula length: 216
lola: 2 rewrites
lola: formula mentions 0 of 554 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2020 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 ((2 <= p528))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p528)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 554 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S04J04T06-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: RESULT
lola:
SUMMARY: yes no no no yes no no yes no yes no yes yes no yes no
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S04J04T06-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494624381191

--------------------
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-S04J04T06"
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-S04J04T06.tgz
mv PolyORBLF-COL-S04J04T06 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-S04J04T06, 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-149440869800320"
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 ;