About the Execution of LoLA for S_PolyORBLF-COL-S02J06T08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6832.730 | 354203.00 | 354889.00 | 1007.60 | TFFTFTFFTFFF?TFT | 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-S02J06T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-149441681400302
=====================================================================
--------------------
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-S02J06T08-LTLCardinality-0
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-1
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-15
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-2
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-3
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-4
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-5
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-6
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-7
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-8
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496380226716
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PolyORBLF-COL-S02J06T08: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_PolyORBLF-COL-S02J06T08: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
LTLCardinality @ S_PolyORBLF-COL-S02J06T08 @ 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: 2124/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 690 places, 1434 transitions, 636 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2005 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: A (F (((2 <= p256 + p257) U X ((p615 <= p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307))))) : A (X ((3 <= p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23))) : A ((p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 <= p422)) : A ((2 <= p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265)) : A ((2 <= p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353)) : A (X (F (G (G ((1 <= p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439)))))) : A (G (F (((p291 <= p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688) U (p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 <= p689))))) : A (X (F (F ((1 <= p689))))) : A (G (X (X (F ((p237 + p238 + p239 + p240 + p241 + p242 + p243 <= p256 + p257)))))) : A ((p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571)) : A (F (X (((p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 <= p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235) U (3 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187))))) : A ((p237 + p238 + p239 + p240 + p241 + p242 + p243 <= p612)) : A (F (X (X (X ((2 <= p236)))))) : A (F (F (X ((p245 <= p632))))) : A ((F ((p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 <= p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273)) U X (G ((p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 <= p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631))))) : A (X ((p421 <= p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556)))
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 (((2 <= p256 + p257) U X ((p615 <= p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((2 <= p256 + p257) U X ((p615 <= p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307)))))
lola: processed formula: A (F (((2 <= p256 + p257) U X ((p615 <= p292 + p293 + p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 + p304 + p305 + p306 + p307)))))
lola: processed formula length: 154
lola: 0 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2548 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 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((3 <= p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23)))
lola: processed formula: A (X ((3 <= p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23)))
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2548 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 ((p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 <= p422))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 <= p422)
lola: processed formula length: 63
lola: 1 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265)
lola: processed formula length: 60
lola: 1 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-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 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353)
lola: processed formula length: 60
lola: 1 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G (G ((1 <= p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (G (G ((1 <= p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439))))))
lola: processed formula: A (X (F (G (G ((1 <= p432 + p433 + p434 + p435 + p436 + p437 + p438 + p439))))))
lola: processed formula length: 80
lola: 0 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2548 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 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((p291 <= p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688) U (p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 <= p689)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((p291 <= p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688) U (p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 <= p689)))))
lola: processed formula: A (G (F (((p291 <= p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688) U (p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 <= p689)))))
lola: processed formula length: 143
lola: 0 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2548 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: 72007 markings, 75916 edges, 14401 markings/sec, 0 secs
lola: 148076 markings, 157965 edges, 15214 markings/sec, 5 secs
lola: 229213 markings, 246176 edges, 16227 markings/sec, 10 secs
lola: 310823 markings, 335547 edges, 16322 markings/sec, 15 secs
lola: 392689 markings, 425757 edges, 16373 markings/sec, 20 secs
lola: 473900 markings, 515567 edges, 16242 markings/sec, 25 secs
lola: 554699 markings, 605357 edges, 16160 markings/sec, 30 secs
lola: 636072 markings, 696353 edges, 16275 markings/sec, 35 secs
lola: 717884 markings, 787833 edges, 16362 markings/sec, 40 secs
lola: 798525 markings, 878445 edges, 16128 markings/sec, 45 secs
lola: 879222 markings, 969235 edges, 16139 markings/sec, 50 secs
lola: 961094 markings, 1061651 edges, 16374 markings/sec, 55 secs
lola: 1042684 markings, 1153856 edges, 16318 markings/sec, 60 secs
lola: 1124014 markings, 1245642 edges, 16266 markings/sec, 65 secs
lola: 1205460 markings, 1337637 edges, 16289 markings/sec, 70 secs
lola: 1288059 markings, 1431890 edges, 16520 markings/sec, 75 secs
lola: 1369464 markings, 1524686 edges, 16281 markings/sec, 80 secs
lola: 1450628 markings, 1617030 edges, 16233 markings/sec, 85 secs
lola: 1532202 markings, 1710772 edges, 16315 markings/sec, 90 secs
lola: 1614039 markings, 1804469 edges, 16367 markings/sec, 95 secs
lola: 1694817 markings, 1897442 edges, 16156 markings/sec, 100 secs
lola: 1776838 markings, 1991540 edges, 16404 markings/sec, 105 secs
lola: 1859004 markings, 2085805 edges, 16433 markings/sec, 110 secs
lola: 1942010 markings, 2182291 edges, 16601 markings/sec, 115 secs
lola: 2023985 markings, 2277390 edges, 16395 markings/sec, 120 secs
lola: 2105668 markings, 2372729 edges, 16337 markings/sec, 125 secs
lola: 2187809 markings, 2468607 edges, 16428 markings/sec, 130 secs
lola: 2270872 markings, 2565683 edges, 16613 markings/sec, 135 secs
lola: 2352365 markings, 2660820 edges, 16299 markings/sec, 140 secs
lola: 2434042 markings, 2756183 edges, 16335 markings/sec, 145 secs
lola: 2515110 markings, 2850176 edges, 16214 markings/sec, 150 secs
lola: 2595783 markings, 2944281 edges, 16135 markings/sec, 155 secs
lola: 2674985 markings, 3036633 edges, 15840 markings/sec, 160 secs
lola: 2755997 markings, 3130816 edges, 16202 markings/sec, 165 secs
lola: 2837239 markings, 3226069 edges, 16248 markings/sec, 170 secs
lola: 2917963 markings, 3319934 edges, 16145 markings/sec, 175 secs
lola: 2999539 markings, 3415575 edges, 16315 markings/sec, 180 secs
lola: 3081424 markings, 3512044 edges, 16377 markings/sec, 185 secs
lola: 3163319 markings, 3608233 edges, 16379 markings/sec, 190 secs
lola: 3244076 markings, 3703148 edges, 16151 markings/sec, 195 secs
lola: 3324608 markings, 3797815 edges, 16106 markings/sec, 200 secs
lola: 3406654 markings, 3894126 edges, 16409 markings/sec, 205 secs
lola: 3486918 markings, 3987909 edges, 16053 markings/sec, 210 secs
lola: 3566113 markings, 4080016 edges, 15839 markings/sec, 215 secs
lola: 3644900 markings, 4171867 edges, 15757 markings/sec, 220 secs
lola: 3724173 markings, 4265814 edges, 15855 markings/sec, 225 secs
lola: 3805018 markings, 4362287 edges, 16169 markings/sec, 230 secs
lola: 3886615 markings, 4458772 edges, 16319 markings/sec, 235 secs
lola: 3967459 markings, 4554020 edges, 16169 markings/sec, 240 secs
lola: 4045668 markings, 4645278 edges, 15642 markings/sec, 245 secs
lola: 4125080 markings, 4737755 edges, 15882 markings/sec, 250 secs
lola: 4205198 markings, 4832006 edges, 16024 markings/sec, 255 secs
lola: 4285590 markings, 4927754 edges, 16078 markings/sec, 260 secs
lola: 4364813 markings, 5022274 edges, 15845 markings/sec, 265 secs
lola: 4444354 markings, 5116544 edges, 15908 markings/sec, 270 secs
lola: 4526423 markings, 5214493 edges, 16414 markings/sec, 275 secs
lola: 4605745 markings, 5308639 edges, 15864 markings/sec, 280 secs
lola: 4686436 markings, 5404819 edges, 16138 markings/sec, 285 secs
lola: 4767540 markings, 5501549 edges, 16221 markings/sec, 290 secs
lola: 4846755 markings, 5594757 edges, 15843 markings/sec, 295 secs
lola: 4926795 markings, 5690026 edges, 16008 markings/sec, 300 secs
lola: 5007503 markings, 5786473 edges, 16142 markings/sec, 305 secs
lola: 5085338 markings, 5879325 edges, 15567 markings/sec, 310 secs
lola: 5165454 markings, 5976583 edges, 16023 markings/sec, 315 secs
lola: 5245074 markings, 6072068 edges, 15924 markings/sec, 320 secs
lola: 5323294 markings, 6164849 edges, 15644 markings/sec, 325 secs
lola: 5402734 markings, 6260762 edges, 15888 markings/sec, 330 secs
lola: 5483153 markings, 6357411 edges, 16084 markings/sec, 335 secs
lola: 5564193 markings, 6454376 edges, 16208 markings/sec, 340 secs
lola: 5643486 markings, 6548683 edges, 15859 markings/sec, 345 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F ((1 <= p689)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= p689))))
lola: processed formula: A (X (F ((1 <= p689))))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2548 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 398 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (X (F ((p237 + p238 + p239 + p240 + p241 + p242 + p243 <= p256 + p257))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (X (F ((p237 + p238 + p239 + p240 + p241 + p242 + p243 <= p256 + p257))))))
lola: processed formula: A (G (X (X (F ((p237 + p238 + p239 + p240 + p241 + p242 + p243 <= p256 + p257))))))
lola: processed formula length: 83
lola: 0 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2548 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 9 will run for 455 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571)
lola: processed formula length: 112
lola: 1 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-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 531 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 <= p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235) U (3 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p17... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (((p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 <= p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235) U (3 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187)))))
lola: processed formula: A (F (X (((p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 <= p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235) U (3 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p17... (shortened)
lola: processed formula length: 525
lola: 0 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2548 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 637 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p237 + p238 + p239 + p240 + p241 + p242 + p243 <= p612))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p237 + p238 + p239 + p240 + p241 + p242 + p243 <= p612)
lola: processed formula length: 56
lola: 1 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-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 796 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (X (X ((2 <= p236))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (X (X ((2 <= p236))))))
lola: processed formula: A (F (X (X (X ((2 <= p236))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2548 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 13 will run for 1062 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X ((p245 <= p632)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X ((p245 <= p632))))
lola: processed formula: A (F (X ((p245 <= p632))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2548 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 14 will run for 1593 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 <= p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273)) U X (G ((p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 <= p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 <= p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273)) U X (G ((p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 <= p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631)))))
lola: processed formula: A ((F ((p332 + p333 + p334 + p335 + p336 + p337 + p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 <= p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273)) U X (G ((p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 <= p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631)))))
lola: processed formula length: 343
lola: 0 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2548 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 15 will run for 3186 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p421 <= p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p421 <= p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556)))
lola: processed formula: A (X ((p421 <= p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556)))
lola: processed formula length: 71
lola: 0 rewrites
lola: formula mentions 0 of 690 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2548 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: yes no yes no no no unknown yes no yes no yes no yes no no
lola: ========================================
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496380580919
--------------------
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-S02J06T08"
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-S02J06T08.tgz
mv S_PolyORBLF-COL-S02J06T08 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-S02J06T08, 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-149441681400302"
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 '
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 ;