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)
.....................
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 42K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SafeBus-COL-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685547100185
=====================================================================

--------------------
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 SafeBus-COL-06-CTLCardinality-00
FORMULA_NAME SafeBus-COL-06-CTLCardinality-01
FORMULA_NAME SafeBus-COL-06-CTLCardinality-02
FORMULA_NAME SafeBus-COL-06-CTLCardinality-03
FORMULA_NAME SafeBus-COL-06-CTLCardinality-04
FORMULA_NAME SafeBus-COL-06-CTLCardinality-05
FORMULA_NAME SafeBus-COL-06-CTLCardinality-06
FORMULA_NAME SafeBus-COL-06-CTLCardinality-07
FORMULA_NAME SafeBus-COL-06-CTLCardinality-08
FORMULA_NAME SafeBus-COL-06-CTLCardinality-09
FORMULA_NAME SafeBus-COL-06-CTLCardinality-10
FORMULA_NAME SafeBus-COL-06-CTLCardinality-11
FORMULA_NAME SafeBus-COL-06-CTLCardinality-12
FORMULA_NAME SafeBus-COL-06-CTLCardinality-13
FORMULA_NAME SafeBus-COL-06-CTLCardinality-14
FORMULA_NAME SafeBus-COL-06-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526974450484

info: Time: 3600 - MCC
===========================================================================================
prep: translating SafeBus-COL-06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SafeBus-COL-06 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ SafeBus-COL-06 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 613/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4800
lola: finding significant places
lola: 150 places, 463 transitions, 115 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 393 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-COL-06-CTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p22 + p23 + p24 + p25 + p26 + p27)
lola: after: (1 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (3 <= p0)
lola: place invariant simplifies atomic proposition
lola: before: (p138 + p139 + p140 + p141 + p142 + p143 <= p149 + p148 + p147 + p146 + p145 + p144)
lola: after: (p138 + p139 + p140 + p141 + p142 + p143 <= 6)
lola: LP says that atomic proposition is always true: (p138 + p139 + p140 + p141 + p142 + p143 <= 6)
lola: LP says that atomic proposition is always false: (3 <= p28 + p29 + p30 + p31 + p32 + p33)
lola: place invariant simplifies atomic proposition
lola: before: (p52 + p53 + p54 + p55 + p56 + p57 <= p100 + p101 + p92 + p91 + p90 + p88 + p87 + p86 + p85 + p84 + p82 + p81 + p80 + p79 + p78 + p76 + p75 + p74 + p73 + p72 + p70 + p69 + p68 + p67 + p66 + p71 + p77 + p83 + p89 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: after: (1 <= p100 + p101 + p92 + p91 + p90 + p88 + p87 + p86 + p85 + p84 + p82 + p81 + p80 + p79 + p78 + p76 + p75 + p74 + p73 + p72 + p70 + p69 + p68 + p67 + p66 + p71 + p77 + p83 + p89 + p93 + p94 + p95 + p96 + p97 + p98 + p99)
lola: place invariant simplifies atomic proposition
lola: before: (p149 + p148 + p147 + p146 + p145 + p144 <= p22 + p23 + p24 + p25 + p26 + p27)
lola: after: (5 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p52 + p53 + p54 + p55 + p56 + p57 <= p20)
lola: after: (1 <= p20)
lola: LP says that atomic proposition is always false: (3 <= p14 + p15 + p16 + p17 + p18 + p19)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p52 + p53 + p54 + p55 + p56 + p57)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p22 + p23 + p24 + p25 + p26 + p27)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p22 + p23 + p24 + p25 + p26 + p27)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p52 + p53 + p54 + p55 + p56 + p57)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p52 + p53 + p54 + p55 + p56 + p57)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p59 <= p22 + p23 + p24 + p25 + p26 + p27)
lola: after: (p59 <= 1)
lola: LP says that atomic proposition is always true: (p59 <= 1)
lola: LP says that atomic proposition is always false: (3 <= p58)
lola: LP says that atomic proposition is always false: (3 <= p28 + p29 + p30 + p31 + p32 + p33)
lola: LP says that atomic proposition is always false: (3 <= p13)
lola: LP says that atomic proposition is always false: (3 <= p28 + p29 + p30 + p31 + p32 + p33)
lola: LP says that atomic proposition is always true: (p40 + p41 + p42 + p43 + p44 + p45 <= p28 + p29 + p30 + p31 + p32 + p33)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p52 + p53 + p54 + p55 + p56 + p57 <= p138 + p139 + p140 + p141 + p142 + p143)
lola: after: (1 <= p138 + p139 + p140 + p141 + p142 + p143)
lola: place invariant simplifies atomic proposition
lola: before: (p149 + p148 + p147 + p146 + p145 + p144 <= p1 + p2 + p3 + p4 + p5 + p6)
lola: after: (6 <= p1 + p2 + p3 + p4 + p5 + p6)
lola: place invariant simplifies atomic proposition
lola: before: (p52 + p53 + p54 + p55 + p56 + p57 <= p0)
lola: after: (1 <= p0)
lola: place invariant simplifies atomic proposition
lola: before: (p52 + p53 + p54 + p55 + p56 + p57 <= p7 + p8 + p9 + p10 + p11 + p12)
lola: after: (1 <= p7 + p8 + p9 + p10 + p11 + p12)
lola: LP says that atomic proposition is always false: (2 <= 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 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137)
lola: place invariant simplifies atomic proposition
lola: before: (p34 + p35 + p36 + p37 + p38 + p39 <= p52 + p53 + p54 + p55 + p56 + p57)
lola: after: (p34 + p35 + p36 + p37 + p38 + p39 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (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 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 <= p149 + p148 + p147 + p146 + p145 + p144)
lola: after: (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 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 <= 6)
lola: LP says that atomic proposition is always true: (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 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 <= 6)
lola: LP says that atomic proposition is always false: (2 <= p58)
lola: LP says that atomic proposition is always false: (3 <= p65 + p64 + p63 + p62 + p61 + p60)
lola: place invariant simplifies atomic proposition
lola: before: (p149 + p148 + p147 + p146 + p145 + p144 <= p58)
lola: after: (6 <= p58)
lola: LP says that atomic proposition is always false: (6 <= p58)
lola: place invariant simplifies atomic proposition
lola: before: (p65 + p64 + p63 + p62 + p61 + p60 <= p52 + p53 + p54 + p55 + p56 + p57)
lola: after: (p65 + p64 + p63 + p62 + p61 + p60 <= 1)
lola: LP says that atomic proposition is always true: (p65 + p64 + p63 + p62 + p61 + p60 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p52 + p53 + p54 + p55 + p56 + p57 <= p138 + p139 + p140 + p141 + p142 + p143)
lola: after: (1 <= p138 + p139 + p140 + p141 + p142 + p143)
lola: E (G (())) : E (G (A (X (((p34 + p35 + p36 + p37 + p38 + p39 <= p58) OR (p28 + p29 + p30 + p31 + p32 + p33 <= p59)))))) : E ((A (G (TRUE)) U ((1 <= p20)))) : E (G (A (F (((p1 + p2 + p3 + p4 + p5 + p6 <= p58)))))) : E (F ((E (G ((p59 <= p7 + p8 + p9 + p10 + p11 + p12))) AND ()))) : E (G (A (F ((p51 + p50 + p49 + p48 + p47 + p46 <= 0))))) : (TRUE AND E (F (E (G (FALSE))))) : (() AND E (F (()))) : NOT(E ((TRUE U FALSE))) : E (G (E (F (())))) : (NOT(E (F ((p138 + p139 + p140 + p141 + p142 + p143 <= 1)))) OR A (G (A (F ((1 <= p138 + p139 + p140 + p141 + p142 + p143)))))) : A (G ((p58 <= p28 + p29 + p30 + p31 + p32 + p33))) : (E (G (E (F ((6 <= p1 + p2 + p3 + p4 + p5 + p6))))) AND A ((((1 <= p1 + p2 + p3 + p4 + p5 + p6) AND (p20 <= p0)) U (p138 + p139 + p140 + p141 + p142 + p143 <= p34 + p35 + p36 + p37 + p38 + p39)))) : ((E (X ((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 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 <= p100 + p101 + p92 + p91 + p90 + p88 + p87 + p86 + p85 + p84 + p82 + p81 + p80 + p79 + p78 + p76 + p75 + p74 + p73 + p72 + p70 + p69 + p68 + p67 + p66 + p71 + p77 + p83 + p89 + p93 + p94 + p95 + p96 + p97 + p98 + p99))) AND (((p0 <= 0) OR (p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p21)) AND A (F ((p0 <= p28 + p29 + p30 + p31 + p32 + p33))))) OR (((p7 + p8 + p9 + p10 + p11 + p12 + 1 <= p59) OR (p7 + p8 + p9 + p10 + p11 + p12 <= 0)))) : A (X (A (F (FALSE)))) : A (F (A (X (((1 <= p138 + p139 + p140 + p141 + p142 + p143))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 41 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola:
FORMULA SafeBus-COL-06-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 41 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA SafeBus-COL-06-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 41 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA SafeBus-COL-06-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 41 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola:
FORMULA SafeBus-COL-06-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 41 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA SafeBus-COL-06-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 41 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges

FORMULA SafeBus-COL-06-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 41 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola:
FORMULA SafeBus-COL-06-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (X ((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 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 <= p100 + p101 + p92 + p91 + p90 + p88 + p87 + p86 + p85 + p84 + p82 + p81 + p80 + p79 + p78 + p76 + p75 + p74 + p73 + p72 + p70 + p69 + p68 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p7 + p8 + p9 + p10 + p11 + p12 + 1 <= p59) OR (p7 + p8 + p9 + p10 + p11 + p12 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p7 + p8 + p9 + p10 + p11 + p12 + 1 <= p59) OR (p7 + p8 + p9 + p10 + p11 + p12 <= 0)))
lola: processed formula length: 89
lola: 41 rewrites
lola: closed formula file SafeBus-COL-06-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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p0 <= 0) OR (p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p21))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p0 <= 0) OR (p34 + p35 + p36 + p37 + p38 + p39 + 1 <= p21))
lola: processed formula length: 62
lola: 41 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: processed formula with 2 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p0 <= p28 + p29 + p30 + p31 + p32 + p33)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p28 + p29 + p30 + p31 + p32 + p33 + 1 <= p0)
lola: processed formula length: 45
lola: 43 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1957 markings, 1956 edges
lola: ========================================
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((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 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 <= p100 + p101 + p92 + p91 + p90 + p88 + p87 + p86 + p85 + p84 + p82 + p81 + p80 + p79 + p78 + p76 + p75 + p74 + p73 + p72 + p70 + p69 + p68 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((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 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 <= p100 + p101 + p92 + p91 + p90 + p88 + p87 + p86 + p85 + p84 + p82 + p81 + p80 + p79 + p78 + p76 + p75 + p74 + p73 + p72 + p70 + p69 + p68 + p67... (shortened)
lola: processed formula length: 474
lola: 42 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
========================================
lola: ========================================

FORMULA SafeBus-COL-06-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (((p34 + p35 + p36 + p37 + p38 + p39 <= p58) OR (p28 + p29 + p30 + p31 + p32 + p33 <= p59))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(AX(((p34 + p35 + p36 + p37 + p38 + p39 <= p58) OR (p28 + p29 + p30 + p31 + p32 + p33 <= p59))))))
lola: processed formula length: 115
lola: 43 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 36 markings, 36 edges
lola:
FORMULA SafeBus-COL-06-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((1 <= p138 + p139 + p140 + p141 + p142 + p143))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U AX(((1 <= p138 + p139 + p140 + p141 + p142 + p143))))
lola: processed formula length: 62
lola: 43 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 36 markings, 36 edges
lola: ========================================

FORMULA SafeBus-COL-06-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((1 <= p20))))
lola: processed formula length: 20
lola: 42 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((1 <= p20))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-06-CTLCardinality-10-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA SafeBus-COL-06-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p58 <= p28 + p29 + p30 + p31 + p32 + p33)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p58 <= p28 + p29 + p30 + p31 + p32 + p33)))
lola: processed formula length: 50
lola: 43 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p28 + p29 + p30 + p31 + p32 + p33 + 1 <= p58)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA SafeBus-COL-06-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((p51 + p50 + p49 + p48 + p47 + p46 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (p51 + p50 + p49 + p48 + p47 + p46 <= 0)))))
lola: processed formula length: 70
lola: 43 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 36 markings, 72 edges
lola: ========================================

