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

--------------------
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 1494605712713


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ 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((((p102 <= p103) AND (p27 <= p101) AND ((3 <= p104) OR (p27 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)) AND (p28 <= p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)) AND A (((p22 + p23 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) U (2 <= p104))))) : A (G (E (F (((p24 + p25 <= p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) AND (1 <= p104)))))) : 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 <= p24 + p25))))) : (((p26 <= 2) OR (p105 + p106 + 1 <= p104)) OR A (F (A (X ((p101 <= p28)))))) : E (F (A (G (((p24 + p25 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) 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 <= p24 + p25)))))) : E (F (((p22 + p23 <= p26) AND E (G (TRUE))))) : E (G ((((p103 + 1 <= p104) AND (p107 <= 0)) OR A (F ((p24 + p25 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)))))) : NOT((E (G (((3 <= p105 + p106) OR (1 <= p101)))) OR (p26 <= p22 + p23))) : ((A (G (TRUE)) OR A (((1 <= p28) U (1 <= p24 + p25)))) AND A (F ((p107 <= p22 + p23)))) : E (G ((p24 + p25 <= p101))) : NOT(E (G ((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)))) : E (F (A (((1 <= p22 + p23) U (p26 <= p102))))) : A ((((1 <= p104) AND (p104 <= p107) AND (p26 <= p105 + p106)) U A (F ((2 <= p0))))) : A (G (NOT(E (X ((2 <= p24 + p25)))))) : E (F (NOT(A (G ((2 <= p107)))))) : A ((A (G ((2 <= p101))) U ((2 <= p0) AND (p24 + p25 <= 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((((p102 <= p103) AND (p27 <= p101) AND ((3 <= p104) OR (p27 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21)) AND (p28 <= p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99)) AND A (((p22 + p23 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11... (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: ((p103 + 1 <= p102) OR (p101 + 1 <= p27) OR ((p104 <= 2) AND (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + 1 <= p27)) OR (p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 + 1 <= p28))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p103 + 1 <= p102) OR (p101 + 1 <= p27) OR ((p104 <= 2) AND (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + 1 <= p27)) OR (p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99 + 1 <= p28))
lola: processed formula length: 334
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 (((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + 1 <= p22 + p23) R (p104 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((p22 + p23 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) U (2 <= p104)))
lola: processed formula length: 151
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: 693618 markings, 1835032 edges, 3225752436249460736 markings/sec, 0 secs
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: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((p24 + p25 <= p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) AND (1 <= p104))))))
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 ((p24 + p25 <= p100 + p98 + p97 + p96 + p95 + p94 + p93 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p99) AND (1 <= p104))))))
lola: processed formula length: 187
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: 443359 markings, 1913912 edges, 3687537974066544640 markings/sec, 0 secs
lola: 878477 markings, 3810133 edges, 87024 markings/sec, 5 secs
lola: 1313097 markings, 5731143 edges, 86924 markings/sec, 10 secs
lola: 1742034 markings, 7603021 edges, 85787 markings/sec, 15 secs
lola: 2171361 markings, 9495926 edges, 85865 markings/sec, 20 secs
lola: 2606951 markings, 11413915 edges, 87118 markings/sec, 25 secs
lola: 3015752 markings, 13210650 edges, 81760 markings/sec, 30 secs
lola: 3437134 markings, 15065526 edges, 84276 markings/sec, 35 secs
lola: 3848974 markings, 16912783 edges, 82368 markings/sec, 40 secs
lola: 4273511 markings, 18761537 edges, 84907 markings/sec, 45 secs
lola: 4696300 markings, 20616770 edges, 84558 markings/sec, 50 secs
lola: 5121094 markings, 22521394 edges, 84959 markings/sec, 55 secs
lola: 5539592 markings, 24345824 edges, 83700 markings/sec, 60 secs
lola: 5982065 markings, 26295553 edges, 88495 markings/sec, 65 secs
lola: 6444502 markings, 28362530 edges, 92487 markings/sec, 70 secs
lola: 6900054 markings, 30347930 edges, 91110 markings/sec, 75 secs
lola: 7350350 markings, 32379189 edges, 90059 markings/sec, 80 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 246 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 <= p24 + p25)))))
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 <= p24 + p25)))
lola: processed formula length: 163
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: 579624 markings, 2206480 edges, 3067840576268271616 markings/sec, 0 secs
lola: 1162363 markings, 4484549 edges, 116548 markings/sec, 5 secs
lola: 1728841 markings, 6724000 edges, 113296 markings/sec, 10 secs
lola: 2287499 markings, 8945619 edges, 111732 markings/sec, 15 secs
lola: 2822650 markings, 11088525 edges, 107030 markings/sec, 20 secs
lola: 3341776 markings, 13176197 edges, 103825 markings/sec, 25 secs
lola: 3847064 markings, 15218599 edges, 101058 markings/sec, 30 secs
lola: 4353945 markings, 17276441 edges, 101376 markings/sec, 35 secs
lola: 4856197 markings, 19323720 edges, 100450 markings/sec, 40 secs
lola: 5345437 markings, 21296762 edges, 97848 markings/sec, 45 secs
lola: 5822602 markings, 23258927 edges, 95433 markings/sec, 50 secs
lola: 6306905 markings, 25277089 edges, 96861 markings/sec, 55 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 260 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p26 <= 2) OR (p105 + p106 + 1 <= p104)) OR A (F (A (X ((p101 <= p28))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 260 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p26 <= 2) OR (p105 + p106 + 1 <= p104))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p26 <= 2) OR (p105 + p106 + 1 <= p104))
lola: processed formula length: 42
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 282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((p101 <= p28)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((p101 <= p28)))
lola: processed formula length: 27
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: 256903 markings, 647767 edges, 3689348319961677824 markings/sec, 0 secs
lola: 533185 markings, 1451440 edges, 55256 markings/sec, 5 secs
lola: 809226 markings, 2290449 edges, 55208 markings/sec, 10 secs
lola: 1085280 markings, 3123179 edges, 55211 markings/sec, 15 secs
lola: 1366945 markings, 3997890 edges, 56333 markings/sec, 20 secs
lola: 1639362 markings, 4853283 edges, 54483 markings/sec, 25 secs
lola: 1915238 markings, 5738726 edges, 55175 markings/sec, 30 secs
lola: 2191555 markings, 6610749 edges, 55263 markings/sec, 35 secs
lola: 2457306 markings, 7443483 edges, 53150 markings/sec, 40 secs
lola: 2748379 markings, 8403102 edges, 58215 markings/sec, 45 secs
lola: 3045999 markings, 9344742 edges, 59524 markings/sec, 50 secs
lola: 3338105 markings, 10306242 edges, 58421 markings/sec, 55 secs
lola: 3632958 markings, 11245046 edges, 58971 markings/sec, 60 secs
lola: 3918656 markings, 12188792 edges, 57140 markings/sec, 65 secs
lola: 4213195 markings, 13129512 edges, 58908 markings/sec, 70 secs
lola: 4509743 markings, 14110828 edges, 59310 markings/sec, 75 secs
lola: 4791828 markings, 15003950 edges, 56417 markings/sec, 80 secs
lola: 5096007 markings, 16028036 edges, 60836 markings/sec, 85 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: subprocess 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((p24 + p25 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21) 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 + ... (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 ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + 1 <= p24 + p25) OR (p24 + p25 + 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: 487
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: 591235 markings, 2290258 edges, 2864996623862202368 markings/sec, 0 secs
lola: 1160441 markings, 4553047 edges, 113841 markings/sec, 5 secs
lola: 1720043 markings, 6796385 edges, 111920 markings/sec, 10 secs
lola: 2269027 markings, 9009853 edges, 109797 markings/sec, 15 secs
lola: 2809507 markings, 11202834 edges, 108096 markings/sec, 20 secs
lola: 3340431 markings, 13368888 edges, 106185 markings/sec, 25 secs
lola: 3864756 markings, 15514375 edges, 104865 markings/sec, 30 secs
lola: 4395541 markings, 17696394 edges, 106157 markings/sec, 35 secs
lola: 4932184 markings, 19921986 edges, 107329 markings/sec, 40 secs
lola: 5449313 markings, 22042934 edges, 103426 markings/sec, 45 secs
lola: 5953269 markings, 24107887 edges, 100791 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 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p22 + p23 <= p26) 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: subprocess 6 will run for 323 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: ========================================
...considering subproblem: E (G ((((p103 + 1 <= p104) AND (p107 <= 0)) OR A (F ((p24 + p25 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V20P20N50-CTLCardinality-5.sara.
lola: processed formula: NOT(A(TRUE U (((p104 <= p103) OR (1 <= p107)) AND NOT(A(TRUE U (p24 + p25 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21))))))
lola: processed formula length: 198
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 359 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G (((3 <= p105 + p106) OR (1 <= p101)))) OR (p26 <= p22 + p23)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 359 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p105 + p106 <= 2) AND (p101 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((p105 + p106 <= 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: 682291 markings, 1680044 edges, 136458 markings/sec, 0 secs
lola: 1315901 markings, 3385308 edges, 126722 markings/sec, 5 secs
lola: 1936760 markings, 5096284 edges, 124172 markings/sec, 10 secs
lola: 2547671 markings, 6810618 edges, 122182 markings/sec, 15 secs
lola: 3152617 markings, 8512032 edges, 120989 markings/sec, 20 secs
lola: 3751907 markings, 10238248 edges, 119858 markings/sec, 25 secs
lola: 4350026 markings, 11960226 edges, 119624 markings/sec, 30 secs
lola: 4941059 markings, 13673513 edges, 118207 markings/sec, 35 secs
lola: 5534655 markings, 15394731 edges, 118719 markings/sec, 40 secs
lola: 6118491 markings, 17129142 edges, 116767 markings/sec, 45 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 397 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p22 + p23 + 1 <= p26)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p22 + p23 + 1 <= p26)
lola: processed formula length: 22
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: ========================================
lola: subprocess 8 will run for 397 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (TRUE)) OR A (((1 <= p28) U (1 <= p24 + p25)))) AND A (F ((p107 <= p22 + p23))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p107 <= p22 + p23))
lola: processed formula length: 29
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: 682741 markings, 1753816 edges, 2073447895104749568 markings/sec, 0 secs
lola: 1325386 markings, 3454387 edges, 128529 markings/sec, 5 secs
lola: 1932429 markings, 5083856 edges, 121409 markings/sec, 10 secs
lola: 2570003 markings, 6806263 edges, 127515 markings/sec, 15 secs
lola: 3183400 markings, 8511983 edges, 122679 markings/sec, 20 secs
lola: 3760261 markings, 10096543 edges, 115372 markings/sec, 25 secs
lola: 4330948 markings, 11677237 edges, 114137 markings/sec, 30 secs
lola: 4910308 markings, 13298091 edges, 115872 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 448 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p24 + p25 <= p101)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p101 + 1 <= p24 + p25)))
lola: processed formula length: 38
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 522 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G ((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 <= 0))
lola: processed formula length: 131
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 627 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (((1 <= p22 + p23) U (p26 <= p102)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A((1 <= p22 + p23) U (p26 <= p102)))
lola: processed formula length: 45
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 784 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p104) AND (p104 <= p107) AND (p26 <= p105 + p106)) U A (F ((2 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((1 <= p104) AND (p104 <= p107) AND (p26 <= p105 + p106)) U A(TRUE U (2 <= p0)))
lola: processed formula length: 82
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: 631174 markings, 1600256 edges, 2073447895104749568 markings/sec, 0 secs
lola: 1101727 markings, 3137095 edges, 94111 markings/sec, 5 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 1042 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (X ((2 <= p24 + p25))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX((p24 + p25 <= 1)))))
lola: processed formula length: 40
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: 248442 markings, 780412 edges, 2864996623862202368 markings/sec, 0 secs
lola: 489992 markings, 1584756 edges, 48310 markings/sec, 5 secs
lola: 733936 markings, 2410014 edges, 48789 markings/sec, 10 secs
lola: 975108 markings, 3230634 edges, 48234 markings/sec, 15 secs
lola: 1205027 markings, 4017836 edges, 45984 markings/sec, 20 secs
lola: 1433092 markings, 4805502 edges, 45613 markings/sec, 25 secs
lola: 1661456 markings, 5586295 edges, 45673 markings/sec, 30 secs
lola: 1884652 markings, 6354900 edges, 44639 markings/sec, 35 secs
lola: 2116779 markings, 7162581 edges, 46425 markings/sec, 40 secs
lola: 2350373 markings, 7973831 edges, 46719 markings/sec, 45 secs
lola: 2590071 markings, 8807612 edges, 47940 markings/sec, 50 secs
lola: 2811853 markings, 9574246 edges, 44356 markings/sec, 55 secs
lola: 3023936 markings, 10319227 edges, 42417 markings/sec, 60 secs
lola: 3240332 markings, 11081390 edges, 43279 markings/sec, 65 secs
lola: 3464246 markings, 11865864 edges, 44783 markings/sec, 70 secs
lola: 3702419 markings, 12694416 edges, 47635 markings/sec, 75 secs
lola: 3938068 markings, 13533886 edges, 47130 markings/sec, 80 secs
lola: 4164731 markings, 14328217 edges, 45333 markings/sec, 85 secs
lola: 4402065 markings, 15155049 edges, 47467 markings/sec, 90 secs
lola: 4639863 markings, 16005539 edges, 47560 markings/sec, 95 secs
lola: 4863085 markings, 16787193 edges, 44644 markings/sec, 100 secs
lola: 5080601 markings, 17545030 edges, 43503 markings/sec, 105 secs
lola: 5287274 markings, 18280109 edges, 41335 markings/sec, 110 secs
lola: 5505371 markings, 19060204 edges, 43619 markings/sec, 115 secs
lola: 5707067 markings, 19772869 edges, 40339 markings/sec, 120 secs
lola: 5920380 markings, 20512282 edges, 42663 markings/sec, 125 secs
lola: 6145773 markings, 21320184 edges, 45079 markings/sec, 130 secs
lola: 6378949 markings, 22163145 edges, 46635 markings/sec, 135 secs
lola: 6595578 markings, 22919798 edges, 43326 markings/sec, 140 secs
lola: 6828734 markings, 23739946 edges, 46631 markings/sec, 145 secs
lola: 7037695 markings, 24483398 edges, 41792 markings/sec, 150 secs
lola: 7249596 markings, 25250966 edges, 42380 markings/sec, 155 secs
lola: 7468066 markings, 25999265 edges, 43694 markings/sec, 160 secs
lola: 7669245 markings, 26744589 edges, 40236 markings/sec, 165 secs
lola: 7898756 markings, 27548053 edges, 45902 markings/sec, 170 secs
lola: 8122881 markings, 28348539 edges, 44825 markings/sec, 175 secs
lola: 8354657 markings, 29191013 edges, 46355 markings/sec, 180 secs
lola: 8580419 markings, 29976519 edges, 45152 markings/sec, 185 secs
lola: 8780179 markings, 30704348 edges, 39952 markings/sec, 190 secs
lola: 9000760 markings, 31498809 edges, 44116 markings/sec, 195 secs
lola: 9225360 markings, 32282177 edges, 44920 markings/sec, 200 secs
lola: 9448216 markings, 33091156 edges, 44571 markings/sec, 205 secs
lola: 9673740 markings, 33907083 edges, 45105 markings/sec, 210 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 1454 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(A (G ((2 <= p107))))))
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 2908 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (G ((2 <= p101))) U ((2 <= p0) AND (p24 + p25 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(E(TRUE U (p101 <= 1))) U ((2 <= p0) AND (p24 + p25 <= 2)))
lola: processed formula length: 64
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 1494606344237

--------------------
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="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/BridgeAndVehicles-COL-V20P20N50.tgz
mv 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 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 r008-csrt-149436126100318"
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 ;