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-V20P20N50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074300318
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496340454603


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_BridgeAndVehicles-COL-V20P20N50: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
S_BridgeAndVehicles-COL-V20P20N50: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
CTLCardinality @ S_BridgeAndVehicles-COL-V20P20N50 @ 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: 2336/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 108 places, 2228 transitions, 101 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2453 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V20P20N50-CTLCardinality.task
lola: NOT((((p6 <= p28) AND (p107 <= p101) AND ((3 <= p105) OR (p107 <= p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27)) AND (p0 <= p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)) AND A (((p1 + p2 <= p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27) U (2 <= p105))))) : A (G (E (F (((p3 + p4 <= p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) AND (1 <= p105)))))) : E (F (A (((3 <= p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) U (3 <= p3 + p4))))) : (((p106 <= 2) OR (p102 + p103 + 1 <= p105)) OR A (F (A (X ((p101 <= p0)))))) : E (F (A (G (((p3 + p4 <= p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27) AND (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 + p75 + p76 + p77 + p78 + p79 <= p3 + p4)))))) : E (F (((p1 + p2 <= p106) AND E (G (TRUE))))) : E (G ((((p28 + 1 <= p105) AND (p104 <= 0)) OR A (F ((p3 + p4 <= p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27)))))) : NOT((E (G (((3 <= p102 + p103) OR (1 <= p101)))) OR (p106 <= p1 + p2))) : ((A (G (TRUE)) OR A (((1 <= p0) U (1 <= p3 + p4)))) AND A (F ((p104 <= p1 + p2)))) : E (G ((p3 + p4 <= p101))) : NOT(E (G ((1 <= p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27)))) : E (F (A (((1 <= p1 + p2) U (p106 <= p6))))) : A ((((1 <= p105) AND (p105 <= p104) AND (p106 <= p102 + p103)) U A (F ((2 <= p5))))) : A (G (NOT(E (X ((2 <= p3 + p4)))))) : E (F (NOT(A (G ((2 <= p104)))))) : A ((A (G ((2 <= p101))) U ((2 <= p5) AND (p3 + p4 <= 2))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((p6 <= p28) AND (p107 <= p101) AND ((3 <= p105) OR (p107 <= p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27)) AND (p0 <= p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)) AND A (((p1 + p2 <= p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p28 + 1 <= p6) OR (p101 + 1 <= p107) OR ((p105 <= 2) AND (p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + 1 <= p107)) OR (p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 + 1 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p28 + 1 <= p6) OR (p101 + 1 <= p107) OR ((p105 <= 2) AND (p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + 1 <= p107)) OR (p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 + 1 <= p0))
lola: processed formula length: 338
lola: 6 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-CTLCardinality.task
lola: processed formula with 5 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: E (((p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + 1 <= p1 + p2) R (p105 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((p1 + p2 <= p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27) U (2 <= p105)))
lola: processed formula length: 155
lola: 9 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((p3 + p4 <= p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) AND (1 <= p105))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U ((p3 + p4 <= p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) AND (1 <= p105))))))
lola: processed formula length: 185
lola: 2 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 555348 markings, 2145388 edges, 2073457240953585664 markings/sec, 0 secs
lola: 1059358 markings, 4197516 edges, 100802 markings/sec, 5 secs
lola: 1570670 markings, 6536089 edges, 102262 markings/sec, 10 secs
lola: 2104022 markings, 8887931 edges, 106670 markings/sec, 15 secs
lola: 2617999 markings, 11019402 edges, 102795 markings/sec, 20 secs
lola: 3121992 markings, 13178163 edges, 100799 markings/sec, 25 secs
lola: 3606223 markings, 15271306 edges, 96846 markings/sec, 30 secs
lola: 4093883 markings, 17369952 edges, 97532 markings/sec, 35 secs
lola: 4566855 markings, 19479829 edges, 94594 markings/sec, 40 secs
lola: 5018484 markings, 21535848 edges, 90326 markings/sec, 45 secs
lola: 5507636 markings, 23624159 edges, 97830 markings/sec, 50 secs
lola: 6000314 markings, 25825490 edges, 98536 markings/sec, 55 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 248 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (((3 <= p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) U (3 <= p3 + p4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A((3 <= p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) U (3 <= p3 + p4)))
lola: processed formula length: 161
lola: 2 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 622446 markings, 2384334 edges, 2073447895104749568 markings/sec, 0 secs
lola: 1222804 markings, 4839426 edges, 120072 markings/sec, 5 secs
lola: 1879802 markings, 7722211 edges, 131400 markings/sec, 10 secs
lola: 2399944 markings, 9944982 edges, 104028 markings/sec, 15 secs
lola: 2935260 markings, 12130227 edges, 107063 markings/sec, 20 secs
lola: 3434025 markings, 14279526 edges, 99753 markings/sec, 25 secs
lola: 3936681 markings, 16437051 edges, 100531 markings/sec, 30 secs
lola: 4441381 markings, 18593508 edges, 100940 markings/sec, 35 secs
lola: 4939610 markings, 20839050 edges, 99646 markings/sec, 40 secs
lola: 5419821 markings, 22987235 edges, 96042 markings/sec, 45 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p106 <= 2) OR (p102 + p103 + 1 <= p105)) OR A (F (A (X ((p101 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p106 <= 2) OR (p102 + p103 + 1 <= p105))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p106 <= 2) OR (p102 + p103 + 1 <= p105))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-CTLCardinality.task
lola: processed formula with 2 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 285 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((p101 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((p101 <= p0)))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 294433 markings, 846900 edges, 3067840301390364672 markings/sec, 0 secs
lola: 598855 markings, 1759702 edges, 60884 markings/sec, 5 secs
lola: 914311 markings, 2732664 edges, 63091 markings/sec, 10 secs
lola: 1219098 markings, 3661519 edges, 60957 markings/sec, 15 secs
lola: 1546952 markings, 4692131 edges, 65571 markings/sec, 20 secs
lola: 1935089 markings, 5952882 edges, 77627 markings/sec, 25 secs
lola: 2240058 markings, 6909423 edges, 60994 markings/sec, 30 secs
lola: 2543890 markings, 7872873 edges, 60766 markings/sec, 35 secs
lola: 2847249 markings, 8848062 edges, 60672 markings/sec, 40 secs
lola: 3150229 markings, 9806595 edges, 60596 markings/sec, 45 secs
lola: 3447802 markings, 10732976 edges, 59515 markings/sec, 50 secs
lola: 3753322 markings, 11719156 edges, 61104 markings/sec, 55 secs
lola: 4061820 markings, 12740685 edges, 61700 markings/sec, 60 secs
lola: 4353944 markings, 13650979 edges, 58425 markings/sec, 65 secs
lola: 4671030 markings, 14709880 edges, 63417 markings/sec, 70 secs
lola: 4987993 markings, 15734967 edges, 63393 markings/sec, 75 secs
lola: 5288006 markings, 16690285 edges, 60003 markings/sec, 80 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p3 + p4 <= p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27) AND (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 + p7... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U ((p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + 1 <= p3 + p4) OR (p3 + p4 + 1 <= 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... (shortened)
lola: processed formula length: 489
lola: 3 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 573703 markings, 2267978 edges, 2864996623862202368 markings/sec, 0 secs
lola: 1124577 markings, 4490513 edges, 110175 markings/sec, 5 secs
lola: 1723408 markings, 7319787 edges, 119766 markings/sec, 10 secs
lola: 2240413 markings, 9498779 edges, 103401 markings/sec, 15 secs
lola: 2733201 markings, 11657227 edges, 98558 markings/sec, 20 secs
lola: 3234653 markings, 13805085 edges, 100290 markings/sec, 25 secs
lola: 3728576 markings, 15948497 edges, 98785 markings/sec, 30 secs
lola: 4209705 markings, 18082549 edges, 96226 markings/sec, 35 secs
lola: 4692376 markings, 20167183 edges, 96534 markings/sec, 40 secs
lola: 5183206 markings, 22268717 edges, 98166 markings/sec, 45 secs
lola: 5668691 markings, 24437120 edges, 97097 markings/sec, 50 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1 + p2 <= p106) AND E (G (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N50-CTLCardinality-5.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((p28 + 1 <= p105) AND (p104 <= 0)) OR A (F ((p3 + p4 <= p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
sara: try reading problem file BridgeAndVehicles-COL-V20P20N50-CTLCardinality-5.sara.
lola: processed formula: NOT(A(TRUE U (((p105 <= p28) OR (1 <= p104)) AND NOT(A(TRUE U (p3 + p4 <= p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27))))))
lola: processed formula length: 201
lola: 4 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 364 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G (((3 <= p102 + p103) OR (1 <= p101)))) OR (p106 <= p1 + p2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 364 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p102 + p103 <= 2) AND (p101 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((p102 + p103 <= 2) AND (p101 <= 0)))
lola: processed formula length: 46
lola: 6 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic

lola: 611477 markings, 1638283 edges, 122295 markings/sec, 0 secs
lola: 1232123 markings, 3450894 edges, 124129 markings/sec, 5 secs
lola: 1905704 markings, 5574010 edges, 134716 markings/sec, 10 secs
lola: 2469407 markings, 7234253 edges, 112741 markings/sec, 15 secs
lola: 3017535 markings, 8936100 edges, 109626 markings/sec, 20 secs
lola: 3569827 markings, 10663093 edges, 110458 markings/sec, 25 secs
lola: 4117399 markings, 12370765 edges, 109514 markings/sec, 30 secs
lola: 4659732 markings, 14058122 edges, 108467 markings/sec, 35 secs
lola: 5212305 markings, 15767775 edges, 110515 markings/sec, 40 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 404 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p1 + p2 + 1 <= p106)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1 + p2 + 1 <= p106)
lola: processed formula length: 21
lola: 5 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-CTLCardinality.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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 404 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (TRUE)) OR A (((1 <= p0) U (1 <= p3 + p4)))) AND A (F ((p104 <= p1 + p2))))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking CTL
lola: processed formula: A(TRUE U (p104 <= p1 + p2))
lola: processed formula length: 27
lola: 6 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 684278 markings, 1705646 edges, 3067840576268271616 markings/sec, 0 secs
lola: 1405616 markings, 3889167 edges, 144268 markings/sec, 5 secs
lola: 2038873 markings, 5740751 edges, 126651 markings/sec, 10 secs
lola: 2650847 markings, 7465889 edges, 122395 markings/sec, 15 secs
lola: 3246983 markings, 9306827 edges, 119227 markings/sec, 20 secs
lola: 3812384 markings, 10980369 edges, 113080 markings/sec, 25 secs
lola: 4380299 markings, 12728715 edges, 113583 markings/sec, 30 secs
lola: 4968436 markings, 14608681 edges, 117627 markings/sec, 35 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 456 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p3 + p4 <= p101)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p101 + 1 <= p3 + p4)))
lola: processed formula length: 36
lola: 2 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 532 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G ((1 <= p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 <= 0))
lola: processed formula length: 137
lola: 4 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 638 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (((1 <= p1 + p2) U (p106 <= p6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A((1 <= p1 + p2) U (p106 <= p6)))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 798 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p105) AND (p105 <= p104) AND (p106 <= p102 + p103)) U A (F ((2 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((1 <= p105) AND (p105 <= p104) AND (p106 <= p102 + p103)) U A(TRUE U (2 <= p5)))
lola: processed formula length: 83
lola: 2 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 661587 markings, 1875463 edges, 3067840576268271616 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 1061 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (X ((2 <= p3 + p4))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX((p3 + p4 <= 1)))))
lola: processed formula length: 38
lola: 5 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 206028 markings, 645528 edges, 41206 markings/sec, 0 secs
lola: 408651 markings, 1310214 edges, 40525 markings/sec, 5 secs
lola: 606238 markings, 1977289 edges, 39517 markings/sec, 10 secs
lola: 817090 markings, 2689923 edges, 42170 markings/sec, 15 secs
lola: 1030816 markings, 3416516 edges, 42745 markings/sec, 20 secs
lola: 1238158 markings, 4127414 edges, 41468 markings/sec, 25 secs
lola: 1442716 markings, 4839671 edges, 40912 markings/sec, 30 secs
lola: 1665031 markings, 5596951 edges, 44463 markings/sec, 35 secs
lola: 1853393 markings, 6262814 edges, 37672 markings/sec, 40 secs
lola: 2088427 markings, 7060666 edges, 47007 markings/sec, 45 secs
lola: 2278920 markings, 7738607 edges, 38099 markings/sec, 50 secs
lola: 2537447 markings, 8600355 edges, 51705 markings/sec, 55 secs
lola: 2790462 markings, 9526951 edges, 50603 markings/sec, 60 secs
lola: 3069490 markings, 10504013 edges, 55806 markings/sec, 65 secs
lola: 3292715 markings, 11274074 edges, 44645 markings/sec, 70 secs
lola: 3509526 markings, 12026633 edges, 43362 markings/sec, 75 secs
lola: 3733265 markings, 12807493 edges, 44748 markings/sec, 80 secs
lola: 3931343 markings, 13492915 edges, 39616 markings/sec, 85 secs
lola: 4145819 markings, 14260188 edges, 42895 markings/sec, 90 secs
lola: 4359510 markings, 14999889 edges, 42738 markings/sec, 95 secs
lola: 4568050 markings, 15703454 edges, 41708 markings/sec, 100 secs
lola: 4780334 markings, 16488730 edges, 42457 markings/sec, 105 secs
lola: 4998395 markings, 17246704 edges, 43612 markings/sec, 110 secs
lola: 5202137 markings, 17954893 edges, 40748 markings/sec, 115 secs
lola: 5417997 markings, 18727416 edges, 43172 markings/sec, 120 secs
lola: 5643267 markings, 19526405 edges, 45054 markings/sec, 125 secs
lola: 5840506 markings, 20226615 edges, 39448 markings/sec, 130 secs
lola: 6060080 markings, 20971478 edges, 43915 markings/sec, 135 secs
lola: 6280262 markings, 21790469 edges, 44036 markings/sec, 140 secs
lola: 6490347 markings, 22525990 edges, 42017 markings/sec, 145 secs
lola: 6673047 markings, 23181593 edges, 36540 markings/sec, 150 secs
lola: 6879727 markings, 23873651 edges, 41336 markings/sec, 155 secs
lola: 7083311 markings, 24634897 edges, 40717 markings/sec, 160 secs
lola: 7294433 markings, 25404646 edges, 42224 markings/sec, 165 secs
lola: 7486850 markings, 26074251 edges, 38483 markings/sec, 170 secs
lola: 7686319 markings, 26771855 edges, 39894 markings/sec, 175 secs
lola: 7907203 markings, 27549027 edges, 44177 markings/sec, 180 secs
lola: 8124040 markings, 28359389 edges, 43367 markings/sec, 185 secs
lola: 8342638 markings, 29139249 edges, 43720 markings/sec, 190 secs
lola: 8530704 markings, 29807204 edges, 37613 markings/sec, 195 secs
lola: 8721857 markings, 30458019 edges, 38231 markings/sec, 200 secs
lola: 8938460 markings, 31234747 edges, 43321 markings/sec, 205 secs
lola: 9151354 markings, 32034090 edges, 42579 markings/sec, 210 secs
lola: 9361064 markings, 32805635 edges, 41942 markings/sec, 215 secs
lola: 9554735 markings, 33479565 edges, 38734 markings/sec, 220 secs
lola: 9740575 markings, 34153798 edges, 37168 markings/sec, 225 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 14 will run for 1476 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(A (G ((2 <= p104))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V20P20N50-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N50-CTLCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2952 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (G ((2 <= p101))) U ((2 <= p5) AND (p3 + p4 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(E(TRUE U (p101 <= 1))) U ((2 <= p5) AND (p3 + p4 <= 2)))
lola: processed formula length: 62
lola: 3 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 404 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: RESULT
lola:
SUMMARY: no yes no yes no yes yes yes yes yes no yes yes yes yes no
lola: ========================================
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N50-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496341043036

--------------------
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-V20P20N50"
export BK_EXAMINATION="CTLCardinality"
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-V20P20N50.tgz
mv S_BridgeAndVehicles-COL-V20P20N50 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-V20P20N50, examination is CTLCardinality"
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-149441074300318"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;