About the Execution of Irma.struct for PermAdmissibility-COL-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4692.660 | 1420416.00 | 4273965.00 | 509.30 | TTTT?FTTTTTFT?TF | normal |
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 220K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K 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 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K 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 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 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 54K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PermAdmissibility-COL-20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-csrt-152666474100460
=====================================================================
--------------------
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-20-ReachabilityCardinality-00
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-01
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-02
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-03
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-04
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-05
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-06
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-07
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-08
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-09
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-10
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-11
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-12
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-13
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-14
FORMULA_NAME PermAdmissibility-COL-20-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1527153615940
BK_STOP 1527155036356
--------------------
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-20 as instance name.
Using PermAdmissibility as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': 2825433, 'Memory': 15952.65, 'Tool': 'lola'}, {'Time': 3540757, 'Memory': 15941.21, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola PermAdmissibility-COL-20...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PermAdmissibility-COL-20: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-20: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ PermAdmissibility-COL-20 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 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-20-ReachabilityCardinality.task
lola: A (G (((2 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83) OR (p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 <= p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115) OR ((1 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) AND (1 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33)) OR (2 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182)))) : E (F ((((p199 + 1 <= p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91) AND (p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 0)) OR ((p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + 1 <= p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148) AND (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + 1 <= p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91))))) : E (F (((p55 + 1 <= p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140) OR (p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + 1 <= p0) OR ((p157 <= 1) AND ((p43 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25) OR (3 <= p0)))))) : E (F ((((3 <= p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91) AND (p166 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174) AND (p56 <= p53)) OR ((p43 <= p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156) AND (3 <= p0) AND (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91))))) : A (G (((1 <= p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115) OR (p116 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190) OR (p57 + 1 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) OR ((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= p157) AND ((p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) OR (2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))))) : A (G (((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + 1 <= p59) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 <= 1) OR (p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + 1 <= p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148) OR (p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91 + 1 <= p43)))) : E (F (((p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + 1 <= p57) AND ((p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + 1 <= p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148) OR (p55 + 1 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83))))) : E (F ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + 1 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25))) : E (F (((p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 <= 1) AND (p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + 1 <= p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140) AND (p116 <= 0)))) : E (F ((((2 <= p42) AND (2 <= p166) AND ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107) OR (1 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))) OR (p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + 1 <= p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156)))) : E (F ((3 <= p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156))) : A (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= 2))) : E (F (((p0 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124) AND (1 <= p42) AND (p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p59) AND (p57 <= p42)))) : E (F (((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107) AND (p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 <= p199) AND (p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + 1 <= p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165) OR (2 <= p54) OR (2 <= p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91))))) : E (F (((3 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75)))) : A (G ((p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83) OR (p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 <= p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115) OR ((1 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) AND (1 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33)) OR (2 <= p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182))))
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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-20-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-20-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p199 + 1 <= p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91) AND (p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= 0)) OR ((p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + 1 <= p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148) AND (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + 1 <= p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91)))))
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 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 86 markings, 85 edges
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p55 + 1 <= p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140) OR (p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + 1 <= p0) OR ((p157 <= 1) AND ((p43 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25) OR (3 <= p0))))))
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: lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91) AND (p166 <= p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174) AND (p56 <= p53)) OR ((p43 <= p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156) AND (3 <= p0) AND (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91)))))
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
state equation: write sara problem file to PermAdmissibility-COL-20-ReachabilityCardinality.sara
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: ========================================
lola: state equation: calling and running sara
lola: state equation: write sara problem file to PermAdmissibility-COL-20-ReachabilityCardinality-3.sara
sara: try reading problem file PermAdmissibility-COL-20-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115) OR (p116 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190) OR (p57 + 1 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) OR ((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= p157) AND ((p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) OR (2 <= p10 ... (shortened)
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 9 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-20-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-20-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 258545 markings, 315559 edges, 51709 markings/sec, 0 secs
lola: sara is running 5 secs || 515595 markings, 637565 edges, 51410 markings/sec, 5 secs
lola: sara is running 10 secs || 701320 markings, 871971 edges, 37145 markings/sec, 10 secs
lola: sara is running 15 secs || 954099 markings, 1192402 edges, 50556 markings/sec, 15 secs
lola: sara is running 20 secs || 1212986 markings, 1521948 edges, 51777 markings/sec, 20 secs
lola: sara is running 25 secs || 1452828 markings, 1826491 edges, 47968 markings/sec, 25 secs
lola: sara is running 30 secs || 1728895 markings, 2178307 edges, 55213 markings/sec, 30 secs
lola: sara is running 35 secs || 1910930 markings, 2411436 edges, 36407 markings/sec, 35 secs
lola: sara is running 40 secs || 2062183 markings, 2603515 edges, 30251 markings/sec, 40 secs
lola: sara is running 45 secs || 2204935 markings, 2786088 edges, 28550 markings/sec, 45 secs
lola: sara is running 50 secs || 2374250 markings, 3001571 edges, 33863 markings/sec, 50 secs
lola: sara is running 55 secs || 2623834 markings, 3319341 edges, 49917 markings/sec, 55 secs
lola: sara is running 60 secs || 2886716 markings, 3656393 edges, 52576 markings/sec, 60 secs
lola: sara is running 65 secs || 3144606 markings, 3986197 edges, 51578 markings/sec, 65 secs
lola: sara is running 70 secs || 3401761 markings, 4312607 edges, 51431 markings/sec, 70 secs
lola: sara is running 75 secs || 3660695 markings, 4642927 edges, 51787 markings/sec, 75 secs
lola: sara is running 80 secs || 3909689 markings, 4963706 edges, 49799 markings/sec, 80 secs
lola: sara is running 85 secs || 4104244 markings, 5208447 edges, 38911 markings/sec, 85 secs
lola: sara is running 90 secs || 4375452 markings, 5556889 edges, 54242 markings/sec, 90 secs
lola: sara is running 95 secs || 4644589 markings, 5901098 edges, 53827 markings/sec, 95 secs
lola: sara is running 100 secs || 4901463 markings, 6226755 edges, 51375 markings/sec, 100 secs
lola: sara is running 105 secs || 5155642 markings, 6552443 edges, 50836 markings/sec, 105 secs
lola: sara is running 110 secs || 5408479 markings, 6875979 edges, 50567 markings/sec, 110 secs
lola: sara is running 115 secs || 5665118 markings, 7196685 edges, 51328 markings/sec, 115 secs
lola: sara is running 120 secs || 5925962 markings, 7525260 edges, 52169 markings/sec, 120 secs
lola: sara is running 125 secs || 6177752 markings, 7847368 edges, 50358 markings/sec, 125 secs
lola: sara is running 130 secs || 6432801 markings, 8172814 edges, 51010 markings/sec, 130 secs
lola: sara is running 135 secs || 6698102 markings, 8514960 edges, 53060 markings/sec, 135 secs
lola: sara is running 140 secs || 6956397 markings, 8847157 edges, 51659 markings/sec, 140 secs
lola: sara is running 145 secs || 7222497 markings, 9191265 edges, 53220 markings/sec, 145 secs
lola: sara is running 150 secs || 7491291 markings, 9537328 edges, 53759 markings/sec, 150 secs
lola: sara is running 155 secs || 7756033 markings, 9880647 edges, 52948 markings/sec, 155 secs
lola: sara is running 160 secs || 8023962 markings, 10225089 edges, 53586 markings/sec, 160 secs
lola: sara is running 165 secs || 8292851 markings, 10571533 edges, 53778 markings/sec, 165 secs
lola: sara is running 170 secs || 8560902 markings, 10916306 edges, 53610 markings/sec, 170 secs
lola: sara is running 175 secs || 8818105 markings, 11249488 edges, 51441 markings/sec, 175 secs
lola: sara is running 180 secs || 9069925 markings, 11575850 edges, 50364 markings/sec, 180 secs
lola: sara is running 185 secs || 9323951 markings, 11901538 edges, 50805 markings/sec, 185 secs
lola: sara is running 190 secs || 9586795 markings, 12240456 edges, 52569 markings/sec, 190 secs
lola: sara is running 195 secs || 9837153 markings, 12566882 edges, 50072 markings/sec, 195 secs
lola: sara is running 200 secs || 10091619 markings, 12892756 edges, 50893 markings/sec, 200 secs
lola: sara is running 205 secs || 10345231 markings, 13218444 edges, 50722 markings/sec, 205 secs
lola: sara is running 210 secs || 10612046 markings, 13566025 edges, 53363 markings/sec, 210 secs
lola: sara is running 215 secs || 10889251 markings, 13920893 edges, 55441 markings/sec, 215 secs
lola: sara is running 220 secs || 11167183 markings, 14282167 edges, 55586 markings/sec, 220 secs
lola: sara is running 225 secs || 11425802 markings, 14646200 edges, 51724 markings/sec, 225 secs
lola: sara is running 230 secs || 11686265 markings, 15019913 edges, 52093 markings/sec, 230 secs
lola: sara is running 235 secs || 11927511 markings, 15365155 edges, 48249 markings/sec, 235 secs
lola: sara is running 240 secs || 12167579 markings, 15713561 edges, 48014 markings/sec, 240 secs
lola: sara is running 245 secs || 12406985 markings, 16058594 edges, 47881 markings/sec, 245 secs
lola: sara is running 250 secs || 12646886 markings, 16405563 edges, 47980 markings/sec, 250 secs
lola: sara is running 255 secs || 12888752 markings, 16754174 edges, 48373 markings/sec, 255 secs
lola: sara is running 260 secs || 13143722 markings, 17121079 edges, 50994 markings/sec, 260 secs
lola: sara is running 265 secs || 13381053 markings, 17462480 edges, 47466 markings/sec, 265 secs
lola: sara is running 270 secs || 13621351 markings, 17808136 edges, 48060 markings/sec, 270 secs
lola: sara is running 275 secs || 13857032 markings, 18146419 edges, 47136 markings/sec, 275 secs
lola: sara is running 280 secs || 14097563 markings, 18494673 edges, 48106 markings/sec, 280 secs
lola: sara is running 285 secs || 14340403 markings, 18841685 edges, 48568 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + 1 <= p59) OR (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 <= 1) OR (p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + 1 <= p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148) OR (p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91 + 1 <= p43))))
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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-20-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-20-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 52 markings, 51 edges
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + 1 <= p57) AND ((p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + 1 <= p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148) OR (p55 + 1 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83)))))
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 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-20-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-20-ReachabilityCardinality-6.sara.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + 1 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25)))
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: state equation: write sara problem file to PermAdmissibility-COL-20-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 131 markings, 130 edges
lola: ========================================
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 <= 1) AND (p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + 1 <= p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140) AND (p116 <= 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: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-20-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p42) AND (2 <= p166) AND ((2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107) OR (1 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))) OR (p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + 1 <= p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156))))
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 7 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: state equation: write sara problem file to PermAdmissibility-COL-20-ReachabilityCardinality-9.sara
lola: ========================================
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156)))
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: state equation: write sara problem file to PermAdmissibility-COL-20-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 11 will run for 648 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: state equation: write sara problem file to PermAdmissibility-COL-20-ReachabilityCardinality-11.sara
lola: ========================================
lola: subprocess 12 will run for 811 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p0 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124) AND (1 <= p42) AND (p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + 1 <= p59) AND (p57 <= p42))))
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-20-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 13 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107) AND (p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 <= p199) AND (p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + 1 <= p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99) AND ((p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165) OR (2 <= p54) OR (2 <= p90 + p89 + p88 + p87 + ... (shortened)
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 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-20-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-20-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 116012 markings, 333700 edges, 23202 markings/sec, 0 secs
lola: sara is running 5 secs || 239128 markings, 704660 edges, 24623 markings/sec, 5 secs
lola: sara is running 10 secs || 350752 markings, 1156762 edges, 22325 markings/sec, 10 secs
lola: sara is running 15 secs || 457062 markings, 1610605 edges, 21262 markings/sec, 15 secs
lola: sara is running 20 secs || 562803 markings, 2052972 edges, 21148 markings/sec, 20 secs
lola: sara is running 25 secs || 659533 markings, 2431266 edges, 19346 markings/sec, 25 secs
lola: sara is running 30 secs || 777894 markings, 2792429 edges, 23672 markings/sec, 30 secs
lola: sara is running 35 secs || 885327 markings, 3175792 edges, 21487 markings/sec, 35 secs
lola: sara is running 40 secs || 998676 markings, 3521543 edges, 22670 markings/sec, 40 secs
lola: sara is running 45 secs || 1078899 markings, 3896498 edges, 16045 markings/sec, 45 secs
lola: sara is running 50 secs || 1157413 markings, 4211270 edges, 15703 markings/sec, 50 secs
lola: sara is running 55 secs || 1243724 markings, 4632056 edges, 17262 markings/sec, 55 secs
lola: sara is running 60 secs || 1348455 markings, 5105887 edges, 20946 markings/sec, 60 secs
lola: sara is running 65 secs || 1449307 markings, 5561562 edges, 20170 markings/sec, 65 secs
lola: sara is running 70 secs || 1555306 markings, 5951735 edges, 21200 markings/sec, 70 secs
lola: sara is running 75 secs || 1660372 markings, 6366991 edges, 21013 markings/sec, 75 secs
lola: sara is running 80 secs || 1761873 markings, 6846891 edges, 20300 markings/sec, 80 secs
lola: sara is running 85 secs || 1866027 markings, 7260691 edges, 20831 markings/sec, 85 secs
lola: sara is running 90 secs || 1968934 markings, 7699906 edges, 20581 markings/sec, 90 secs
lola: sara is running 95 secs || 2073011 markings, 8130193 edges, 20815 markings/sec, 95 secs
lola: sara is running 100 secs || 2174573 markings, 8595994 edges, 20312 markings/sec, 100 secs
lola: sara is running 105 secs || 2277771 markings, 9015968 edges, 20640 markings/sec, 105 secs
lola: sara is running 110 secs || 2392156 markings, 9335304 edges, 22877 markings/sec, 110 secs
lola: sara is running 115 secs || 2497605 markings, 9755603 edges, 21090 markings/sec, 115 secs
lola: sara is running 120 secs || 2607873 markings, 10112708 edges, 22054 markings/sec, 120 secs
lola: sara is running 125 secs || 2712015 markings, 10541349 edges, 20828 markings/sec, 125 secs
lola: sara is running 130 secs || 2814607 markings, 11000526 edges, 20518 markings/sec, 130 secs
lola: sara is running 135 secs || 2918446 markings, 11451461 edges, 20768 markings/sec, 135 secs
lola: sara is running 140 secs || 3026749 markings, 11869426 edges, 21661 markings/sec, 140 secs
lola: sara is running 145 secs || 3136303 markings, 12298270 edges, 21911 markings/sec, 145 secs
lola: sara is running 150 secs || 3244453 markings, 12732029 edges, 21630 markings/sec, 150 secs
lola: sara is running 155 secs || 3351676 markings, 13149352 edges, 21445 markings/sec, 155 secs
lola: sara is running 160 secs || 3463506 markings, 13526444 edges, 22366 markings/sec, 160 secs
lola: sara is running 165 secs || 3570011 markings, 13913647 edges, 21301 markings/sec, 165 secs
lola: sara is running 170 secs || 3674968 markings, 14315397 edges, 20991 markings/sec, 170 secs
lola: sara is running 175 secs || 3779788 markings, 14734006 edges, 20964 markings/sec, 175 secs
lola: sara is running 180 secs || 3882843 markings, 15154105 edges, 20611 markings/sec, 180 secs
lola: sara is running 185 secs || 3991056 markings, 15556442 edges, 21643 markings/sec, 185 secs
lola: sara is running 190 secs || 4096314 markings, 15966037 edges, 21052 markings/sec, 190 secs
lola: sara is running 195 secs || 4202472 markings, 16388778 edges, 21232 markings/sec, 195 secs
lola: sara is running 200 secs || 4305364 markings, 16801241 edges, 20578 markings/sec, 200 secs
lola: sara is running 205 secs || 4412859 markings, 17251850 edges, 21499 markings/sec, 205 secs
lola: sara is running 210 secs || 4525367 markings, 17634768 edges, 22502 markings/sec, 210 secs
lola: sara is running 215 secs || 4647127 markings, 17897671 edges, 24352 markings/sec, 215 secs
lola: sara is running 220 secs || 4757900 markings, 18271314 edges, 22155 markings/sec, 220 secs
lola: sara is running 225 secs || 4868359 markings, 18658179 edges, 22092 markings/sec, 225 secs
lola: sara is running 230 secs || 4971125 markings, 19069343 edges, 20553 markings/sec, 230 secs
lola: sara is running 235 secs || 5075074 markings, 19537170 edges, 20790 markings/sec, 235 secs
lola: sara is running 240 secs || 5179777 markings, 19990748 edges, 20941 markings/sec, 240 secs
lola: sara is running 245 secs || 5283740 markings, 20402894 edges, 20793 markings/sec, 245 secs
lola: sara is running 250 secs || 5390641 markings, 20830290 edges, 21380 markings/sec, 250 secs
lola: sara is running 255 secs || 5497512 markings, 21271332 edges, 21374 markings/sec, 255 secs
lola: sara is running 260 secs || 5610645 markings, 21679830 edges, 22627 markings/sec, 260 secs
lola: sara is running 265 secs || 5719483 markings, 22109627 edges, 21768 markings/sec, 265 secs
lola: sara is running 270 secs || 5830135 markings, 22548556 edges, 22130 markings/sec, 270 secs
lola: sara is running 275 secs || 5940613 markings, 23004797 edges, 22096 markings/sec, 275 secs
lola: sara is running 280 secs || 6049664 markings, 23412842 edges, 21810 markings/sec, 280 secs
lola: sara is running 285 secs || 6156613 markings, 23796380 edges, 21390 markings/sec, 285 secs
lola: sara is running 290 secs || 6267785 markings, 24151642 edges, 22234 markings/sec, 290 secs
lola: sara is running 295 secs || 6375097 markings, 24548208 edges, 21462 markings/sec, 295 secs
lola: sara is running 300 secs || 6478599 markings, 24987439 edges, 20700 markings/sec, 300 secs
lola: sara is running 305 secs || 6585218 markings, 25428454 edges, 21324 markings/sec, 305 secs
lola: sara is running 310 secs || 6690733 markings, 25811988 edges, 21103 markings/sec, 310 secs
lola: sara is running 315 secs || 6795622 markings, 26249249 edges, 20978 markings/sec, 315 secs
lola: sara is running 320 secs || 6900408 markings, 26681774 edges, 20957 markings/sec, 320 secs
lola: sara is running 325 secs || 7003732 markings, 27110945 edges, 20665 markings/sec, 325 secs
lola: sara is running 330 secs || 7109584 markings, 27544296 edges, 21170 markings/sec, 330 secs
lola: sara is running 335 secs || 7216083 markings, 27968772 edges, 21300 markings/sec, 335 secs
lola: sara is running 340 secs || 7318525 markings, 28449076 edges, 20488 markings/sec, 340 secs
lola: sara is running 345 secs || 7425216 markings, 28932308 edges, 21338 markings/sec, 345 secs
lola: sara is running 350 secs || 7535539 markings, 29333449 edges, 22065 markings/sec, 350 secs
lola: sara is running 355 secs || 7640447 markings, 29764257 edges, 20982 markings/sec, 355 secs
lola: sara is running 360 secs || 7749631 markings, 30194778 edges, 21837 markings/sec, 360 secs
lola: sara is running 365 secs || 7857258 markings, 30688738 edges, 21525 markings/sec, 365 secs
lola: sara is running 370 secs || 7963131 markings, 31109316 edges, 21175 markings/sec, 370 secs
lola: sara is running 375 secs || 8068022 markings, 31573757 edges, 20978 markings/sec, 375 secs
lola: sara is running 380 secs || 8180678 markings, 32003444 edges, 22531 markings/sec, 380 secs
lola: sara is running 385 secs || 8285822 markings, 32436389 edges, 21029 markings/sec, 385 secs
lola: sara is running 390 secs || 8389704 markings, 32844960 edges, 20776 markings/sec, 390 secs
lola: sara is running 395 secs || 8493545 markings, 33237041 edges, 20768 markings/sec, 395 secs
lola: sara is running 400 secs || 8601389 markings, 33664779 edges, 21569 markings/sec, 400 secs
lola: sara is running 405 secs || 8712294 markings, 34143813 edges, 22181 markings/sec, 405 secs
lola: sara is running 410 secs || 8825358 markings, 34605812 edges, 22613 markings/sec, 410 secs
lola: sara is running 415 secs || 8935507 markings, 35040498 edges, 22030 markings/sec, 415 secs
lola: sara is running 420 secs || 9047743 markings, 35437435 edges, 22447 markings/sec, 420 secs
lola: sara is running 425 secs || 9156628 markings, 35906298 edges, 21777 markings/sec, 425 secs
lola: sara is running 430 secs || 9264522 markings, 36334337 edges, 21579 markings/sec, 430 secs
lola: sara is running 435 secs || 9370834 markings, 36757772 edges, 21262 markings/sec, 435 secs
lola: sara is running 440 secs || 9479016 markings, 37218721 edges, 21636 markings/sec, 440 secs
lola: sara is running 445 secs || 9591010 markings, 37664295 edges, 22399 markings/sec, 445 secs
lola: sara is running 450 secs || 9693914 markings, 38077486 edges, 20581 markings/sec, 450 secs
lola: sara is running 455 secs || 9797525 markings, 38490333 edges, 20722 markings/sec, 455 secs
lola: sara is running 460 secs || 9904236 markings, 38865724 edges, 21342 markings/sec, 460 secs
lola: sara is running 465 secs || 10014057 markings, 39269052 edges, 21964 markings/sec, 465 secs
lola: sara is running 470 secs || 10117118 markings, 39715651 edges, 20612 markings/sec, 470 secs
lola: sara is running 475 secs || 10221208 markings, 40143482 edges, 20818 markings/sec, 475 secs
lola: sara is running 480 secs || 10327544 markings, 40529535 edges, 21267 markings/sec, 480 secs
lola: sara is running 485 secs || 10430105 markings, 40953127 edges, 20512 markings/sec, 485 secs
lola: sara is running 490 secs || 10536693 markings, 41368261 edges, 21318 markings/sec, 490 secs
lola: sara is running 495 secs || 10619170 markings, 41706575 edges, 16495 markings/sec, 495 secs
lola: sara is running 500 secs || 10710968 markings, 42093607 edges, 18360 markings/sec, 500 secs
lola: sara is running 505 secs || 10798621 markings, 42403019 edges, 17531 markings/sec, 505 secs
lola: sara is running 510 secs || 10904800 markings, 42776032 edges, 21236 markings/sec, 510 secs
lola: sara is running 515 secs || 11007936 markings, 43185685 edges, 20627 markings/sec, 515 secs
lola: sara is running 520 secs || 11111831 markings, 43587939 edges, 20779 markings/sec, 520 secs
lola: sara is running 525 secs || 11216738 markings, 43997621 edges, 20981 markings/sec, 525 secs
lola: sara is running 530 secs || 11320146 markings, 44422101 edges, 20682 markings/sec, 530 secs
lola: sara is running 535 secs || 11424408 markings, 44845087 edges, 20852 markings/sec, 535 secs
lola: sara is running 540 secs || 11528199 markings, 45302499 edges, 20758 markings/sec, 540 secs
lola: sara is running 545 secs || 11630609 markings, 45737461 edges, 20482 markings/sec, 545 secs
lola: sara is running 550 secs || 11730838 markings, 46178083 edges, 20046 markings/sec, 550 secs
lola: sara is running 555 secs || 11834846 markings, 46603378 edges, 20802 markings/sec, 555 secs
lola: sara is running 560 secs || 11942583 markings, 47055825 edges, 21547 markings/sec, 560 secs
lola: sara is running 565 secs || 12048600 markings, 47509920 edges, 21203 markings/sec, 565 secs
lola: sara is running 570 secs || 12153790 markings, 47915184 edges, 21038 markings/sec, 570 secs
lola: sara is running 575 secs || 12256365 markings, 48338255 edges, 20515 markings/sec, 575 secs
lola: sara is running 580 secs || 12357479 markings, 48736791 edges, 20223 markings/sec, 580 secs
lola: sara is running 585 secs || 12464129 markings, 49133465 edges, 21330 markings/sec, 585 secs
lola: sara is running 590 secs || 12565817 markings, 49541432 edges, 20338 markings/sec, 590 secs
lola: sara is running 595 secs || 12666144 markings, 49928517 edges, 20065 markings/sec, 595 secs
lola: sara is running 600 secs || 12766303 markings, 50383931 edges, 20032 markings/sec, 600 secs
lola: sara is running 605 secs || 12871946 markings, 50766347 edges, 21129 markings/sec, 605 secs
lola: sara is running 610 secs || 12979867 markings, 51213002 edges, 21584 markings/sec, 610 secs
lola: sara is running 615 secs || 13084965 markings, 51621375 edges, 21020 markings/sec, 615 secs
lola: sara is running 620 secs || 13187485 markings, 52039631 edges, 20504 markings/sec, 620 secs
lola: sara is running 625 secs || 13294748 markings, 52506001 edges, 21453 markings/sec, 625 secs
lola: sara is running 630 secs || 13407778 markings, 52950135 edges, 22606 markings/sec, 630 secs
lola: sara is running 635 secs || 13515638 markings, 53375192 edges, 21572 markings/sec, 635 secs
lola: sara is running 640 secs || 13620542 markings, 53845593 edges, 20981 markings/sec, 640 secs
lola: sara is running 645 secs || 13723400 markings, 54296796 edges, 20572 markings/sec, 645 secs
lola: sara is running 650 secs || 13828865 markings, 54737762 edges, 21093 markings/sec, 650 secs
lola: sara is running 655 secs || 13929712 markings, 55177027 edges, 20169 markings/sec, 655 secs
lola: sara is running 660 secs || 14037617 markings, 55599501 edges, 21581 markings/sec, 660 secs
lola: sara is running 665 secs || 14144825 markings, 56050811 edges, 21442 markings/sec, 665 secs
lola: sara is running 670 secs || 14251924 markings, 56501563 edges, 21420 markings/sec, 670 secs
lola: sara is running 675 secs || 14354776 markings, 56917754 edges, 20570 markings/sec, 675 secs
lola: sara is running 680 secs || 14459151 markings, 57356971 edges, 20875 markings/sec, 680 secs
lola: sara is running 685 secs || 14562726 markings, 57776016 edges, 20715 markings/sec, 685 secs
lola: sara is running 690 secs || 14663528 markings, 58187595 edges, 20160 markings/sec, 690 secs
lola: sara is running 695 secs || 14762048 markings, 58632791 edges, 19704 markings/sec, 695 secs
lola: sara is running 700 secs || 14864160 markings, 59069289 edges, 20422 markings/sec, 700 secs
lola: sara is running 705 secs || 14963573 markings, 59518321 edges, 19883 markings/sec, 705 secs
lola: sara is running 710 secs || 15064635 markings, 59968289 edges, 20212 markings/sec, 710 secs
lola: sara is running 715 secs || 15165813 markings, 60429503 edges, 20236 markings/sec, 715 secs
lola: sara is running 720 secs || 15266292 markings, 60897887 edges, 20096 markings/sec, 720 secs
lola: sara is running 725 secs || 15378588 markings, 61474365 edges, 22459 markings/sec, 725 secs
lola: sara is running 730 secs || 15487189 markings, 61911460 edges, 21720 markings/sec, 730 secs
lola: sara is running 735 secs || 15592988 markings, 62254237 edges, 21160 markings/sec, 735 secs
lola: sara is running 740 secs || 15691948 markings, 62603851 edges, 19792 markings/sec, 740 secs
lola: sara is running 745 secs || 15799892 markings, 62972261 edges, 21589 markings/sec, 745 secs
lola: sara is running 750 secs || 15901931 markings, 63389536 edges, 20408 markings/sec, 750 secs
lola: sara is running 755 secs || 16001314 markings, 63835347 edges, 19877 markings/sec, 755 secs
lola: sara is running 760 secs || 16104298 markings, 64252315 edges, 20597 markings/sec, 760 secs
lola: sara is running 765 secs || 16205037 markings, 64697278 edges, 20148 markings/sec, 765 secs
lola: sara is running 770 secs || 16308865 markings, 65077376 edges, 20766 markings/sec, 770 secs
lola: sara is running 775 secs || 16387989 markings, 65423761 edges, 15825 markings/sec, 775 secs
lola: sara is running 780 secs || 16484135 markings, 65851316 edges, 19229 markings/sec, 780 secs
lola: sara is running 785 secs || 16587506 markings, 66244141 edges, 20674 markings/sec, 785 secs
lola: sara is running 790 secs || 16691072 markings, 66650657 edges, 20713 markings/sec, 790 secs
lola: sara is running 795 secs || 16793551 markings, 67073521 edges, 20496 markings/sec, 795 secs
lola: sara is running 800 secs || 16898176 markings, 67489645 edges, 20925 markings/sec, 800 secs
lola: sara is running 805 secs || 16999736 markings, 67901077 edges, 20312 markings/sec, 805 secs
lola: sara is running 810 secs || 17098545 markings, 68337555 edges, 19762 markings/sec, 810 secs
lola: sara is running 815 secs || 17200339 markings, 68789176 edges, 20359 markings/sec, 815 secs
lola: sara is running 820 secs || 17302227 markings, 69205231 edges, 20378 markings/sec, 820 secs
lola: sara is running 825 secs || 17403809 markings, 69643590 edges, 20316 markings/sec, 825 secs
lola: sara is running 830 secs || 17506684 markings, 70038378 edges, 20575 markings/sec, 830 secs
lola: sara is running 835 secs || 17608098 markings, 70449700 edges, 20283 markings/sec, 835 secs
lola: sara is running 840 secs || 17708980 markings, 70855950 edges, 20176 markings/sec, 840 secs
lola: sara is running 845 secs || 17808463 markings, 71286455 edges, 19897 markings/sec, 845 secs
lola: sara is running 850 secs || 17912861 markings, 71678395 edges, 20880 markings/sec, 850 secs
lola: sara is running 855 secs || 18012991 markings, 72120424 edges, 20026 markings/sec, 855 secs
lola: sara is running 860 secs || 18113869 markings, 72541356 edges, 20176 markings/sec, 860 secs
lola: sara is running 865 secs || 18216061 markings, 72960260 edges, 20438 markings/sec, 865 secs
lola: sara is running 870 secs || 18319450 markings, 73399579 edges, 20678 markings/sec, 870 secs
lola: sara is running 875 secs || 18424479 markings, 73849710 edges, 21006 markings/sec, 875 secs
lola: sara is running 880 secs || 18527103 markings, 74303214 edges, 20525 markings/sec, 880 secs
lola: sara is running 885 secs || 18621940 markings, 74689098 edges, 18967 markings/sec, 885 secs
lola: sara is running 890 secs || 18710992 markings, 75080923 edges, 17810 markings/sec, 890 secs
lola: sara is running 895 secs || 18808948 markings, 75527618 edges, 19591 markings/sec, 895 secs
lola: sara is running 900 secs || 18886502 markings, 75833612 edges, 15511 markings/sec, 900 secs
lola: sara is running 905 secs || 18949700 markings, 76085794 edges, 12640 markings/sec, 905 secs
lola: sara is running 910 secs || 19035580 markings, 76410510 edges, 17176 markings/sec, 910 secs
lola: sara is running 915 secs || 19128025 markings, 76798277 edges, 18489 markings/sec, 915 secs
lola: sara is running 920 secs || 19201063 markings, 77094308 edges, 14608 markings/sec, 920 secs
lola: sara is running 925 secs || 19293897 markings, 77451216 edges, 18567 markings/sec, 925 secs
lola: sara is running 930 secs || 19396250 markings, 77886085 edges, 20471 markings/sec, 930 secs
lola: sara is running 935 secs || 19507065 markings, 78263118 edges, 22163 markings/sec, 935 secs
lola: sara is running 940 secs || 19608432 markings, 78653212 edges, 20273 markings/sec, 940 secs
lola: sara is running 945 secs || 19711417 markings, 79039496 edges, 20597 markings/sec, 945 secs
lola: sara is running 950 secs || 19814075 markings, 79423063 edges, 20532 markings/sec, 950 secs
lola: sara is running 955 secs || 19903115 markings, 79844858 edges, 17808 markings/sec, 955 secs
lola: sara is running 960 secs || 19980735 markings, 80180368 edges, 15524 markings/sec, 960 secs
lola: sara is running 965 secs || 20055741 markings, 80481002 edges, 15001 markings/sec, 965 secs
lola: sara is running 970 secs || 20125444 markings, 80778118 edges, 13941 markings/sec, 970 secs
lola: sara is running 975 secs || 20184916 markings, 81007398 edges, 11894 markings/sec, 975 secs
lola: sara is running 980 secs || 20246661 markings, 81283462 edges, 12349 markings/sec, 980 secs
lola: sara is running 985 secs || 20319783 markings, 81601424 edges, 14624 markings/sec, 985 secs
lola: sara is running 990 secs || 20409604 markings, 81924746 edges, 17964 markings/sec, 990 secs
lola: sara is running 995 secs || 20477776 markings, 82183609 edges, 13634 markings/sec, 995 secs
lola: sara is running 1000 secs || 20567596 markings, 82555897 edges, 17964 markings/sec, 1000 secs
lola: sara is running 1005 secs || 20618650 markings, 82764202 edges, 10211 markings/sec, 1005 secs
lola: sara is running 1010 secs || 20670611 markings, 82959449 edges, 10392 markings/sec, 1010 secs
lola: sara is running 1015 secs || 20722912 markings, 83166578 edges, 10460 markings/sec, 1015 secs
lola: sara is running 1020 secs || 20774907 markings, 83403131 edges, 10399 markings/sec, 1020 secs
lola: sara is running 1025 secs || 20829161 markings, 83666001 edges, 10851 markings/sec, 1025 secs
lola: sara is running 1030 secs || 20883997 markings, 83896615 edges, 10967 markings/sec, 1030 secs
lola: sara is running 1035 secs || 20938302 markings, 84135847 edges, 10861 markings/sec, 1035 secs
lola: sara is running 1040 secs || 20992207 markings, 84402731 edges, 10781 markings/sec, 1040 secs
lola: sara is running 1045 secs || 21047676 markings, 84626956 edges, 11094 markings/sec, 1045 secs
lola: sara is running 1050 secs || 21098997 markings, 84873542 edges, 10264 markings/sec, 1050 secs
lola: sara is running 1055 secs || 21149708 markings, 85096332 edges, 10142 markings/sec, 1055 secs
lola: sara is running 1060 secs || 21202172 markings, 85304290 edges, 10493 markings/sec, 1060 secs
lola: sara is running 1065 secs || 21284345 markings, 85672356 edges, 16435 markings/sec, 1065 secs
lola: sara is running 1070 secs || 21396261 markings, 86120487 edges, 22383 markings/sec, 1070 secs
lola: sara is running 1075 secs || 21502462 markings, 86541873 edges, 21240 markings/sec, 1075 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75))))
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: state equation: write sara problem file to PermAdmissibility-COL-20-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 75 markings, 74 edges
lola: ========================================
lola: subprocess 15 will run for 2163 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75)))
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: 23 markings, 22 edges
lola: state equation: write sara problem file to PermAdmissibility-COL-20-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file PermAdmissibility-COL-20-ReachabilityCardinality-15.sara.
lola: RESULT
lola:
SUMMARY: yes yes yes yes unknown no yes yes yes yes yes no yes unknown yes no
sara: place or transition ordering is non-deterministic
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----
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-20"
export BK_EXAMINATION="ReachabilityCardinality"
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-20.tgz
mv PermAdmissibility-COL-20 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-20, examination is ReachabilityCardinality"
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-152666474100460"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '
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 ;