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 204K
-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.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 9.7K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 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 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 37K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PermAdmissibility-COL-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-csrt-152666474100451
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527153497118


BK_STOP 1527154853789

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PermAdmissibility-COL-10 as instance name.
Using PermAdmissibility as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1411062, 'Memory': 15952.91, 'Tool': 'lola'}, {'Time': 1412455, 'Memory': 15945.46, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLCardinality lola PermAdmissibility-COL-10...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PermAdmissibility-COL-10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-10: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ PermAdmissibility-COL-10 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 208 places, 1024 transitions, 177 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1460 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-10-CTLCardinality.task
lola: ((p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + 1 <= p155) OR A (X (A (F ((1 <= p206)))))) : E (G ((p154 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66))) : ((E (F ((p89 + p88 + p87 + p86 + p90 + p91 + p92 + p93 <= p26))) OR (A (X ((2 <= p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136))) OR (p153 + 1 <= p100 + p101 + p102 + p95 + p96 + p97 + p98 + p99))) AND E (F (((p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + 1 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42) AND (p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 <= 0))))) : E (G ((E (F ((p26 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42))) AND ((p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= 1) OR (p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 <= 0))))) : E (F (((2 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42) AND (p206 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205) AND (p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 <= p67) AND (1 <= p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144)))) : A (G ((p206 <= 2))) : A (G ((((1 <= p85) OR ((p155 <= p103) AND (2 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189))) AND A (G ((p207 <= p9)))))) : NOT(A (F ((1 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66)))) : (A (G ((p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + 1 <= p103))) AND A (F ((1 <= p9)))) : (NOT(NOT(E (F ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p181))))) AND NOT(A (F ((2 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127))))) : E (G ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25))) : A (F ((E (G ((3 <= p153))) AND ((p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84 <= p67) OR (1 <= p206) OR (3 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34) OR (p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127))))) : A (G ((p68 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25))) : E (F (A (G (((1 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25) OR (p26 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163)))))) : (((A (F ((3 <= p8))) AND (p154 <= 2)) OR ((p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + 1 <= p155) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))) OR NOT(((p172 <= 0) AND E (F ((2 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25)))))) : NOT((((p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25) AND E (F ((2 <= p207)))) OR E (G ((1 <= p128)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + 1 <= p155) OR A (X (A (F ((1 <= p206))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + 1 <= p155)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + 1 <= p155)
lola: processed formula length: 67
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-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: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((1 <= p206)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (1 <= p206)))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1588566 markings, 2073111 edges, 2976872481744224256 markings/sec, 0 secs
lola: 3154002 markings, 4185412 edges, 313087 markings/sec, 5 secs
lola: 4764647 markings, 6364917 edges, 322129 markings/sec, 10 secs
lola: 6264782 markings, 8380052 edges, 300027 markings/sec, 15 secs
lola: 7690175 markings, 10368408 edges, 285079 markings/sec, 20 secs
lola: 9043389 markings, 12302522 edges, 270643 markings/sec, 25 secs
lola: 10496451 markings, 14360731 edges, 290612 markings/sec, 30 secs
lola: 12061312 markings, 16470031 edges, 312972 markings/sec, 35 secs
lola: 13584661 markings, 18567967 edges, 304670 markings/sec, 40 secs
lola: 15111977 markings, 20657344 edges, 305463 markings/sec, 45 secs
lola: 16468949 markings, 22621857 edges, 271394 markings/sec, 50 secs
lola: 17845661 markings, 24582802 edges, 275342 markings/sec, 55 secs
lola: 19173753 markings, 26524948 edges, 265618 markings/sec, 60 secs
lola: 20603729 markings, 28503993 edges, 285995 markings/sec, 65 secs
lola: 22099555 markings, 30518637 edges, 299165 markings/sec, 70 secs
lola: 23516982 markings, 32473346 edges, 283485 markings/sec, 75 secs
lola: 24834247 markings, 34380169 edges, 263453 markings/sec, 80 secs
lola: 26242801 markings, 36383426 edges, 281711 markings/sec, 85 secs
lola: 27600785 markings, 38296814 edges, 271597 markings/sec, 90 secs
lola: 28979239 markings, 40308475 edges, 275691 markings/sec, 95 secs
lola: 30569016 markings, 42517161 edges, 317955 markings/sec, 100 secs
lola: 31983417 markings, 44523130 edges, 282880 markings/sec, 105 secs
lola: 33368546 markings, 46504997 edges, 277026 markings/sec, 110 secs
lola: 34660505 markings, 48419756 edges, 258392 markings/sec, 115 secs
lola: 35984679 markings, 50370423 edges, 264835 markings/sec, 120 secs
lola: 37245809 markings, 52277858 edges, 252226 markings/sec, 125 secs
lola: 38657705 markings, 54195990 edges, 282379 markings/sec, 130 secs
lola: 39995666 markings, 56052707 edges, 267592 markings/sec, 135 secs
lola: 41382855 markings, 57998369 edges, 277438 markings/sec, 140 secs
lola: 42834869 markings, 60032228 edges, 290403 markings/sec, 145 secs
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: subprocess 1 will run for 225 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p154 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + 1 <= p154)))
lola: processed formula length: 74
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1295659 markings, 2059008 edges, 2976872481744224256 markings/sec, 0 secs
lola: 2505048 markings, 3989004 edges, 241878 markings/sec, 5 secs
lola: 3605575 markings, 5824035 edges, 220105 markings/sec, 10 secs
lola: 4774717 markings, 7900750 edges, 233828 markings/sec, 15 secs
lola: 5916022 markings, 9741109 edges, 228261 markings/sec, 20 secs
lola: 7123636 markings, 11635363 edges, 241523 markings/sec, 25 secs
lola: 8283342 markings, 13513949 edges, 231941 markings/sec, 30 secs
lola: 9385311 markings, 15328920 edges, 220394 markings/sec, 35 secs
lola: 10451700 markings, 17141102 edges, 213278 markings/sec, 40 secs
lola: 11571452 markings, 19252008 edges, 223950 markings/sec, 45 secs
lola: 12830644 markings, 21406816 edges, 251838 markings/sec, 50 secs
lola: 14058554 markings, 23546486 edges, 245582 markings/sec, 55 secs
lola: 15261475 markings, 25507919 edges, 240584 markings/sec, 60 secs
lola: 16423165 markings, 27326792 edges, 232338 markings/sec, 65 secs
lola: 17525505 markings, 29123512 edges, 220468 markings/sec, 70 secs
lola: 18561273 markings, 30872786 edges, 207154 markings/sec, 75 secs
lola: 19626892 markings, 32616005 edges, 213124 markings/sec, 80 secs
lola: 20733447 markings, 34634986 edges, 221311 markings/sec, 85 secs
lola: 21846965 markings, 36600778 edges, 222704 markings/sec, 90 secs
lola: 22979324 markings, 38551716 edges, 226472 markings/sec, 95 secs
lola: 24154803 markings, 40512014 edges, 235096 markings/sec, 100 secs
lola: 25342448 markings, 42379458 edges, 237529 markings/sec, 105 secs
lola: 26431966 markings, 44150797 edges, 217904 markings/sec, 110 secs
lola: 27529676 markings, 45986157 edges, 219542 markings/sec, 115 secs
lola: 28645495 markings, 47836119 edges, 223164 markings/sec, 120 secs
lola: 29714019 markings, 49591825 edges, 213705 markings/sec, 125 secs
lola: 30803304 markings, 51331208 edges, 217857 markings/sec, 130 secs
lola: 31878667 markings, 53094946 edges, 215073 markings/sec, 135 secs
lola: 32967128 markings, 55022507 edges, 217692 markings/sec, 140 secs
lola: 34001538 markings, 56907669 edges, 206882 markings/sec, 145 secs
lola: 34985049 markings, 58721032 edges, 196702 markings/sec, 150 secs
lola: 35972695 markings, 60573777 edges, 197529 markings/sec, 155 secs
lola: 37051893 markings, 62434242 edges, 215840 markings/sec, 160 secs
lola: 38124767 markings, 64288922 edges, 214575 markings/sec, 165 secs
lola: 39181368 markings, 66111656 edges, 211320 markings/sec, 170 secs
lola: 40262437 markings, 67984983 edges, 216214 markings/sec, 175 secs
lola: 41423675 markings, 69976932 edges, 232248 markings/sec, 180 secs
lola: 42594549 markings, 72014760 edges, 234175 markings/sec, 185 secs
lola: 43713773 markings, 73966102 edges, 223845 markings/sec, 190 secs
lola: 44786874 markings, 75864827 edges, 214620 markings/sec, 195 secs
lola: 45856911 markings, 77929140 edges, 214007 markings/sec, 200 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 226 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F ((p89 + p88 + p87 + p86 + p90 + p91 + p92 + p93 <= p26))) OR (A (X ((2 <= p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136))) OR (p153 + 1 <= p100 + p101 + p102 + p95 + p96 + p97 + p98 + p99))) AND E (F (((p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + 1 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42) AND (p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 226 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p89 + p88 + p87 + p86 + p90 + p91 + p92 + p93 <= p26)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: subprocess 3 will run for 244 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + 1 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42) AND (p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: ========================================
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 244 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((p26 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42))) AND ((p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 <= 1) OR (p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(E(TRUE U (p26 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42))) OR ((2 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66) AND (1 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42)))))
lola: processed formula length: 201
lola: 4 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 161 markings, 331 edges
lola: ========================================
lola: subprocess 4 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42) AND (p206 <= p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205) AND (p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 <= p67) AND (1 <= p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-10-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-10-CTLCardinality-4.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 288 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p206 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-10-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: lola: state equation: calling and running sara
The predicate is not invariant.
lola: 16 markings, 15 edges
sara: try reading problem file PermAdmissibility-COL-10-CTLCardinality-5.sara.
lola: ========================================
lola: subprocess 6 will run for 317 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= p85) OR ((p155 <= p103) AND (2 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189))) AND A (G ((p207 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 317 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p85) OR ((p155 <= p103) AND (2 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 7 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((1 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66)))
lola: processed formula length: 67
lola: 5 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic

lola: 1620120 markings, 1886913 edges, 2976872481744224256 markings/sec, 0 secs
lola: 3213052 markings, 3768251 edges, 318586 markings/sec, 5 secs
lola: 4850061 markings, 5668965 edges, 327402 markings/sec, 10 secs
lola: 6503324 markings, 7597408 edges, 330653 markings/sec, 15 secs
lola: 8057864 markings, 9437265 edges, 310908 markings/sec, 20 secs
lola: 9545864 markings, 11237561 edges, 297600 markings/sec, 25 secs
lola: 11115083 markings, 13100275 edges, 313844 markings/sec, 30 secs
lola: 12661472 markings, 14932496 edges, 309278 markings/sec, 35 secs
lola: 14183598 markings, 16728011 edges, 304425 markings/sec, 40 secs
lola: 15680579 markings, 18546974 edges, 299396 markings/sec, 45 secs
lola: 17141428 markings, 20343155 edges, 292170 markings/sec, 50 secs
lola: 18601109 markings, 22134234 edges, 291936 markings/sec, 55 secs
lola: 20096417 markings, 23983644 edges, 299062 markings/sec, 60 secs
lola: 21420968 markings, 25709696 edges, 264910 markings/sec, 65 secs
lola: 22813675 markings, 27523771 edges, 278541 markings/sec, 70 secs
lola: 24394377 markings, 29441321 edges, 316140 markings/sec, 75 secs
lola: 25969221 markings, 31330979 edges, 314969 markings/sec, 80 secs
lola: 27497889 markings, 33212635 edges, 305734 markings/sec, 85 secs
lola: 28996147 markings, 35061917 edges, 299652 markings/sec, 90 secs
lola: 30506086 markings, 36910199 edges, 301988 markings/sec, 95 secs
lola: 31959043 markings, 38730573 edges, 290591 markings/sec, 100 secs
lola: 33375942 markings, 40537665 edges, 283380 markings/sec, 105 secs
lola: 34724130 markings, 42286797 edges, 269638 markings/sec, 110 secs
lola: 35956559 markings, 43987899 edges, 246486 markings/sec, 115 secs
lola: 37271054 markings, 45906790 edges, 262899 markings/sec, 120 secs
lola: 38538409 markings, 47836218 edges, 253471 markings/sec, 125 secs
lola: 39801211 markings, 49667826 edges, 252560 markings/sec, 130 secs
lola: 40964332 markings, 51418337 edges, 232624 markings/sec, 135 secs
lola: 42273567 markings, 53335240 edges, 261847 markings/sec, 140 secs
lola: 43468824 markings, 55184746 edges, 239051 markings/sec, 145 secs
lola: 44939664 markings, 56955117 edges, 294168 markings/sec, 150 secs
lola: 46462673 markings, 58755084 edges, 304602 markings/sec, 155 secs
lola: 47962839 markings, 60522174 edges, 300033 markings/sec, 160 secs
lola: 49451724 markings, 62297455 edges, 297777 markings/sec, 165 secs
lola: 50895657 markings, 64051781 edges, 288787 markings/sec, 170 secs
lola: 52350671 markings, 65796780 edges, 291003 markings/sec, 175 secs
lola: 53814313 markings, 67554432 edges, 292728 markings/sec, 180 secs
lola: 55293732 markings, 69329163 edges, 295884 markings/sec, 185 secs
lola: 56716175 markings, 71092262 edges, 284489 markings/sec, 190 secs
lola: 58130392 markings, 72847698 edges, 282843 markings/sec, 195 secs
lola: 59527784 markings, 74581268 edges, 279478 markings/sec, 200 secs
lola: 60790670 markings, 76241549 edges, 252577 markings/sec, 205 secs
lola: 62052794 markings, 77906259 edges, 252425 markings/sec, 210 secs
lola: 63532632 markings, 79726787 edges, 295968 markings/sec, 215 secs
lola: 65001507 markings, 81522896 edges, 293775 markings/sec, 220 secs
lola: 66419270 markings, 83298526 edges, 283553 markings/sec, 225 secs
lola: 67847549 markings, 85079987 edges, 285656 markings/sec, 230 secs
lola: 69231650 markings, 86841697 edges, 276820 markings/sec, 235 secs
lola: 70598071 markings, 88609482 edges, 273284 markings/sec, 240 secs
lola: 71903769 markings, 90371290 edges, 261140 markings/sec, 245 secs
lola: 73138884 markings, 92203465 edges, 247023 markings/sec, 250 secs
lola: 74326504 markings, 94055507 edges, 237524 markings/sec, 255 secs
lola: 75493502 markings, 95832036 edges, 233400 markings/sec, 260 secs
lola: 76613475 markings, 97533492 edges, 223995 markings/sec, 265 secs
lola: 77776198 markings, 99396950 edges, 232545 markings/sec, 270 secs
lola: 79227303 markings, 101144588 edges, 290221 markings/sec, 275 secs
lola: 80703951 markings, 102863390 edges, 295330 markings/sec, 280 secs
lola: 82212589 markings, 104647181 edges, 301728 markings/sec, 285 secs
lola: 83718999 markings, 106416925 edges, 301282 markings/sec, 290 secs
lola: 85173533 markings, 108112744 edges, 290907 markings/sec, 295 secs
lola: 86654156 markings, 109833584 edges, 296125 markings/sec, 300 secs
lola: 88158421 markings, 111593688 edges, 300853 markings/sec, 305 secs
lola: 89710774 markings, 113427589 edges, 310471 markings/sec, 310 secs
lola: 91186720 markings, 115204666 edges, 295189 markings/sec, 315 secs
lola: 92674943 markings, 116992644 edges, 297645 markings/sec, 320 secs
lola: 94168841 markings, 118767021 edges, 298780 markings/sec, 325 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + 1 <= p103))) AND A (F ((1 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + 1 <= p103)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: state equation: write sara problem file to PermAdmissibility-COL-10-CTLCardinality-8.sara
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(NOT(E (F ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p181))))) AND NOT(A (F ((2 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p181)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 472 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: state equation: calling and running sara
lola: processed formula: NOT(A(TRUE U (2 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)))
lola: processed formula length: 75
lola: 11 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: try reading problem file PermAdmissibility-COL-10-CTLCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: 1606353 markings, 1725869 edges, 319620 markings/sec, 0 secs
lola: 3123677 markings, 3354400 edges, 303465 markings/sec, 5 secs
lola: 4665184 markings, 5027958 edges, 308301 markings/sec, 10 secs
lola: 6283636 markings, 6769796 edges, 323690 markings/sec, 15 secs
lola: 7823488 markings, 8424788 edges, 307970 markings/sec, 20 secs
lola: 9376946 markings, 10114690 edges, 310692 markings/sec, 25 secs
lola: 11041545 markings, 11907864 edges, 332920 markings/sec, 30 secs
lola: 12546688 markings, 13533457 edges, 301029 markings/sec, 35 secs
lola: 14019698 markings, 15133549 edges, 294602 markings/sec, 40 secs
lola: 15616766 markings, 16851887 edges, 319414 markings/sec, 45 secs
lola: 17199606 markings, 18575926 edges, 316568 markings/sec, 50 secs
lola: 18656024 markings, 20175694 edges, 291284 markings/sec, 55 secs
lola: 20246866 markings, 21904322 edges, 318168 markings/sec, 60 secs
lola: 21859832 markings, 23662455 edges, 322593 markings/sec, 65 secs
lola: 23396815 markings, 25356003 edges, 307397 markings/sec, 70 secs
lola: 24973842 markings, 27142503 edges, 315405 markings/sec, 75 secs
lola: 26423038 markings, 28825765 edges, 289839 markings/sec, 80 secs
lola: 27877494 markings, 30410250 edges, 290891 markings/sec, 85 secs
lola: 29261038 markings, 31945204 edges, 276709 markings/sec, 90 secs
lola: 30648917 markings, 33501799 edges, 277576 markings/sec, 95 secs
lola: 31966354 markings, 35017197 edges, 263487 markings/sec, 100 secs
lola: 33231052 markings, 36509214 edges, 252940 markings/sec, 105 secs
lola: 34716704 markings, 38198419 edges, 297130 markings/sec, 110 secs
lola: 36181574 markings, 39895340 edges, 292974 markings/sec, 115 secs
lola: 37651215 markings, 41571630 edges, 293928 markings/sec, 120 secs
lola: 39141271 markings, 43296884 edges, 298011 markings/sec, 125 secs
lola: 40697178 markings, 45063802 edges, 311181 markings/sec, 130 secs
lola: 42293370 markings, 46803107 edges, 319238 markings/sec, 135 secs
lola: 43889936 markings, 48555803 edges, 319313 markings/sec, 140 secs
lola: 45515163 markings, 50335806 edges, 325045 markings/sec, 145 secs
lola: 47021840 markings, 52031372 edges, 301335 markings/sec, 150 secs
lola: 48473314 markings, 53625792 edges, 290295 markings/sec, 155 secs
lola: 49838790 markings, 55192896 edges, 273095 markings/sec, 160 secs
lola: 51275881 markings, 56838645 edges, 287418 markings/sec, 165 secs
lola: 52709251 markings, 58466575 edges, 286674 markings/sec, 170 secs
lola: 54143423 markings, 60084590 edges, 286834 markings/sec, 175 secs
lola: 55549806 markings, 61700503 edges, 281277 markings/sec, 180 secs
lola: 56981030 markings, 63338118 edges, 286245 markings/sec, 185 secs
lola: 58514135 markings, 65052140 edges, 306621 markings/sec, 190 secs
lola: 60016046 markings, 66692877 edges, 300382 markings/sec, 195 secs
lola: 61460783 markings, 68276832 edges, 288947 markings/sec, 200 secs
lola: 63041687 markings, 70011287 edges, 316181 markings/sec, 205 secs
lola: 64579786 markings, 71721399 edges, 307620 markings/sec, 210 secs
lola: 66122949 markings, 73420379 edges, 308633 markings/sec, 215 secs
lola: 67622328 markings, 75096635 edges, 299876 markings/sec, 220 secs
lola: 69059132 markings, 76755583 edges, 287361 markings/sec, 225 secs
lola: 70398490 markings, 78320475 edges, 267872 markings/sec, 230 secs
lola: 71756795 markings, 79815595 edges, 271661 markings/sec, 235 secs
lola: 73104720 markings, 81314478 edges, 269585 markings/sec, 240 secs
lola: 74442666 markings, 82830477 edges, 267589 markings/sec, 245 secs
lola: 75736864 markings, 84347368 edges, 258840 markings/sec, 250 secs
lola: 76936341 markings, 85796142 edges, 239895 markings/sec, 255 secs
lola: 78339033 markings, 87409790 edges, 280538 markings/sec, 260 secs
lola: 79760027 markings, 89071938 edges, 284199 markings/sec, 265 secs
lola: 81201241 markings, 90741629 edges, 288243 markings/sec, 270 secs
lola: 82639516 markings, 92437659 edges, 287655 markings/sec, 275 secs
lola: 83985517 markings, 93990005 edges, 269200 markings/sec, 280 secs
lola: 85246851 markings, 95401581 edges, 252267 markings/sec, 285 secs
lola: 86481695 markings, 96837827 edges, 246969 markings/sec, 290 secs
lola: 87799917 markings, 98373100 edges, 263644 markings/sec, 295 secs
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: subprocess 10 will run for 421 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + 1 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)))
lola: processed formula length: 123
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1608797 markings, 1728447 edges, 3225752436249460736 markings/sec, 0 secs
lola: 3097980 markings, 3326967 edges, 297837 markings/sec, 5 secs
lola: 4637195 markings, 4998154 edges, 307843 markings/sec, 10 secs
lola: 6334470 markings, 6825440 edges, 339455 markings/sec, 15 secs
lola: 7904002 markings, 8510749 edges, 313906 markings/sec, 20 secs
lola: 9498367 markings, 10245126 edges, 318873 markings/sec, 25 secs
lola: 11199497 markings, 12081119 edges, 340226 markings/sec, 30 secs
lola: 12808964 markings, 13817533 edges, 321893 markings/sec, 35 secs
lola: 14365871 markings, 15511874 edges, 311381 markings/sec, 40 secs
lola: 15999790 markings, 17265480 edges, 326784 markings/sec, 45 secs
lola: 17575237 markings, 18981986 edges, 315089 markings/sec, 50 secs
lola: 19082359 markings, 20642331 edges, 301424 markings/sec, 55 secs
lola: 20649900 markings, 22346643 edges, 313508 markings/sec, 60 secs
lola: 22249121 markings, 24087513 edges, 319844 markings/sec, 65 secs
lola: 23782412 markings, 25785805 edges, 306658 markings/sec, 70 secs
lola: 25244317 markings, 27462182 edges, 292381 markings/sec, 75 secs
lola: 26624375 markings, 29042091 edges, 276012 markings/sec, 80 secs
lola: 28053813 markings, 30601992 edges, 285888 markings/sec, 85 secs
lola: 29385294 markings, 32083668 edges, 266296 markings/sec, 90 secs
lola: 30736385 markings, 33601332 edges, 270218 markings/sec, 95 secs
lola: 32058730 markings, 35124747 edges, 264469 markings/sec, 100 secs
lola: 33319046 markings, 36612922 edges, 252063 markings/sec, 105 secs
lola: 34762936 markings, 38251593 edges, 288778 markings/sec, 110 secs
lola: 36188977 markings, 39904043 edges, 285208 markings/sec, 115 secs
lola: 37604439 markings, 41518877 edges, 283092 markings/sec, 120 secs
lola: 39018348 markings, 43153418 edges, 282782 markings/sec, 125 secs
lola: 40567302 markings, 44912554 edges, 309791 markings/sec, 130 secs
lola: 42161961 markings, 46658758 edges, 318932 markings/sec, 135 secs
lola: 43736568 markings, 48386458 edges, 314921 markings/sec, 140 secs
lola: 45282574 markings, 50076388 edges, 309201 markings/sec, 145 secs
lola: 46714659 markings, 51696928 edges, 286417 markings/sec, 150 secs
lola: 48074313 markings, 53182881 edges, 271931 markings/sec, 155 secs
lola: 49430241 markings, 54713207 edges, 271186 markings/sec, 160 secs
lola: 50770887 markings, 56258972 edges, 268129 markings/sec, 165 secs
lola: 52232122 markings, 57920906 edges, 292247 markings/sec, 170 secs
lola: 53679173 markings, 59572557 edges, 289410 markings/sec, 175 secs
lola: 55038065 markings, 61116384 edges, 271778 markings/sec, 180 secs
lola: 56466659 markings, 62760020 edges, 285719 markings/sec, 185 secs
lola: 58011104 markings, 64511395 edges, 308889 markings/sec, 190 secs
lola: 59522826 markings, 66152732 edges, 302344 markings/sec, 195 secs
lola: 60982514 markings, 67751876 edges, 291938 markings/sec, 200 secs
lola: 62489036 markings, 69407320 edges, 301304 markings/sec, 205 secs
lola: 63933643 markings, 71004750 edges, 288921 markings/sec, 210 secs
lola: 65376993 markings, 72599215 edges, 288670 markings/sec, 215 secs
lola: 66847759 markings, 74223589 edges, 294153 markings/sec, 220 secs
lola: 68305579 markings, 75874736 edges, 291564 markings/sec, 225 secs
lola: 69639745 markings, 77464813 edges, 266833 markings/sec, 230 secs
lola: 70993872 markings, 78976438 edges, 270825 markings/sec, 235 secs
lola: 72334402 markings, 80457575 edges, 268106 markings/sec, 240 secs
lola: 73644809 markings, 81924009 edges, 262081 markings/sec, 245 secs
lola: 74946326 markings, 83413135 edges, 260303 markings/sec, 250 secs
lola: 76176361 markings, 84877108 edges, 246007 markings/sec, 255 secs
lola: 77450286 markings, 86393033 edges, 254785 markings/sec, 260 secs
lola: 78833085 markings, 87992129 edges, 276560 markings/sec, 265 secs
lola: 80282287 markings, 89671106 edges, 289840 markings/sec, 270 secs
lola: 81678694 markings, 91300139 edges, 279281 markings/sec, 275 secs
lola: 83074224 markings, 92941674 edges, 279106 markings/sec, 280 secs
lola: 84407257 markings, 94455005 edges, 266607 markings/sec, 285 secs
lola: 85643410 markings, 95868791 edges, 247231 markings/sec, 290 secs
lola: 86983953 markings, 97415702 edges, 268109 markings/sec, 295 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 445 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (G ((3 <= p153))) AND ((p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84 <= p67) OR (1 <= p206) OR (3 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34) OR (p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (NOT(A(TRUE U (p153 <= 2))) AND ((p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84 <= p67) OR (1 <= p206) OR (3 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34) OR (p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127))))
lola: processed formula length: 289
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 161 markings, 321 edges
lola: ========================================
lola: subprocess 12 will run for 556 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p68 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 44 markings, 43 edges
lola: ========================================
lola: subprocess 13 will run for 742 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25) OR (p26 <= p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U ((p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 <= 0) AND (p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + 1 <= p26)))))
lola: processed formula length: 150
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 167 markings, 473 edges
lola: ========================================
lola: subprocess 14 will run for 1113 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A (F ((3 <= p8))) AND (p154 <= 2)) OR ((p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + 1 <= p155) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))) OR NOT(((p172 <= 0) AND E (F ((2 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1113 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= p8)))
lola: processed formula: A (F ((3 <= p8)))
lola: processed formula length: 17
lola: 6 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 161 markings, 161 edges
lola: subprocess 15 will run for 2227 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + 1 <= p155) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + 1 <= p155) OR (2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))
lola: processed formula length: 118
lola: 6 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2227 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25) AND E (F ((2 <= p207)))) OR E (G ((1 <= p128)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2227 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + 1 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + 1 <= p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152)
lola: processed formula length: 108
lola: 9 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p128 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p128 <= 0)))
lola: processed formula: A (F ((p128 <= 0)))
lola: processed formula length: 19
lola: 9 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: state equation: write sara problem file to PermAdmissibility-COL-10-CTLCardinality-17.sara
lola: RESULT
lola:
SUMMARY: unknown unknown yes yes no no no unknown no unknown unknown no no yes unknown unknown
lola: ========================================
FORMULA PermAdmissibility-COL-10-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-COL-10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
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/PermAdmissibility-COL-10.tgz
mv PermAdmissibility-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 irma4mcc-structural"
echo " Input is PermAdmissibility-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 r115-csrt-152666474100451"
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 ;