FORMULA SafeBus-COL-06-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((p1 + p2 + p3 + p4 + p5 + p6 <= p58))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U ((p1 + p2 + p3 + p4 + p5 + p6 <= p58))))))
lola: processed formula length: 68
lola: 43 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 158 markings, 170 edges
lola: ========================================

FORMULA SafeBus-COL-06-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((2 <= p138 + p139 + p140 + p141 + p142 + p143))) OR A (G (A (F ((1 <= p138 + p139 + p140 + p141 + p142 + p143))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p138 + p139 + p140 + p141 + p142 + p143)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G ((2 <= p138 + p139 + p140 + p141 + p142 + p143)))
lola: processed formula length: 54
lola: 43 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: (p138 + p139 + p140 + p141 + p142 + p143 <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((1 <= p138 + p139 + p140 + p141 + p142 + p143)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence in all states
lola: rewrite Frontend/Parser/formula_rewrite.k:644
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p138 + p139 + p140 + p141 + p142 + p143 <= 0)
lola: processed formula length: 46
lola: 43 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
sara: try reading problem file SafeBus-COL-06-CTLCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic

lola: 53243 markings, 90604 edges, 10649 markings/sec, 0 secs
lola: 108134 markings, 199359 edges, 10978 markings/sec, 5 secs
lola: 162561 markings, 313002 edges, 10885 markings/sec, 10 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EFEG
lola: The predicate does not eventually occur from all states.
lola: 193949 markings, 380228 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SafeBus-COL-06-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((6 <= p1 + p2 + p3 + p4 + p5 + p6))))) AND A ((((1 <= p1 + p2 + p3 + p4 + p5 + p6) AND (p20 <= p0)) U (p138 + p139 + p140 + p141 + p142 + p143 <= p34 + p35 + p36 + p37 + p38 + p39))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p1 + p2 + p3 + p4 + p5 + p6) AND (p20 <= p0)) U (p138 + p139 + p140 + p141 + p142 + p143 <= p34 + p35 + p36 + p37 + p38 + p39)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((((1 <= p1 + p2 + p3 + p4 + p5 + p6) AND (p20 <= p0)) U (p138 + p139 + p140 + p141 + p142 + p143 <= p34 + p35 + p36 + p37 + p38 + p39)))
lola: processed formula length: 139
lola: 45 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((6 <= p1 + p2 + p3 + p4 + p5 + p6))))) AND A ((((1 <= p1 + p2 + p3 + p4 + p5 + p6) AND (p20 <= p0)) U (p138 + p139 + p140 + p141 + p142 + p143 <= p34 + p35 + p36 + p37 + p38 + p39))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p1 + p2 + p3 + p4 + p5 + p6) AND (p20 <= p0)) U (p138 + p139 + p140 + p141 + p142 + p143 <= p34 + p35 + p36 + p37 + p38 + p39)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((((1 <= p1 + p2 + p3 + p4 + p5 + p6) AND (p20 <= p0)) U (p138 + p139 + p140 + p141 + p142 + p143 <= p34 + p35 + p36 + p37 + p38 + p39)))
lola: processed formula length: 139
lola: 45 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((6 <= p1 + p2 + p3 + p4 + p5 + p6)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (6 <= p1 + p2 + p3 + p4 + p5 + p6)
lola: processed formula length: 34
lola: 42 rewrites
lola: closed formula file SafeBus-COL-06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 116604 markings, 218072 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA SafeBus-COL-06-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes no no yes no no yes yes no no yes yes no no
lola:
preliminary result: yes yes yes no no yes no no yes yes no no yes yes no no
lola: memory consumption: 24464 KB
lola: time consumption: 31 seconds

BK_STOP 1526974481575

--------------------
content from 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="SafeBus-COL-06"
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/SafeBus-COL-06.tgz
mv SafeBus-COL-06 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is SafeBus-COL-06, 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 r148-smll-152685547100185"
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 ;