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 208K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685547100192
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526978712580

info: Time: 3600 - MCC
===========================================================================================
prep: translating SafeBus-COL-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SafeBus-COL-10 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ SafeBus-COL-10 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1977/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: Size of bit vector: 10432
lola: finding significant places
lola: 326 places, 1651 transitions, 271 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1013 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-COL-10-CTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (p104 <= p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40)
lola: after: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: LP says that atomic proposition is always false: (3 <= p51)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40)
lola: after: (2 <= 0)
lola: always false
lola: LP says that atomic proposition is always false: (3 <= p103)
lola: place invariant simplifies atomic proposition
lola: before: (p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)
lola: after: (1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)
lola: LP says that atomic proposition is always false: (2 <= p30)
lola: LP says that atomic proposition is always false: (2 <= p30)
lola: place invariant simplifies atomic proposition
lola: before: (p45 + p46 + p47 + p48 + p49 + p50 + p44 + p43 + p42 + p41 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71)
lola: after: (1 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71)
lola: place invariant simplifies atomic proposition
lola: before: (p30 <= p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40)
lola: after: (p30 <= 1)
lola: LP says that atomic proposition is always true: (p30 <= 1)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p115 + p114 + p113 + p112 + p111 + p110 + p109 + p108 + p107 + p106)
lola: after: (0 <= 7)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81)
lola: LP says that atomic proposition is always false: (2 <= p104)
lola: place invariant simplifies atomic proposition
lola: before: (p45 + p46 + p47 + p48 + p49 + p50 + p44 + p43 + p42 + p41 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71)
lola: after: (1 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40)
lola: after: (0 <= 0)
lola: always true
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 <= p51)
lola: after: (1 <= p51)
lola: LP says that atomic proposition is always false: (2 <= p100 + p101 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p99)
lola: LP says that atomic proposition is always false: (2 <= p105)
lola: place invariant simplifies atomic proposition
lola: before: (p104 <= p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40)
lola: after: (p104 <= 1)
lola: LP says that atomic proposition is always true: (p104 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p115 + p114 + p113 + p112 + p111 + p110 + p109 + p108 + p107 + p106)
lola: after: (0 <= 9)
lola: always true
lola: E (X (A (G (TRUE)))) : NOT(E (G (A (F (FALSE))))) : NOT((() OR NOT(E (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))))) : (A (G ((p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))) OR (p103 + 1 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215)) : A (F (E (G (((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (1 <= p30)))))) : (TRUE AND A (F (A (F ((1 <= p105)))))) : A ((E (F (FALSE)) U (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))) : A ((A (F ((2 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71))) U (1 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71))) : (A (G (())) AND TRUE) : ((NOT(A (F (FALSE))) AND ((p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 <= 2) AND ((p100 + p101 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p99 <= p103) OR (1 <= p51)))) OR (() AND (E (G (TRUE)) AND (((p103 <= p105)) OR (p51 <= 0))))) : A (F (FALSE)) : NOT(E (F (A (G (FALSE))))) : NOT(A (F (((p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + 1 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29) OR (p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + 1 <= p105))))) : NOT(E ((TRUE U FALSE))) : E (F ((p100 + p101 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p99 + 1 <= p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91))) : A (F ((p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 <= p30)))
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:130
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:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:392
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:184
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:282
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
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:116
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:121
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT DEADLOCK
lola: processed formula length: 12
lola: 60 rewrites
lola: closed formula file SafeBus-COL-10-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-10-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 236 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: 60 rewrites
lola: closed formula file SafeBus-COL-10-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-10-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)
lola: processed formula length: 54
lola: 60 rewrites
lola: closed formula file SafeBus-COL-10-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SafeBus-COL-10-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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 60 rewrites
lola: closed formula file SafeBus-COL-10-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-10-CTLCardinality-8 TRUE 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: ((p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 <= 2) AND ((p100 + p101 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p99 <= p103) OR (1 <= p51)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 <= 2) AND ((p100 + p101 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p99 <= p103) OR (1 <= p51)))
lola: processed formula length: 157
lola: 60 rewrites
lola: closed formula file SafeBus-COL-10-CTLCardinality.task
lola: processed formula with 3 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-10-CTLCardinality-9 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 60 rewrites
lola: closed formula file SafeBus-COL-10-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-10-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 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: 60 rewrites
lola: closed formula file SafeBus-COL-10-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-10-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 7 will run for 394 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: 60 rewrites
lola: closed formula file SafeBus-COL-10-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-10-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 (F ((p100 + p101 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p99 + 1 <= p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91)))
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 ((p100 + p101 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p99 + 1 <= p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91)))
lola: processed formula length: 134
lola: 61 rewrites
lola: closed formula file SafeBus-COL-10-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: (p100 + p101 + p98 + p97 + p96 + p95 + p94 + p93 + p92 + p99 + 1 <= p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-10-CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-10-CTLCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1424 markings, 1660 edges
lola: ========================================

FORMULA SafeBus-COL-10-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p105)))
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: (p105 <= 0)
lola: processed formula length: 11
lola: 62 rewrites
lola: closed formula file SafeBus-COL-10-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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 85 markings, 85 edges
lola: ========================================

