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 244K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 61K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is QuasiCertifProtocol-COL-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578700017
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526905678758

info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-COL-06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-COL-06 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ QuasiCertifProtocol-COL-06 @ 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: 386/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8640
lola: finding significant places
lola: 270 places, 116 transitions, 115 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 151 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p155)
lola: LP says that atomic proposition is always false: (3 <= p103)
lola: LP says that atomic proposition is always false: (2 <= p155)
lola: LP says that atomic proposition is always false: (2 <= p94)
lola: always true
lola: LP says that atomic proposition is always false: (2 <= p94)
lola: LP says that atomic proposition is always true: (p57 + p56 + p55 + p54 + p53 + p52 + p58 <= p120 + p126 + p125 + p124 + p123 + p122 + p121)
lola: NOT(E (G (E (F ((p0 <= p66 + p67 + p68 + p69 + p70 + p71 + p72)))))) : ((E (F (((p2 <= p112) AND (2 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p45 + p38 + p31 + p24 + p17 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p18 + p19 + p20 + p21 + p22 + p23 + p25 + p26 + p27 + p28 + p29 + p30 + p32 + p33 + p34 + p35 + p36 + p37 + p39 + p40 + p41 + p42 + p43 + p44 + p46 + p47 + p48 + p49 + p50 + p51)))) OR E (G (((p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p94) OR (3 <= p100 + p101 + p95 + p96 + p97 + p98 + p99))))) OR (3 <= p134 + p135 + p136 + p137 + p138 + p139 + p140)) : A ((E (G ((3 <= p120 + p126 + p125 + p124 + p123 + p122 + p121))) U E (G (FALSE)))) : A (F (A (X (((1 <= p73 + p74 + p75 + p76 + p77 + p78 + p79)))))) : E (F ((p65 + p64 + p63 + p62 + p61 + p60 + p59 + 1 <= p0))) : A (G (((((p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p113 + p114 + p115 + p116 + p117 + p118 + p119))) AND A (F ((1 <= p263 + p264 + p265 + p266 + p267 + p268 + p269)))))) : ((((p263 + p264 + p265 + p266 + p267 + p268 + p269 + 1 <= p73 + p74 + p75 + p76 + p77 + p78 + p79) OR (p92 + p91 + p90 + p89 + p88 + p87 + p93 <= 2)) AND (p66 + p67 + p68 + p69 + p70 + p71 + p72 <= 2) AND ((p141 + p142 + p143 + p144 + p145 + p146 + p147 <= p164) OR (1 <= p105 + p106 + p107 + p108 + p109 + p110 + p111))) AND E (F (A (F ((1 <= p73 + p74 + p75 + p76 + p77 + p78 + p79)))))) : A (F ((A (G (TRUE)) AND ((p134 + p135 + p136 + p137 + p138 + p139 + p140 <= 1) AND (p65 + p64 + p63 + p62 + p61 + p60 + p59 + 1 <= p141 + p142 + p143 + p144 + p145 + p146 + p147))))) : (() OR A (G (((p1 <= 0) OR (2 <= p134 + p135 + p136 + p137 + p138 + p139 + p140))))) : E (G ((p127 + p128 + p129 + p130 + p131 + p132 + p133 <= p112))) : NOT((NOT(A (X ((p120 + p126 + p125 + p124 + p123 + p122 + p121 <= p163)))) AND NOT(A (G (TRUE))))) : ((E (G (((p164 <= p80 + p81 + p82 + p83 + p84 + p85 + p86) AND (p263 + p264 + p265 + p266 + p267 + p268 + p269 <= p57 + p56 + p55 + p54 + p53 + p52 + p58)))) AND (A (G ((1 <= p103))) AND ((2 <= p120 + p126 + p125 + p124 + p123 + p122 + p121) OR (1 <= p73 + p74 + p75 + p76 + p77 + p78 + p79) OR (p141 + p142 + p143 + p144 + p145 + p146 + p147 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p222 + p223 + p224 + p225 + p226 + p227 + p229 + p230 + p231 + p232 + p233 + p234 + p236 + p237 + p238 + p239 + p240 + p241 + p243 + p244 + p245 + p246 + p247 + p248 + p250 + p251 + p252 + p253 + p254 + p255 + p257 + p258 + p259 + p260 + p261 + p262)))) OR E (G ((p163 <= p92 + p91 + p90 + p89 + p88 + p87 + p93)))) : NOT(A (F ((3 <= p66 + p67 + p68 + p69 + p70 + p71 + p72)))) : A ((E (X ((p66 + p67 + p68 + p69 + p70 + p71 + p72 <= p148 + p149 + p150 + p151 + p152 + p153 + p154))) U A (X ((1 <= p105 + p106 + p107 + p108 + p109 + p110 + p111))))) : E (((p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p179 + p186 + p193 + p200 + p207 + p205 + p206 + p204 + p208 + p209 + p210 + p211 + p212 + p213 + p203 + p202 + p201 + p199 + p198 + p197 + p196 + p195 + p194 + p192 + p191 + p190 + p189 + p188 + p187 + p185 + p184 + p183 + p182 + p181 + p180 + p178 + p177 + p176 + p175 + p174 + p173 <= p102) U E (G ((p2 <= p66 + p67 + p68 + p69 + p70 + p71 + p72))))) : (((p148 + p149 + p150 + p151 + p152 + p153 + p154 + 1 <= p2) AND (p120 + p126 + p125 + p124 + p123 + p122 + p121 <= 2)) OR A (F (A (G ((1 <= p94))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:254
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:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:455
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:116
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:279
lola: rewrite Frontend/Parser/formula_rewrite.k:117
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 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: 31 rewrites
lola: closed formula file QuasiCertifProtocol-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 QuasiCertifProtocol-COL-06-CTLCardinality-2 FALSE 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 31 rewrites
lola: closed formula file QuasiCertifProtocol-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 QuasiCertifProtocol-COL-06-CTLCardinality-10 TRUE 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: A (F (A (X (((1 <= p73 + p74 + p75 + p76 + p77 + p78 + p79))))))
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 <= p73 + p74 + p75 + p76 + p77 + p78 + p79))))
lola: processed formula length: 62
lola: 33 rewrites
lola: closed formula file QuasiCertifProtocol-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: 480082 markings, 2582839 edges, 96016 markings/sec, 0 secs
lola: 832536 markings, 5097017 edges, 70491 markings/sec, 5 secs
lola: 1217411 markings, 7658436 edges, 76975 markings/sec, 10 secs
lola: 1592423 markings, 10145802 edges, 75002 markings/sec, 15 secs
lola: 1901245 markings, 12568016 edges, 61764 markings/sec, 20 secs
lola: 2156238 markings, 14902449 edges, 50999 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2267330 markings, 15981372 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((E (X ((p66 + p67 + p68 + p69 + p70 + p71 + p72 <= p148 + p149 + p150 + p151 + p152 + p153 + p154))) U A (X ((1 <= p105 + p106 + p107 + p108 + p109 + p110 + p111)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: processed formula: A(EX((p66 + p67 + p68 + p69 + p70 + p71 + p72 <= p148 + p149 + p150 + p151 + p152 + p153 + p154)) U AX((1 <= p105 + p106 + p107 + p108 + p109 + p110 + p111)))
lola: processed formula length: 158
lola: 34 rewrites
lola: closed formula file QuasiCertifProtocol-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: 189536 markings, 600043 edges

FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p65 + p64 + p63 + p62 + p61 + p60 + p59 + 1 <= p0)))
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 ((p65 + p64 + p63 + p62 + p61 + p60 + p59 + 1 <= p0)))
lola: processed formula length: 59
lola: 32 rewrites
lola: closed formula file QuasiCertifProtocol-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: (p65 + p64 + p63 + p62 + p61 + p60 + p59 + 1 <= p0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-06-CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-06-CTLCardinality-4-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: 10344 markings, 42682 edges
lola: state equation 0: solution produced
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p1 <= 0) OR (2 <= p134 + p135 + p136 + p137 + p138 + p139 + p140))))
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 (((p1 <= 0) OR (2 <= p134 + p135 + p136 + p137 + p138 + p139 + p140))))
lola: processed formula length: 77
lola: 33 rewrites
lola: closed formula file QuasiCertifProtocol-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: ((1 <= p1) AND (p134 + p135 + p136 + p137 + p138 + p139 + p140 <= 1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-06-CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 36 markings, 35 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p66 + p67 + p68 + p69 + p70 + p71 + p72 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p66 + p67 + p68 + p69 + p70 + p71 + p72 <= 2)))
lola: processed formula length: 54
lola: 31 rewrites
lola: closed formula file QuasiCertifProtocol-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 is possibly preserved.
lola: 14 markings, 13 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p127 + p128 + p129 + p130 + p131 + p132 + p133 <= p112)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p127 + p128 + p129 + p130 + p131 + p132 + p133 <= p112)))
lola: processed formula length: 64
lola: 31 rewrites
lola: closed formula file QuasiCertifProtocol-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 is possibly preserved.
lola: 10 markings, 9 edges

FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((p134 + p135 + p136 + p137 + p138 + p139 + p140 <= 1) AND (p65 + p64 + p63 + p62 + p61 + p60 + p59 + 1 <= p141 + p142 + p143 + p144 + p145 + p146 + p147))))
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: ((2 <= p134 + p135 + p136 + p137 + p138 + p139 + p140) OR (p141 + p142 + p143 + p144 + p145 + p146 + p147 <= p65 + p64 + p63 + p62 + p61 + p60 + p59))
lola: processed formula length: 151
lola: 33 rewrites
lola: closed formula file QuasiCertifProtocol-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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p179 + p186 + p193 + p200 + p207 + p205 + p206 + p204 + p208 + p209 + p210 + p211 + p212 + p213 + p203 + p202 + p201 + p199 + p198 + p197 + p196 + p195 + p194 + p192 + p191 + p190 + p189 + p188 + p187 + p185 + p184 + p183 + p182 + p181 + p180 + p178 + p177 + p176 + p175 + p174 + p173 <= p102) U E (G ((p2 <= p66 + p67 + p68 + p69 + p70 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E((p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p179 + p186 + p193 + p200 + p207 + p205 + p206 + p204 + p208 + p209 + p210 + p211 + p212 + p213 + p203 + p202 + p201 + p199 + p198 + p197 + p196 + p195 + p194 + p192 + p191 + p190 + p189 + p188 + p187 + p185 + p184 + p183 + p182 + p181 + p180 + p178 + p177 + p176 + p175 + p174 + p173 <= p102) U NOT(A(TRUE U (p66 + p67 + p68 + p69 + p70 + p... (shortened)
lola: processed formula length: 422
lola: 34 rewrites
lola: closed formula file QuasiCertifProtocol-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: 192239 markings, 551675 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 587 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p66 + p67 + p68 + p69 + p70 + p71 + p72 + 1 <= p0)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (p0 <= p66 + p67 + p68 + p69 + p70 + p71 + p72)
lola: processed formula length: 47
lola: 33 rewrites
lola: closed formula file QuasiCertifProtocol-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: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p263 + p264 + p265 + p266 + p267 + p268 + p269 + 1 <= p73 + p74 + p75 + p76 + p77 + p78 + p79) OR (p92 + p91 + p90 + p89 + p88 + p87 + p93 <= 2)) AND (p66 + p67 + p68 + p69 + p70 + p71 + p72 <= 2) AND ((p141 + p142 + p143 + p144 + p145 + p146 + p147 <= p164) OR (1 <= p105 + p106 + p107 + p108 + p109 + p110 + p111))) AND E (F ((1 <= p73 + p74 + p75 + p76 + p77 + p78 + p79))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 704 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p73 + p74 + p75 + p76 + p77 + p78 + p79)))
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 <= p73 + p74 + p75 + p76 + p77 + p78 + p79)))
lola: processed formula length: 54
lola: 32 rewrites
lola: closed formula file QuasiCertifProtocol-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 <= p73 + p74 + p75 + p76 + p77 + p78 + p79)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-06-CTLCardinality-11-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 56 markings, 55 edges
lola: ========================================
lola: subprocess 12 will run for 880 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p263 + p264 + p265 + p266 + p267 + p268 + p269 + 1 <= p73 + p74 + p75 + p76 + p77 + p78 + p79) OR (p92 + p91 + p90 + p89 + p88 + p87 + p93 <= 2)) AND (p66 + p67 + p68 + p69 + p70 + p71 + p72 <= 2) AND ((p141 + p142 + p143 + p144 + p145 + p146 + p147 <= p164) OR (1 <= p105 + p106 + p107 + p108 + p109 + p110 + p111)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p263 + p264 + p265 + p266 + p267 + p268 + p269 + 1 <= p73 + p74 + p75 + p76 + p77 + p78 + p79) OR (p92 + p91 + p90 + p89 + p88 + p87 + p93 <= 2)) AND (p66 + p67 + p68 + p69 + p70 + p71 + p72 <= 2) AND ((p141 + p142 + p143 + p144 + p145 + p146 + p147 <= p164) OR (1 <= p105 + p106 + p107 + p108 + p109 + p110 + p111)))
lola: processed formula length: 322
lola: 31 rewrites
lola: closed formula file QuasiCertifProtocol-COL-06-CTLCardinality.task
lola: processed formula with 5 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 880 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p148 + p149 + p150 + p151 + p152 + p153 + p154 + 1 <= p2) AND (p120 + p126 + p125 + p124 + p123 + p122 + p121 <= 2)) OR A (F (A (G ((1 <= p94))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 880 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p148 + p149 + p150 + p151 + p152 + p153 + p154 + 1 <= p2) AND (p120 + p126 + p125 + p124 + p123 + p122 + p121 <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p148 + p149 + p150 + p151 + p152 + p153 + p154 + 1 <= p2) AND (p120 + p126 + p125 + p124 + p123 + p122 + p121 <= 2))
lola: processed formula length: 118
lola: 31 rewrites
lola: closed formula file QuasiCertifProtocol-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 13 will run for 1174 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((1 <= p94)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p94 <= 0)
lola: processed formula length: 10
lola: 33 rewrites
lola: closed formula file QuasiCertifProtocol-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: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 10 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1174 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p113 + p114 + p115 + p116 + p117 + p118 + p119))))) AND A (G (A (F ((1 <= p263 + p264 + p265 + p266 + p267 + p268 + p269))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1174 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p113 + p114 + p115 + p116 + p117 + p118 + p119)))))
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 ((((p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p113 + p114 + p115 + p116 + p117 + p118 + p119)))))
lola: processed formula length: 103
lola: 33 rewrites
lola: closed formula file QuasiCertifProtocol-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 57 markings, 56 edges
lola: formula 0: (((p113 + p114 + p115 + p116 + p117 + p118 + p119 + 1 <= p73 + p74 + p75 + p76 + p77 + p78 + p79)))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-06-CTLCardinality-13-0.sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: state equation: calling and running sara
========================================
lola: subprocess 14 will run for 1761 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((p2 <= p112) AND (2 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p45 + p38 + p31 + p24 + p17 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p18 + p19 + p20 + p21 + p22 + p23 + p25 + p26 + p27 + p28 + p29 + p30 + p32 + p33 + p34 + p35 + p36 + p37 + p39 + p40 + p41 + p42 + p43 + p44 + p46 + p47 + p48 + p49 + p50 + p51)))) OR (E (G (((p73 + p74 + p75 + p76 + p77 + p78 + p79 <= p94) OR (3 <= p100 + p10... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
sara: try reading problem file QuasiCertifProtocol-COL-06-CTLCardinality-13-0.sara.
lola: subprocess 14 will run for 1761 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p2 <= p112) AND (2 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p45 + p38 + p31 + p24 + p17 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p18 + p19 + p20 + p21 + p22 + p23 + p25 + p26 + p27 + p28 + p29 + p30 + p32 + p33 + p34 + p35 + p36 + p37 + p39 + p40 + p41 + p42 + p43 + p44 + p46 + p47 + p48 + p49 + p50 + p51))))
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 (((p2 <= p112) AND (2 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p45 + p38 + p31 + p24 + p17 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p18 + p19 + p20 + p21 + p22 + p23 + p25 + p26 + p27 + p28 + p29 + p30 + p32 + p33 + p34 + p35 + p36 + p37 + p39 + p40 + p41 + p42 + p43 + p44 + p46 + p47 + p48 + p49 + p50 + p51))))
lola: processed formula length: 318
lola: 32 rewrites
lola: closed formula file QuasiCertifProtocol-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: ((p2 <= p112) AND (2 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p45 + p38 + p31 + p24 + p17 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p18 + p19 + p20 + p21 + p22 + p23 + p25 + p26 + p27 + p28 + p29 + p30 + p32 + p33 + p34 + p35 + p36 + p37 + p39 + p40 + p41 + p42 + p43 + p44 + p46 + p47 + p48 + p49 + p50 + p51))
lola: SUBRESULT
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 35 markings, 34 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-06-CTLCardinality-14-0.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3522 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (G (((p164 <= p80 + p81 + p82 + p83 + p84 + p85 + p86) AND (p263 + p264 + p265 + p266 + p267 + p268 + p269 <= p57 + p56 + p55 + p54 + p53 + p52 + p58)))) AND (A (G ((1 <= p103))) AND ((2 <= p120 + p126 + p125 + p124 + p123 + p122 + p121) OR (1 <= p73 + p74 + p75 + p76 + p77 + p78 + p79) OR (p141 + p142 + p143 + p144 + p145 + p146 + p147 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p21... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
sara: try reading problem file QuasiCertifProtocol-COL-06-CTLCardinality-14-0.sara.
lola: subprocess 15 will run for 3522 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p103)))
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 ((1 <= p103)))
lola: processed formula length: 19
lola: 33 rewrites
lola: closed formula file QuasiCertifProtocol-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
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 (((p164 <= p80 + p81 + p82 + p83 + p84 + p85 + p86) AND (p263 + p264 + p265 + p266 + p267 + p268 + p269 <= p57 + p56 + p55 + p54 + p53 + p52 + p58)))) AND (A (G ((1 <= p103))) AND ((2 <= p120 + p126 + p125 + p124 + p123 + p122 + p121) OR (1 <= p73 + p74 + p75 + p76 + p77 + p78 + p79) OR (p141 + p142 + p143 + p144 + p145 + p146 + p147 <= p256 + p249 + p242 + p235 + p228 + p221 + p214 + p21... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p103)))
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 ((1 <= p103)))
lola: processed formula length: 19
lola: 33 rewrites
lola: closed formula file QuasiCertifProtocol-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: (p103 <= 0)
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: state equation: write sara problem file to QuasiCertifProtocol-COL-06-CTLCardinality-16-0.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((p163 <= p92 + p91 + p90 + p89 + p88 + p87 + p93)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p163 <= p92 + p91 + p90 + p89 + p88 + p87 + p93)))
lola: processed formula length: 57
lola: 31 rewrites
lola: closed formula file QuasiCertifProtocol-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 is possibly preserved.
lola: 14 markings, 13 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
========================================
lola: ========================================
sara: try reading problem file QuasiCertifProtocol-COL-06-CTLCardinality-16-0.sara.

FORMULA QuasiCertifProtocol-COL-06-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no yes yes no yes no no yes yes yes yes no yes no
lola:
preliminary result: no yes no yes yes no yes no no yes yes yes yes no yes no
sara: place or transition ordering is non-deterministic
lola: memory consumption: 24560 KB
lola: time consumption: 47 seconds


BK_STOP 1526905746326

--------------------
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="QuasiCertifProtocol-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/QuasiCertifProtocol-COL-06.tgz
mv QuasiCertifProtocol-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 QuasiCertifProtocol-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 r136-qhx2-152673578700017"
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 ;