fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r028-blw3-149440264500608
Last Updated
June 27, 2017

About the Execution of LoLA for HouseConstruction-PT-050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15946.530 478185.00 478669.00 232.50 FTTTTFTFFTTTTFT? 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 HouseConstruction-PT-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264500608
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494727880323


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLCardinality @ HouseConstruction-PT-050 @ 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: 44/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 26 places, 18 transitions, 18 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from HouseConstruction-PT-050-LTLCardinality.task
lola: A (X (X (X (G ((1 <= p25)))))) : A (G (G (F (G ((p10 <= p12)))))) : A ((G (X ((2 <= p6))) U F (G ((3 <= p1))))) : A (F (X (((p1 <= p27) U (p10 <= p4))))) : A (F ((G ((2 <= p6)) U X ((3 <= p1))))) : A ((p18 <= p1)) : A (F (X (((1 <= p8) U (p26 <= p27))))) : A ((X (X ((p23 <= p25))) U G (X ((1 <= p26))))) : A (F ((p5 <= p19))) : A (X (G (F ((p1 <= p9))))) : A ((G (G ((3 <= p8))) U ((1 <= p20) U (p20 <= p15)))) : A (X ((p19 <= p10))) : A ((p15 <= p12)) : A ((3 <= p16)) : A (((p10 <= p23) U ((3 <= p25) U (p5 <= p2)))) : A (X (F (X ((2 <= p7)))))
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 (X (X (G ((1 <= p25))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((1 <= p25))))))
lola: processed formula: A (X (X (X (G ((1 <= p25))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (G ((p10 <= p12))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p10 <= p12))))
lola: processed formula: A (F (G ((p10 <= p12))))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((2 <= p6))) U F (G ((3 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (X ((2 <= p6))) U F (G ((3 <= p1)))))
lola: processed formula: A ((G (X ((2 <= p6))) U F (G ((3 <= p1)))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((p1 <= p27) U (p10 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (((p1 <= p27) U (p10 <= p4)))))
lola: processed formula: A (F (X (((p1 <= p27) U (p10 <= p4)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((2 <= p6)) U X ((3 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G ((2 <= p6)) U X ((3 <= p1)))))
lola: processed formula: A (F ((G ((2 <= p6)) U X ((3 <= p1)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p18 <= p1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p18 <= p1)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((1 <= p8) U (p26 <= p27)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (((1 <= p8) U (p26 <= p27)))))
lola: processed formula: A (F (X (((1 <= p8) U (p26 <= p27)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((p23 <= p25))) U G (X ((1 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((p23 <= p25))) U G (X ((1 <= p26)))))
lola: processed formula: A ((X (X ((p23 <= p25))) U G (X ((1 <= p26)))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p5 <= p19)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((p5 <= p19)))
lola: processed formula: A (F ((p5 <= p19)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F ((p1 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (F ((p1 <= p9)))))
lola: processed formula: A (X (G (F ((p1 <= p9)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 2540010 markings, 5674385 edges, 508002 markings/sec, 0 secs
lola: 4198540 markings, 9744466 edges, 331706 markings/sec, 5 secs
lola: 5908117 markings, 14017563 edges, 341915 markings/sec, 10 secs
lola: 7938604 markings, 19164769 edges, 406097 markings/sec, 15 secs
lola: 9882229 markings, 23750119 edges, 388725 markings/sec, 20 secs
lola: 11203723 markings, 27267153 edges, 264299 markings/sec, 25 secs
lola: 12229282 markings, 29998337 edges, 205112 markings/sec, 30 secs
lola: 13504315 markings, 33549317 edges, 255007 markings/sec, 35 secs
lola: 14566647 markings, 36635900 edges, 212466 markings/sec, 40 secs
lola: 15742945 markings, 39866172 edges, 235260 markings/sec, 45 secs
lola: 16914142 markings, 42672499 edges, 234239 markings/sec, 50 secs
lola: 18117706 markings, 45810191 edges, 240713 markings/sec, 55 secs
lola: 19779373 markings, 49987333 edges, 332333 markings/sec, 60 secs
lola: 21000205 markings, 53339286 edges, 244166 markings/sec, 65 secs
lola: 22328476 markings, 56940482 edges, 265654 markings/sec, 70 secs
lola: 23766463 markings, 60619174 edges, 287597 markings/sec, 75 secs
lola: 25404646 markings, 64628821 edges, 327637 markings/sec, 80 secs
lola: 26736331 markings, 68081911 edges, 266337 markings/sec, 85 secs
lola: 27865561 markings, 71072840 edges, 225846 markings/sec, 90 secs
lola: 29145318 markings, 74615007 edges, 255951 markings/sec, 95 secs
lola: 30058171 markings, 77324003 edges, 182571 markings/sec, 100 secs
lola: 31028277 markings, 80002077 edges, 194021 markings/sec, 105 secs
lola: 32006209 markings, 82615330 edges, 195586 markings/sec, 110 secs
lola: 32862979 markings, 85057961 edges, 171354 markings/sec, 115 secs
lola: 33695104 markings, 87541366 edges, 166425 markings/sec, 120 secs
lola: 35144485 markings, 91610134 edges, 289876 markings/sec, 125 secs
lola: 36233791 markings, 94866693 edges, 217861 markings/sec, 130 secs
lola: 37198426 markings, 97807569 edges, 192927 markings/sec, 135 secs
lola: 38019028 markings, 100340629 edges, 164120 markings/sec, 140 secs
lola: 38962297 markings, 103093249 edges, 188654 markings/sec, 145 secs
lola: 39962025 markings, 105939842 edges, 199946 markings/sec, 150 secs
lola: 41009386 markings, 108752021 edges, 209472 markings/sec, 155 secs
lola: 41984689 markings, 111156154 edges, 195061 markings/sec, 160 secs
lola: 42879067 markings, 113537003 edges, 178876 markings/sec, 165 secs
lola: 43876714 markings, 116181626 edges, 199529 markings/sec, 170 secs
lola: 44830034 markings, 118823505 edges, 190664 markings/sec, 175 secs
lola: 46402619 markings, 122754435 edges, 314517 markings/sec, 180 secs
lola: 47809942 markings, 126477087 edges, 281465 markings/sec, 185 secs
lola: 49068613 markings, 129872592 edges, 251734 markings/sec, 190 secs
lola: 50225942 markings, 133102964 edges, 231466 markings/sec, 195 secs
lola: 51201814 markings, 135863787 edges, 195174 markings/sec, 200 secs
lola: 52125332 markings, 138543935 edges, 184704 markings/sec, 205 secs
lola: 53322928 markings, 141793266 edges, 239519 markings/sec, 210 secs
lola: 54264387 markings, 144567530 edges, 188292 markings/sec, 215 secs
lola: 55503414 markings, 147689591 edges, 247805 markings/sec, 220 secs
lola: 56560606 markings, 150465450 edges, 211438 markings/sec, 225 secs
lola: 57596935 markings, 153174425 edges, 207266 markings/sec, 230 secs
lola: 58842289 markings, 156175480 edges, 249071 markings/sec, 235 secs
lola: 59848007 markings, 158817624 edges, 201144 markings/sec, 240 secs
lola: 60801869 markings, 161273993 edges, 190772 markings/sec, 245 secs
lola: 61589449 markings, 163442051 edges, 157516 markings/sec, 250 secs
lola: 62600119 markings, 166304244 edges, 202134 markings/sec, 255 secs
lola: 63341761 markings, 168483035 edges, 148328 markings/sec, 260 secs
lola: 64349698 markings, 171273383 edges, 201587 markings/sec, 265 secs
lola: 65352715 markings, 173961195 edges, 200603 markings/sec, 270 secs
lola: 66170563 markings, 176284754 edges, 163570 markings/sec, 275 secs
lola: 66974977 markings, 178690909 edges, 160883 markings/sec, 280 secs
lola: 68227702 markings, 182209890 edges, 250545 markings/sec, 285 secs
lola: 69122419 markings, 184857213 edges, 178943 markings/sec, 290 secs
lola: 69980128 markings, 187467554 edges, 171542 markings/sec, 295 secs
lola: 70863045 markings, 190117456 edges, 176583 markings/sec, 300 secs
lola: 71580460 markings, 192401893 edges, 143483 markings/sec, 305 secs
lola: 72589874 markings, 195215253 edges, 201883 markings/sec, 310 secs
lola: 73463059 markings, 197763112 edges, 174637 markings/sec, 315 secs
lola: 74409619 markings, 200307475 edges, 189312 markings/sec, 320 secs
lola: 75157227 markings, 202396450 edges, 149522 markings/sec, 325 secs
lola: 75838663 markings, 204446159 edges, 136287 markings/sec, 330 secs
lola: 76640143 markings, 206760950 edges, 160296 markings/sec, 335 secs
lola: 77310979 markings, 208865490 edges, 134167 markings/sec, 340 secs
lola: 77998519 markings, 210985435 edges, 137508 markings/sec, 345 secs
lola: 79053688 markings, 213989175 edges, 211034 markings/sec, 350 secs
lola: 80309374 markings, 217602952 edges, 251137 markings/sec, 355 secs
lola: 81323581 markings, 220698038 edges, 202841 markings/sec, 360 secs
lola: 82395526 markings, 223938612 edges, 214389 markings/sec, 365 secs
lola: 83414428 markings, 227137267 edges, 203780 markings/sec, 370 secs
lola: 84347797 markings, 230070102 edges, 186674 markings/sec, 375 secs
lola: 85063258 markings, 232370115 edges, 143092 markings/sec, 380 secs
lola: 85942095 markings, 235016535 edges, 175767 markings/sec, 385 secs
lola: 86728180 markings, 237527950 edges, 157217 markings/sec, 390 secs
lola: 87460423 markings, 239906505 edges, 146449 markings/sec, 395 secs
lola: 88449970 markings, 242825019 edges, 197909 markings/sec, 400 secs
lola: 89426416 markings, 245600714 edges, 195289 markings/sec, 405 secs
lola: 90317436 markings, 248227064 edges, 178204 markings/sec, 410 secs
lola: 91108535 markings, 250657432 edges, 158220 markings/sec, 415 secs
lola: 92181806 markings, 253334088 edges, 214654 markings/sec, 420 secs
lola: 93055975 markings, 255555693 edges, 174834 markings/sec, 425 secs
lola: 93968164 markings, 257927341 edges, 182438 markings/sec, 430 secs
lola: 94812706 markings, 260219740 edges, 168908 markings/sec, 435 secs
lola: 95595880 markings, 262392358 edges, 156635 markings/sec, 440 secs
lola: 96632661 markings, 265091002 edges, 207356 markings/sec, 445 secs
lola: 97500799 markings, 267580023 edges, 173628 markings/sec, 450 secs
lola: 98271028 markings, 269862935 edges, 154046 markings/sec, 455 secs
lola: 99169519 markings, 272315079 edges, 179698 markings/sec, 460 secs
lola: 100367832 markings, 275335327 edges, 239663 markings/sec, 465 secs
lola: 101798401 markings, 279046195 edges, 286114 markings/sec, 470 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 510 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((3 <= p8))) U ((1 <= p20) U (p20 <= p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (G ((3 <= p8))) U ((1 <= p20) U (p20 <= p15))))
lola: processed formula: A ((G (G ((3 <= p8))) U ((1 <= p20) U (p20 <= p15))))
lola: processed formula length: 53
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: subprocess 11 will run for 612 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p19 <= p10)))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p19 <= p10)))
lola: processed formula: A (X ((p19 <= p10)))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 12 will run for 765 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p15 <= p12))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p15 <= p12)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-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 13 will run for 1020 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p16))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p16)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1531 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p10 <= p23) U ((3 <= p25) U (p5 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p10 <= p23) U ((3 <= p25) U (p5 <= p2))))
lola: processed formula: A (((p10 <= p23) U ((3 <= p25) U (p5 <= p2))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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: 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 3062 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X ((2 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (X ((2 <= p7)))))
lola: processed formula: A (X (F (X ((2 <= p7)))))
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 26 places; total mentions: 0
lola: closed formula file HouseConstruction-PT-050-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 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 yes no yes yes yes yes no yes unknown yes yes yes no yes no
lola: ========================================
FORMULA HouseConstruction-PT-050-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HouseConstruction-PT-050-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494728358508

--------------------
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="HouseConstruction-PT-050"
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/HouseConstruction-PT-050.tgz
mv HouseConstruction-PT-050 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 HouseConstruction-PT-050, 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 r028-blw3-149440264500608"
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 ;