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_BridgeAndVehicles-COL-V50P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074300329
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496340965533


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_BridgeAndVehicles-COL-V50P20N10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_BridgeAndVehicles-COL-V50P20N10: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
LTLCardinality @ S_BridgeAndVehicles-COL-V50P20N10 @ 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: 1456/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 128 places, 1328 transitions, 121 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1653 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: A ((p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 <= p6)) : A (G (X ((p75 + p76 <= p9)))) : A ((((2 <= p4) U (p75 + p76 <= p6)) U X (F ((p7 <= p98 + p97 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p96 + p95 + p94 + p93 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99))))) : A ((2 <= p1 + p2)) : A ((((2 <= p3) U (3 <= p7)) U F (X ((1 <= p3))))) : A (X (F (F ((3 <= p3))))) : A (F (X (F (G ((p5 <= p11 + p12)))))) : A ((1 <= p8)) : A (F (F ((3 <= p4)))) : A (X ((3 <= p75 + p76))) : A ((1 <= p1 + p2)) : A ((2 <= p7)) : A (((p7 <= p9) U ((p7 <= p1 + p2) U (2 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23)))) : A (G (X (((p4 <= p75 + p76) U (p8 <= p11 + p12))))) : A (F (F ((p8 <= p4)))) : A (G ((1 <= p1 + p2)))
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 ((p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 <= p6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 <= p6)
lola: processed formula length: 311
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((p75 + p76 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X ((p75 + p76 <= p9))))
lola: processed formula: A (G (X ((p75 + p76 <= p9))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 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 ((((2 <= p4) U (p75 + p76 <= p6)) U X (F ((p7 <= p98 + p97 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p96 + p95 + p94 + p93 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= p4) U (p75 + p76 <= p6)) U X (F ((p7 <= p98 + p97 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p96 + p95 + p94 + p93 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)))))
lola: processed formula: A ((((2 <= p4) U (p75 + p76 <= p6)) U X (F ((p7 <= p98 + p97 + p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p96 + p95 + p94 + p93 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)))))
lola: processed formula length: 387
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p1 + p2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p1 + p2)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p3) U (3 <= p7)) U F (X ((1 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= p3) U (3 <= p7)) U F (X ((1 <= p3)))))
lola: processed formula: A ((((2 <= p3) U (3 <= p7)) U F (X ((1 <= p3)))))
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 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: 930046 markings, 2706285 edges, 186009 markings/sec, 0 secs
lola: 1718729 markings, 4452002 edges, 157737 markings/sec, 5 secs
lola: 2616118 markings, 6334117 edges, 179478 markings/sec, 10 secs
lola: 3488647 markings, 8146993 edges, 174506 markings/sec, 15 secs
lola: 4495590 markings, 10167449 edges, 201389 markings/sec, 20 secs
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 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F ((3 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((3 <= p3))))
lola: processed formula: A (X (F ((3 <= p3))))
lola: processed formula length: 21
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 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: 985306 markings, 2963782 edges, 197061 markings/sec, 0 secs
lola: 1874407 markings, 4918694 edges, 177820 markings/sec, 5 secs
lola: 2727211 markings, 6713891 edges, 170561 markings/sec, 10 secs
lola: 3683610 markings, 8867185 edges, 191280 markings/sec, 15 secs
lola: 4429402 markings, 11316835 edges, 149158 markings/sec, 20 secs
lola: 4949861 markings, 12929998 edges, 104092 markings/sec, 25 secs
lola: 5487247 markings, 14678706 edges, 107477 markings/sec, 30 secs
lola: 6062482 markings, 16595278 edges, 115047 markings/sec, 35 secs
lola: 6651001 markings, 18525420 edges, 117704 markings/sec, 40 secs
lola: 7268033 markings, 20549485 edges, 123406 markings/sec, 45 secs
lola: 7911776 markings, 22751426 edges, 128749 markings/sec, 50 secs
lola: 8576978 markings, 24949754 edges, 133040 markings/sec, 55 secs
lola: 9196608 markings, 27027414 edges, 123926 markings/sec, 60 secs
lola: 9812867 markings, 29115790 edges, 123252 markings/sec, 65 secs
lola: 10454057 markings, 31283603 edges, 128238 markings/sec, 70 secs
lola: 11201109 markings, 33827657 edges, 149410 markings/sec, 75 secs
lola: 11912319 markings, 36177222 edges, 142242 markings/sec, 80 secs
lola: 12470139 markings, 38000082 edges, 111564 markings/sec, 85 secs
lola: 13028636 markings, 39855351 edges, 111699 markings/sec, 90 secs
lola: 13623649 markings, 41869185 edges, 119003 markings/sec, 95 secs
lola: 14243165 markings, 43941939 edges, 123903 markings/sec, 100 secs
lola: 14853535 markings, 46055039 edges, 122074 markings/sec, 105 secs
lola: 15438456 markings, 48049917 edges, 116984 markings/sec, 110 secs
lola: 16059274 markings, 50165124 edges, 124164 markings/sec, 115 secs
lola: 16675557 markings, 52279563 edges, 123257 markings/sec, 120 secs
lola: 17300755 markings, 54397357 edges, 125040 markings/sec, 125 secs
lola: 17906456 markings, 56453441 edges, 121140 markings/sec, 130 secs
lola: 18576047 markings, 58788745 edges, 133918 markings/sec, 135 secs
lola: 19378431 markings, 61335938 edges, 160477 markings/sec, 140 secs
lola: 20158717 markings, 63736518 edges, 156057 markings/sec, 145 secs
lola: 20872403 markings, 66201557 edges, 142737 markings/sec, 150 secs
lola: 21665331 markings, 68716259 edges, 158586 markings/sec, 155 secs
lola: 22424644 markings, 71099401 edges, 151863 markings/sec, 160 secs
lola: 23214349 markings, 73592008 edges, 157941 markings/sec, 165 secs
lola: 23966632 markings, 75962548 edges, 150457 markings/sec, 170 secs
lola: 24704999 markings, 78508990 edges, 147673 markings/sec, 175 secs
lola: 25487760 markings, 80917894 edges, 156552 markings/sec, 180 secs
lola: 26276345 markings, 83453176 edges, 157717 markings/sec, 185 secs
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 6 will run for 332 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (G ((p5 <= p11 + p12))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F (G ((p5 <= p11 + p12))))))
lola: processed formula: A (F (X (F (G ((p5 <= p11 + p12))))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 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: 709954 markings, 3558116 edges, 141991 markings/sec, 0 secs
lola: 1325677 markings, 7105034 edges, 123145 markings/sec, 5 secs
lola: 1887318 markings, 10768485 edges, 112328 markings/sec, 10 secs
lola: 2453614 markings, 14259543 edges, 113259 markings/sec, 15 secs
lola: 3003028 markings, 17882902 edges, 109883 markings/sec, 20 secs
lola: 3550197 markings, 21309958 edges, 109434 markings/sec, 25 secs
lola: 4082445 markings, 24761302 edges, 106450 markings/sec, 30 secs
lola: 4618065 markings, 28334853 edges, 107124 markings/sec, 35 secs
lola: 5145207 markings, 31598914 edges, 105428 markings/sec, 40 secs
lola: 5677458 markings, 35117579 edges, 106450 markings/sec, 45 secs
lola: 6213891 markings, 38704570 edges, 107287 markings/sec, 50 secs
lola: 6734085 markings, 41947965 edges, 104039 markings/sec, 55 secs
lola: 7225837 markings, 45162046 edges, 98350 markings/sec, 60 secs
lola: 7729738 markings, 48552382 edges, 100780 markings/sec, 65 secs
lola: 8220316 markings, 51754381 edges, 98116 markings/sec, 70 secs
lola: 8687123 markings, 54737391 edges, 93361 markings/sec, 75 secs
lola: 9167346 markings, 57920663 edges, 96045 markings/sec, 80 secs
lola: 9694074 markings, 61447257 edges, 105346 markings/sec, 85 secs
lola: 10229729 markings, 65031350 edges, 107131 markings/sec, 90 secs
lola: 10734786 markings, 68230634 edges, 101011 markings/sec, 95 secs
lola: 11210385 markings, 71363089 edges, 95120 markings/sec, 100 secs
lola: 11685326 markings, 74543734 edges, 94988 markings/sec, 105 secs
lola: 12160257 markings, 77743642 edges, 94986 markings/sec, 110 secs
lola: 12642927 markings, 80953738 edges, 96534 markings/sec, 115 secs
lola: 13095814 markings, 83857453 edges, 90577 markings/sec, 120 secs
lola: 13547886 markings, 86849477 edges, 90414 markings/sec, 125 secs
lola: 14045592 markings, 90197523 edges, 99541 markings/sec, 130 secs
lola: 14561898 markings, 93698511 edges, 103261 markings/sec, 135 secs
lola: 15086826 markings, 97236062 edges, 104986 markings/sec, 140 secs
lola: 15550460 markings, 100195667 edges, 92727 markings/sec, 145 secs
lola: 16011629 markings, 103197072 edges, 92234 markings/sec, 150 secs
lola: 16474245 markings, 106211529 edges, 92523 markings/sec, 155 secs
lola: 16945496 markings, 109358701 edges, 94250 markings/sec, 160 secs
lola: 17474550 markings, 112892134 edges, 105811 markings/sec, 165 secs
lola: 18002376 markings, 116394095 edges, 105565 markings/sec, 170 secs
lola: 18512786 markings, 119711190 edges, 102082 markings/sec, 175 secs
lola: 18987826 markings, 122905956 edges, 95008 markings/sec, 180 secs
lola: 19457709 markings, 125885809 edges, 93977 markings/sec, 185 secs
lola: 19942624 markings, 129085140 edges, 96983 markings/sec, 190 secs
lola: 20393855 markings, 132073548 edges, 90246 markings/sec, 195 secs
lola: 20840260 markings, 135060739 edges, 89281 markings/sec, 200 secs
lola: 21317759 markings, 138269874 edges, 95500 markings/sec, 205 secs
lola: 21803581 markings, 141545715 edges, 97164 markings/sec, 210 secs
lola: 22288292 markings, 144811585 edges, 96942 markings/sec, 215 secs
lola: 22770854 markings, 148079290 edges, 96512 markings/sec, 220 secs
lola: 23234393 markings, 151013334 edges, 92708 markings/sec, 225 secs
lola: 23703554 markings, 154121419 edges, 93832 markings/sec, 230 secs
lola: 24149912 markings, 157107796 edges, 89272 markings/sec, 235 secs
lola: 24590599 markings, 160094994 edges, 88137 markings/sec, 240 secs
lola: 25120217 markings, 163663507 edges, 105924 markings/sec, 245 secs
lola: 25641989 markings, 167213204 edges, 104354 markings/sec, 250 secs
lola: 26175039 markings, 170845641 edges, 106610 markings/sec, 255 secs
lola: 26710407 markings, 174458497 edges, 107074 markings/sec, 260 secs
lola: 27231114 markings, 177908812 edges, 104141 markings/sec, 265 secs
lola: 27735147 markings, 181231239 edges, 100807 markings/sec, 270 secs
lola: 28231748 markings, 184575771 edges, 99320 markings/sec, 275 secs
lola: 28714607 markings, 187868134 edges, 96572 markings/sec, 280 secs
lola: 29219211 markings, 191309741 edges, 100921 markings/sec, 285 secs
lola: 29730608 markings, 194794950 edges, 102279 markings/sec, 290 secs
lola: 30232004 markings, 198231515 edges, 100279 markings/sec, 295 secs
lola: 30741560 markings, 201704208 edges, 101911 markings/sec, 300 secs
lola: 31266372 markings, 205331085 edges, 104962 markings/sec, 305 secs
lola: 31748749 markings, 208526668 edges, 96475 markings/sec, 310 secs
lola: 32244809 markings, 211829714 edges, 99212 markings/sec, 315 secs
lola: 32730902 markings, 215141028 edges, 97219 markings/sec, 320 secs
lola: 33214022 markings, 218428581 edges, 96624 markings/sec, 325 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 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p8)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-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 8 will run for 373 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F ((3 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((3 <= p4)))
lola: processed formula: A (F ((3 <= p4)))
lola: processed formula length: 17
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 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 426 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p75 + p76)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((3 <= p75 + p76)))
lola: processed formula: A (X ((3 <= p75 + p76)))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 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 10 will run for 497 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p1 + p2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p1 + p2)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 597 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p7)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-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 746 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p7 <= p9) U ((p7 <= p1 + p2) U (2 <= p13 + p14 + p15 + 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 (((p7 <= p9) U ((p7 <= p1 + p2) U (2 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23))))
lola: processed formula: A (((p7 <= p9) U ((p7 <= p1 + p2) U (2 <= p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23))))
lola: processed formula length: 109
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 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 995 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (((p4 <= p75 + p76) U (p8 <= p11 + p12)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (((p4 <= p75 + p76) U (p8 <= p11 + p12)))))
lola: processed formula: A (G (X (((p4 <= p75 + p76) U (p8 <= p11 + p12)))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 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 14 will run for 1493 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F ((p8 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((p8 <= p4)))
lola: processed formula: A (F ((p8 <= p4)))
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 128 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V50P20N10-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 488 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 15 will run for 2987 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p1 + p2)))
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 484 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: RESULT
lola:
SUMMARY: no no no no yes yes unknown no yes no no yes no no yes no
lola: ========================================
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V50P20N10-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496341518320

--------------------
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_BridgeAndVehicles-COL-V50P20N10"
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_BridgeAndVehicles-COL-V50P20N10.tgz
mv S_BridgeAndVehicles-COL-V50P20N10 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_BridgeAndVehicles-COL-V50P20N10, 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 r088-csrt-149441074300329"
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 ;