fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r128-smll-149441681500392
Last Updated
June 27, 2017

About the Execution of LoLA for S_PolyORBLF-COL-S06J04T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1238.120 294742.00 301049.00 1005.10 F?TTFFFFFFFFTFFF normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_PolyORBLF-COL-S06J04T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-149441681500392
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496427967798


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PolyORBLF-COL-S06J04T08: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_PolyORBLF-COL-S06J04T08: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
LTLCardinality @ S_PolyORBLF-COL-S06J04T08 @ 3535 seconds
----- Start make result stdout -----
lola: LoLA will run for 3535 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 14824/65536 symbol table entries, 5181 collisions
lola: preprocessing...
lola: finding significant places
lola: 810 places, 14014 transitions, 752 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3639 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: A ((F (X ((p543 + p544 + p545 + p546 + p547 <= p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389))) U G (F ((2 <= p168))))) : A (G (F (G ((p72 + p71 + p70 + p69 + p68 + p67 + p66 + p73 <= p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356))))) : A ((p399 <= p761 + p760 + p759 + p758 + p757 + p756 + p755 + p754)) : A (X ((2 <= p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381))) : A ((X (F ((1 <= p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312))) U X (G ((1 <= p313 + p314 + p315 + p316 + p317 + p318))))) : A (G ((p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 <= p494))) : A (F ((p487 <= p493))) : A (F ((X ((p187 <= p168)) U F ((1 <= p296))))) : A ((2 <= p457 + p458 + p459 + p460 + p461)) : A (G (F (X (G ((p296 <= p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326)))))) : A (F ((p724 + p725 + p726 + p727 + p728 <= p627))) : A ((p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 <= p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129)) : A ((((2 <= p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486) U (p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 <= p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753)) U (2 <= p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176))) : A ((F (G ((p187 <= p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564))) U (1 <= p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381))) : A ((2 <= p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486)) : A (G (F (G (X ((p245 <= p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + 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))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((p543 + p544 + p545 + p546 + p547 <= p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389))) U G (F ((2 <= p168)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (X ((p543 + p544 + p545 + p546 + p547 <= p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389))) U G (F ((2 <= p168)))))
lola: processed formula: A ((F (X ((p543 + p544 + p545 + p546 + p547 <= p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389))) U G (F ((2 <= p168)))))
lola: processed formula length: 127
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G ((p72 + p71 + p70 + p69 + p68 + p67 + p66 + p73 <= p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p72 + p71 + p70 + p69 + p68 + p67 + p66 + p73 <= p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356))))
lola: processed formula: A (F (G ((p72 + p71 + p70 + p69 + p68 + p67 + p66 + p73 <= p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356))))
lola: processed formula length: 116
lola: 1 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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: 1820 markings, 3353 edges, 364 markings/sec, 0 secs
lola: 3521 markings, 6766 edges, 340 markings/sec, 5 secs
lola: 5226 markings, 10169 edges, 341 markings/sec, 10 secs
lola: 6870 markings, 13494 edges, 329 markings/sec, 15 secs
lola: 8525 markings, 16811 edges, 331 markings/sec, 20 secs
lola: 10224 markings, 20234 edges, 340 markings/sec, 25 secs
lola: 11868 markings, 23558 edges, 329 markings/sec, 30 secs
lola: 13503 markings, 26856 edges, 327 markings/sec, 35 secs
lola: 15146 markings, 30145 edges, 329 markings/sec, 40 secs
lola: 16739 markings, 33372 edges, 319 markings/sec, 45 secs
lola: 18331 markings, 36632 edges, 318 markings/sec, 50 secs
lola: 20026 markings, 39999 edges, 339 markings/sec, 55 secs
lola: 21679 markings, 43328 edges, 331 markings/sec, 60 secs
lola: 23313 markings, 46635 edges, 327 markings/sec, 65 secs
lola: 24917 markings, 49880 edges, 321 markings/sec, 70 secs
lola: 26530 markings, 53128 edges, 323 markings/sec, 75 secs
lola: 28185 markings, 56466 edges, 331 markings/sec, 80 secs
lola: 29767 markings, 59679 edges, 316 markings/sec, 85 secs
lola: 31382 markings, 62902 edges, 323 markings/sec, 90 secs
lola: 32981 markings, 66137 edges, 320 markings/sec, 95 secs
lola: 34564 markings, 69351 edges, 317 markings/sec, 100 secs
lola: 36148 markings, 72563 edges, 317 markings/sec, 105 secs
lola: 37711 markings, 75734 edges, 313 markings/sec, 110 secs
lola: 39363 markings, 79305 edges, 330 markings/sec, 115 secs
lola: 40923 markings, 82725 edges, 312 markings/sec, 120 secs
lola: 42500 markings, 86075 edges, 315 markings/sec, 125 secs
lola: 44024 markings, 89463 edges, 305 markings/sec, 130 secs
lola: 45577 markings, 92778 edges, 311 markings/sec, 135 secs
lola: 47026 markings, 96011 edges, 290 markings/sec, 140 secs
lola: 48522 markings, 99174 edges, 299 markings/sec, 145 secs
lola: 50039 markings, 102421 edges, 303 markings/sec, 150 secs
lola: 51566 markings, 105708 edges, 305 markings/sec, 155 secs
lola: 53035 markings, 108894 edges, 294 markings/sec, 160 secs
lola: 54539 markings, 112088 edges, 301 markings/sec, 165 secs
lola: 56004 markings, 115236 edges, 293 markings/sec, 170 secs
lola: 57492 markings, 118448 edges, 298 markings/sec, 175 secs
lola: 58890 markings, 121467 edges, 280 markings/sec, 180 secs
lola: 60345 markings, 124581 edges, 291 markings/sec, 185 secs
lola: 61819 markings, 127649 edges, 295 markings/sec, 190 secs
lola: 63369 markings, 130942 edges, 310 markings/sec, 195 secs
lola: 64874 markings, 134131 edges, 301 markings/sec, 200 secs
lola: 66384 markings, 137323 edges, 302 markings/sec, 205 secs
lola: 67851 markings, 140436 edges, 293 markings/sec, 210 secs
lola: 69330 markings, 143584 edges, 296 markings/sec, 215 secs
lola: 70801 markings, 146682 edges, 294 markings/sec, 220 secs
lola: 72255 markings, 149770 edges, 291 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p399 <= p761 + p760 + p759 + p758 + p757 + p756 + p755 + p754))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p399 <= p761 + p760 + p759 + p758 + p757 + p756 + p755 + p754)
lola: processed formula length: 63
lola: 1 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-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 3 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((2 <= p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381)))
lola: processed formula: A (X ((2 <= p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381)))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((1 <= p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312))) U X (G ((1 <= p313 + p314 + p315 + p316 + p317 + p318)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((1 <= p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312)) U G ((1 <= p313 + p314 + p315 + p316 + p317 + p318)))))
lola: processed formula: A (X ((F ((1 <= p305 + p306 + p307 + p308 + p309 + p310 + p311 + p312)) U G ((1 <= p313 + p314 + p315 + p316 + p317 + p318)))))
lola: processed formula length: 127
lola: 1 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 <= p494)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 329 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p487 <= p493)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((p487 <= p493)))
lola: processed formula: A (F ((p487 <= p493)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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 366 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((p187 <= p168)) U F ((1 <= p296)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X ((p187 <= p168)) U F ((1 <= p296)))))
lola: processed formula: A (F ((X ((p187 <= p168)) U F ((1 <= p296)))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 bytes per marking, with 31 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 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p457 + p458 + p459 + p460 + p461))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p457 + p458 + p459 + p460 + p461)
lola: processed formula length: 39
lola: 1 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-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 9 will run for 471 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (X (G ((p296 <= p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (X (G ((p296 <= p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326))))))
lola: processed formula: A (G (F (X (G ((p296 <= p319 + p320 + p321 + p322 + p323 + p324 + p325 + p326))))))
lola: processed formula length: 83
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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: 70217 markings, 264243 edges, 14043 markings/sec, 0 secs
lola: 143547 markings, 555714 edges, 14666 markings/sec, 5 secs
lola: 214386 markings, 864498 edges, 14168 markings/sec, 10 secs
lola: 285123 markings, 1171825 edges, 14147 markings/sec, 15 secs
lola: 360080 markings, 1491262 edges, 14991 markings/sec, 20 secs
lola: 436094 markings, 1822091 edges, 15203 markings/sec, 25 secs
lola: 513857 markings, 2158266 edges, 15553 markings/sec, 30 secs
lola: 585485 markings, 2440230 edges, 14326 markings/sec, 35 secs
lola: 655573 markings, 2745271 edges, 14018 markings/sec, 40 secs
lola: 729155 markings, 3058894 edges, 14716 markings/sec, 45 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p724 + p725 + p726 + p727 + p728 <= p627)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((p724 + p725 + p726 + p727 + p728 <= p627)))
lola: processed formula: A (F ((p724 + p725 + p726 + p727 + p728 <= p627)))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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 11 will run for 649 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 <= p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 <= p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129)
lola: processed formula length: 336
lola: 1 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-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 811 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486) U (p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p6... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486) U (p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 <= p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753)) U (2 <= p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176)))
lola: processed formula: A ((((2 <= p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486) U (p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 + p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p6... (shortened)
lola: processed formula length: 526
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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 13 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((p187 <= p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564))) U (1 <= p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((p187 <= p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564))) U (1 <= p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381)))
lola: processed formula: A ((F (G ((p187 <= p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564))) U (1 <= p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381)))
lola: processed formula length: 140
lola: 0 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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 14 will run for 1622 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486)
lola: processed formula length: 60
lola: 1 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-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 15 will run for 3245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (X ((p245 <= p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + 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))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X ((p245 <= p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + 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)))))
lola: processed formula: A (F (G (X ((p245 <= p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + 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)))))
lola: processed formula length: 359
lola: 1 rewrites
lola: formula mentions 0 of 810 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S06J04T08-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3012 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: RESULT
lola:
SUMMARY: no unknown no no no no yes no no no yes yes no no no no
lola: ========================================
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S06J04T08-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496428262540

--------------------
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="S_PolyORBLF-COL-S06J04T08"
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/S_PolyORBLF-COL-S06J04T08.tgz
mv S_PolyORBLF-COL-S06J04T08 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 S_PolyORBLF-COL-S06J04T08, 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 r128-smll-149441681500392"
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 ;