FORMULA SafeBus-COL-10-CTLCardinality-5 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: A (F ((p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325 <= p30)))
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: (p30 + 1 <= p316 + p317 + p318 + p319 + p320 + p321 + p322 + p323 + p324 + p325)
lola: processed formula length: 80
lola: 62 rewrites
lola: closed formula file SafeBus-COL-10-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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 116 markings, 116 edges
lola:
FORMULA SafeBus-COL-10-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 11 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29)))
lola: processed formula length: 128
lola: 60 rewrites
lola: closed formula file SafeBus-COL-10-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 is possibly preserved.
lola: 5297 markings, 7481 edges
lola:
FORMULA SafeBus-COL-10-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 12 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91) AND (p105 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 <= p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91) AND (p105 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71))))
lola: processed formula length: 202
lola: 60 rewrites
lola: closed formula file SafeBus-COL-10-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 is possibly preserved.
lola: 29390 markings, 63021 edges
lola:
FORMULA SafeBus-COL-10-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 13 will run for 1182 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((2 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71))) U (1 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(A(TRUE U (2 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71)) U (1 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71))
lola: processed formula length: 144
lola: 62 rewrites
lola: closed formula file SafeBus-COL-10-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: 150 markings, 151 edges
lola: ========================================

FORMULA SafeBus-COL-10-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1773 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((1 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19) AND (1 <= p30))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U NOT(A(TRUE U ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 <= 0) OR (p30 <= 0)))))
lola: processed formula length: 106
lola: 63 rewrites
lola: closed formula file SafeBus-COL-10-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: 5191 markings, 19622 edges
lola:
========================================
FORMULA SafeBus-COL-10-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))) OR (p103 + 1 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))
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 ((p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))
lola: processed formula length: 128
lola: 62 rewrites
lola: closed formula file SafeBus-COL-10-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: (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-10-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-10-CTLCardinality-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 32 markings, 31 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: (A (G ((p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19))) OR (p103 + 1 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))
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 ((p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19)))
lola: processed formula length: 128
lola: 62 rewrites
lola: closed formula file SafeBus-COL-10-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: (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + 1 <= p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-COL-10-CTLCardinality-16-0.sara
lola: state equation: calling and running sara
sara: try reading problem file SafeBus-COL-10-CTLCardinality-16-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 32 markings, 31 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (p103 + 1 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p103 + 1 <= p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p1... (shortened)
lola: processed formula length: 711
lola: 60 rewrites
lola: closed formula file SafeBus-COL-10-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SafeBus-COL-10-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes no no no no no yes yes no yes yes yes yes no
lola:
preliminary result: yes yes yes no no no no no yes yes no yes yes yes yes no
lola: memory consumption: 31980 KB
lola: time consumption: 22 seconds

BK_STOP 1526978735687

--------------------
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-10"
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-10.tgz
mv SafeBus-COL-10 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-10, 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-152685547100192"
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 ;