fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r031-ebro-152646309300215
Last Updated
June 26, 2018

About the Execution of Irma.struct for BridgeAndVehicles-COL-V80P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
811.450 932709.00 1790985.00 311.50 FTTTTTTTFTFF?TFT 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 4.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K 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 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 122 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 360 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_pt
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 45K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is BridgeAndVehicles-COL-V80P20N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-ebro-152646309300215
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526819934824


BK_STOP 1526820867533

--------------------
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 BridgeAndVehicles-COL-V80P20N10 as instance name.
Using BridgeAndVehicles 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': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 2621763, 'Memory': 1500.81, 'Tool': 'lola'}, {'Time': 2622123, 'Memory': 2043.38, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola BridgeAndVehicles-COL-V80P20N10...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
BridgeAndVehicles-COL-V80P20N10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-COL-V80P20N10: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ BridgeAndVehicles-COL-V80P20N10 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 2296/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 188 places, 2108 transitions, 181 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2613 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality.task
lola: A (G (((1 <= p187) OR (p96 + p97 <= p183 + p184)))) : A (G (((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p98 + p99) OR (p96 + p97 + 1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p98 + p99) OR ((1 <= p2) AND (p1 <= p2) AND ((p84 <= p186) OR (p183 + p184 <= p187)))))) : A (G ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p98 + p99))) : E (F (((3 <= p183 + p184) OR (p0 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p98 + p99)))) : E (F ((((p2 <= p185) OR (3 <= p96 + p97)) AND (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p98 + p99 <= p96 + p97) AND (p187 <= p185) AND (1 <= p180) AND (3 <= p2)))) : A (G ((p181 + p182 <= 1))) : E (F (((p187 <= p179) AND (3 <= p180)))) : E (F (((3 <= p1) AND (p186 <= p180) AND ((3 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83) OR (1 <= p180)) AND ((p96 + p97 <= 0) OR (p2 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p98 + p99))))) : E (F ((((p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= 0) AND (p94 + p93 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p95 <= 0)) OR ((p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 <= p0) AND (3 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83) AND (p1 + 1 <= p96 + p97))))) : E (F ((((p180 <= 2) AND (p0 + 1 <= p183 + p184)) OR (p0 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83)))) : E (F ((2 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83))) : E (F ((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p98 + p99))) : E (F ((p2 <= 2))) : E (F ((p0 <= 2))) : A (G ((p84 <= p0))) : A (G (((1 <= p185) OR (p181 + p182 <= 1) OR (3 <= p1))))
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 (((1 <= p187) OR (p96 + p97 <= p183 + p184))))
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 724 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 82 markings, 81 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p1... (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 724 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 10 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality.sara
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p15... (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 724 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 invariant.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2.sara
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p183 + p184) OR (p0 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 +... (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 724 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 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 80 markings, 79 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p2 <= p185) OR (3 <= p96 + p97)) AND (p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p1... (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 724 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 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 137 markings, 136 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p181 + p182 <= 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 724 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 BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-5.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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p187 <= p179) AND (3 <= p180))))
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 724 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 55 markings, 54 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p1) AND (p186 <= p180) AND ((3 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + ... (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 724 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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p6... (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 724 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 5 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-8.sara
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p180 <= 2) AND (p0 + 1 <= p183 + p184)) OR (p0 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 +... (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 724 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 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 80 markings, 79 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p3 + p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 +... (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 724 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 unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-10.sara
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p15... (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 724 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 unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-11.sara
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p2 <= 2)))
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 724 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 BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 12)
lola: sara is running 0 secs || 5821 markings, 9329 edges, 1164 markings/sec, 0 secs
lola: sara is running 5 secs || 11112 markings, 18621 edges, 1058 markings/sec, 5 secs
lola: sara is running 10 secs || 16157 markings, 27713 edges, 1009 markings/sec, 10 secs
lola: sara is running 15 secs || 20772 markings, 36307 edges, 923 markings/sec, 15 secs
lola: sara is running 20 secs || 25839 markings, 45493 edges, 1013 markings/sec, 20 secs
lola: sara is running 25 secs || 30715 markings, 54449 edges, 975 markings/sec, 25 secs
lola: sara is running 30 secs || 35041 markings, 62722 edges, 865 markings/sec, 30 secs
lola: sara is running 35 secs || 39981 markings, 71769 edges, 988 markings/sec, 35 secs
lola: sara is running 40 secs || 44436 markings, 80266 edges, 891 markings/sec, 40 secs
lola: sara is running 45 secs || 48129 markings, 87673 edges, 739 markings/sec, 45 secs
lola: sara is running 50 secs || 53659 markings, 97601 edges, 1106 markings/sec, 50 secs
lola: sara is running 55 secs || 57564 markings, 105326 edges, 781 markings/sec, 55 secs
lola: sara is running 60 secs || 61507 markings, 113069 edges, 789 markings/sec, 60 secs
lola: sara is running 65 secs || 65921 markings, 121316 edges, 883 markings/sec, 65 secs
lola: sara is running 70 secs || 70017 markings, 129228 edges, 819 markings/sec, 70 secs
lola: sara is running 75 secs || 73644 markings, 136589 edges, 725 markings/sec, 75 secs
lola: sara is running 80 secs || 78224 markings, 144923 edges, 916 markings/sec, 80 secs
lola: sara is running 85 secs || 82615 markings, 153034 edges, 878 markings/sec, 85 secs
lola: sara is running 90 secs || 86764 markings, 160952 edges, 830 markings/sec, 90 secs
lola: sara is running 95 secs || 90447 markings, 168266 edges, 737 markings/sec, 95 secs
lola: sara is running 100 secs || 94708 markings, 176292 edges, 852 markings/sec, 100 secs
lola: sara is running 105 secs || 98869 markings, 184111 edges, 832 markings/sec, 105 secs
lola: sara is running 110 secs || 102577 markings, 191373 edges, 742 markings/sec, 110 secs
lola: sara is running 115 secs || 106280 markings, 198687 edges, 741 markings/sec, 115 secs
lola: sara is running 120 secs || 110068 markings, 206227 edges, 758 markings/sec, 120 secs
lola: sara is running 125 secs || 114222 markings, 213829 edges, 831 markings/sec, 125 secs
lola: sara is running 130 secs || 118046 markings, 221161 edges, 765 markings/sec, 130 secs
lola: sara is running 135 secs || 121821 markings, 228438 edges, 755 markings/sec, 135 secs
lola: sara is running 140 secs || 125375 markings, 235532 edges, 711 markings/sec, 140 secs
lola: sara is running 145 secs || 129014 markings, 242770 edges, 728 markings/sec, 145 secs
lola: sara is running 150 secs || 132874 markings, 250261 edges, 772 markings/sec, 150 secs
lola: sara is running 155 secs || 136674 markings, 257551 edges, 760 markings/sec, 155 secs
lola: sara is running 160 secs || 140592 markings, 265013 edges, 784 markings/sec, 160 secs
lola: sara is running 165 secs || 144091 markings, 272031 edges, 700 markings/sec, 165 secs
lola: sara is running 170 secs || 147686 markings, 279153 edges, 719 markings/sec, 170 secs
lola: sara is running 175 secs || 151368 markings, 286376 edges, 736 markings/sec, 175 secs
lola: sara is running 180 secs || 154878 markings, 293474 edges, 702 markings/sec, 180 secs
lola: sara is running 185 secs || 158727 markings, 300759 edges, 770 markings/sec, 185 secs
lola: sara is running 190 secs || 162278 markings, 307750 edges, 710 markings/sec, 190 secs
lola: sara is running 195 secs || 165820 markings, 314743 edges, 708 markings/sec, 195 secs
lola: sara is running 200 secs || 169329 markings, 321756 edges, 702 markings/sec, 200 secs
lola: sara is running 205 secs || 172888 markings, 328861 edges, 712 markings/sec, 205 secs
lola: sara is running 210 secs || 176491 markings, 335928 edges, 721 markings/sec, 210 secs
lola: sara is running 215 secs || 180002 markings, 343005 edges, 702 markings/sec, 215 secs
lola: sara is running 220 secs || 183774 markings, 350206 edges, 754 markings/sec, 220 secs
lola: sara is running 225 secs || 187474 markings, 357363 edges, 740 markings/sec, 225 secs
lola: sara is running 230 secs || 190921 markings, 364246 edges, 689 markings/sec, 230 secs
lola: sara is running 235 secs || 194432 markings, 371191 edges, 702 markings/sec, 235 secs
lola: sara is running 240 secs || 197994 markings, 378213 edges, 712 markings/sec, 240 secs
lola: sara is running 245 secs || 201202 markings, 384842 edges, 642 markings/sec, 245 secs
lola: sara is running 250 secs || 204436 markings, 391570 edges, 647 markings/sec, 250 secs
lola: sara is running 255 secs || 208182 markings, 398766 edges, 749 markings/sec, 255 secs
lola: sara is running 260 secs || 211748 markings, 405650 edges, 713 markings/sec, 260 secs
lola: sara is running 265 secs || 215306 markings, 412573 edges, 712 markings/sec, 265 secs
lola: sara is running 270 secs || 218792 markings, 419440 edges, 697 markings/sec, 270 secs
lola: sara is running 275 secs || 222237 markings, 426319 edges, 689 markings/sec, 275 secs
lola: sara is running 280 secs || 225492 markings, 432969 edges, 651 markings/sec, 280 secs
lola: sara is running 285 secs || 228773 markings, 439707 edges, 656 markings/sec, 285 secs
lola: sara is running 290 secs || 232426 markings, 446742 edges, 731 markings/sec, 290 secs
lola: sara is running 295 secs || 235462 markings, 453296 edges, 607 markings/sec, 295 secs
lola: sara is running 300 secs || 238981 markings, 460061 edges, 704 markings/sec, 300 secs
lola: sara is running 305 secs || 242633 markings, 467077 edges, 730 markings/sec, 305 secs
lola: sara is running 310 secs || 246010 markings, 473828 edges, 675 markings/sec, 310 secs
lola: sara is running 315 secs || 249529 markings, 480764 edges, 704 markings/sec, 315 secs
lola: sara is running 320 secs || 253022 markings, 487696 edges, 699 markings/sec, 320 secs
lola: sara is running 325 secs || 256193 markings, 494254 edges, 634 markings/sec, 325 secs
lola: sara is running 330 secs || 259441 markings, 500893 edges, 650 markings/sec, 330 secs
lola: sara is running 335 secs || 263039 markings, 507955 edges, 720 markings/sec, 335 secs
lola: sara is running 340 secs || 266060 markings, 514396 edges, 604 markings/sec, 340 secs
lola: sara is running 345 secs || 270045 markings, 521966 edges, 797 markings/sec, 345 secs
lola: sara is running 350 secs || 275013 markings, 531205 edges, 994 markings/sec, 350 secs
lola: sara is running 355 secs || 278887 markings, 538830 edges, 775 markings/sec, 355 secs
lola: sara is running 360 secs || 282584 markings, 546138 edges, 739 markings/sec, 360 secs
lola: sara is running 365 secs || 286277 markings, 553642 edges, 739 markings/sec, 365 secs
lola: sara is running 370 secs || 290050 markings, 561024 edges, 755 markings/sec, 370 secs
lola: sara is running 375 secs || 294020 markings, 568713 edges, 794 markings/sec, 375 secs
lola: sara is running 380 secs || 297877 markings, 576303 edges, 771 markings/sec, 380 secs
lola: sara is running 385 secs || 301332 markings, 583215 edges, 691 markings/sec, 385 secs
lola: sara is running 390 secs || 304625 markings, 590042 edges, 659 markings/sec, 390 secs
lola: sara is running 395 secs || 308211 markings, 597088 edges, 717 markings/sec, 395 secs
lola: sara is running 400 secs || 311461 markings, 603893 edges, 650 markings/sec, 400 secs
lola: sara is running 405 secs || 315291 markings, 611306 edges, 766 markings/sec, 405 secs
lola: sara is running 410 secs || 318266 markings, 617655 edges, 595 markings/sec, 410 secs
lola: sara is running 415 secs || 321916 markings, 624812 edges, 730 markings/sec, 415 secs
lola: sara is running 420 secs || 324741 markings, 630988 edges, 565 markings/sec, 420 secs
lola: sara is running 425 secs || 328290 markings, 637986 edges, 710 markings/sec, 425 secs
lola: sara is running 430 secs || 331155 markings, 644286 edges, 573 markings/sec, 430 secs
lola: sara is running 435 secs || 334803 markings, 651295 edges, 730 markings/sec, 435 secs
lola: sara is running 440 secs || 338183 markings, 658082 edges, 676 markings/sec, 440 secs
lola: sara is running 445 secs || 341164 markings, 664295 edges, 596 markings/sec, 445 secs
lola: sara is running 450 secs || 346810 markings, 674316 edges, 1129 markings/sec, 450 secs
lola: sara is running 455 secs || 350866 markings, 682231 edges, 811 markings/sec, 455 secs
lola: sara is running 460 secs || 354831 markings, 690085 edges, 793 markings/sec, 460 secs
lola: sara is running 465 secs || 358457 markings, 697476 edges, 725 markings/sec, 465 secs
lola: sara is running 470 secs || 362116 markings, 704693 edges, 732 markings/sec, 470 secs
lola: sara is running 475 secs || 365848 markings, 712021 edges, 746 markings/sec, 475 secs
lola: sara is running 480 secs || 370001 markings, 719954 edges, 831 markings/sec, 480 secs
lola: sara is running 485 secs || 373521 markings, 726985 edges, 704 markings/sec, 485 secs
lola: sara is running 490 secs || 376780 markings, 733833 edges, 652 markings/sec, 490 secs
lola: sara is running 495 secs || 380779 markings, 741565 edges, 800 markings/sec, 495 secs
lola: sara is running 500 secs || 383837 markings, 747985 edges, 612 markings/sec, 500 secs
lola: sara is running 505 secs || 387786 markings, 755599 edges, 790 markings/sec, 505 secs
lola: sara is running 510 secs || 390693 markings, 761870 edges, 581 markings/sec, 510 secs
lola: sara is running 515 secs || 394466 markings, 769266 edges, 755 markings/sec, 515 secs
lola: sara is running 520 secs || 397220 markings, 775325 edges, 551 markings/sec, 520 secs
lola: sara is running 525 secs || 401007 markings, 782532 edges, 757 markings/sec, 525 secs
lola: sara is running 530 secs || 404075 markings, 789166 edges, 614 markings/sec, 530 secs
lola: sara is running 535 secs || 407480 markings, 795969 edges, 681 markings/sec, 535 secs
lola: sara is running 540 secs || 410910 markings, 802802 edges, 686 markings/sec, 540 secs
lola: sara is running 545 secs || 413540 markings, 808825 edges, 526 markings/sec, 545 secs
lola: sara is running 550 secs || 417238 markings, 815907 edges, 740 markings/sec, 550 secs
lola: sara is running 555 secs || 420302 markings, 822466 edges, 613 markings/sec, 555 secs
lola: sara is running 560 secs || 424931 markings, 830997 edges, 926 markings/sec, 560 secs
lola: sara is running 565 secs || 429870 markings, 840189 edges, 988 markings/sec, 565 secs
lola: sara is running 570 secs || 433647 markings, 847645 edges, 755 markings/sec, 570 secs
lola: sara is running 575 secs || 437570 markings, 855493 edges, 785 markings/sec, 575 secs
lola: sara is running 580 secs || 441213 markings, 862803 edges, 729 markings/sec, 580 secs
lola: sara is running 585 secs || 444717 markings, 870005 edges, 701 markings/sec, 585 secs
lola: sara is running 590 secs || 449062 markings, 878139 edges, 869 markings/sec, 590 secs
lola: sara is running 595 secs || 452638 markings, 885251 edges, 715 markings/sec, 595 secs
lola: sara is running 600 secs || 455951 markings, 892153 edges, 663 markings/sec, 600 secs
lola: sara is running 605 secs || 460151 markings, 900196 edges, 840 markings/sec, 605 secs
lola: sara is running 610 secs || 463115 markings, 906490 edges, 593 markings/sec, 610 secs
lola: sara is running 615 secs || 467096 markings, 914077 edges, 796 markings/sec, 615 secs
lola: sara is running 620 secs || 469832 markings, 920133 edges, 547 markings/sec, 620 secs
lola: sara is running 625 secs || 473608 markings, 927476 edges, 755 markings/sec, 625 secs
lola: sara is running 630 secs || 476590 markings, 933727 edges, 596 markings/sec, 630 secs
lola: sara is running 635 secs || 480214 markings, 940771 edges, 725 markings/sec, 635 secs
lola: sara is running 640 secs || 483595 markings, 947681 edges, 676 markings/sec, 640 secs
lola: sara is running 645 secs || 486529 markings, 953944 edges, 587 markings/sec, 645 secs
lola: sara is running 650 secs || 490158 markings, 961195 edges, 726 markings/sec, 650 secs
lola: sara is running 655 secs || 493170 markings, 967564 edges, 602 markings/sec, 655 secs
lola: sara is running 660 secs || 496549 markings, 974347 edges, 676 markings/sec, 660 secs
lola: sara is running 665 secs || 500148 markings, 981499 edges, 720 markings/sec, 665 secs
lola: sara is running 670 secs || 502805 markings, 987518 edges, 531 markings/sec, 670 secs
lola: sara is running 675 secs || 506284 markings, 994384 edges, 696 markings/sec, 675 secs
lola: sara is running 680 secs || 509742 markings, 1001414 edges, 692 markings/sec, 680 secs
lola: sara is running 685 secs || 513343 markings, 1008526 edges, 720 markings/sec, 685 secs
lola: sara is running 690 secs || 519206 markings, 1018878 edges, 1173 markings/sec, 690 secs
lola: sara is running 695 secs || 523645 markings, 1027355 edges, 888 markings/sec, 695 secs
lola: sara is running 700 secs || 527298 markings, 1034702 edges, 731 markings/sec, 700 secs
lola: sara is running 705 secs || 530960 markings, 1042043 edges, 732 markings/sec, 705 secs
lola: sara is running 710 secs || 534866 markings, 1049903 edges, 781 markings/sec, 710 secs
lola: sara is running 715 secs || 538391 markings, 1057036 edges, 705 markings/sec, 715 secs
lola: sara is running 720 secs || 542581 markings, 1064981 edges, 838 markings/sec, 720 secs
lola: sara is running 725 secs || 546234 markings, 1072223 edges, 731 markings/sec, 725 secs
lola: sara is running 730 secs || 549730 markings, 1079373 edges, 699 markings/sec, 730 secs
lola: sara is running 735 secs || 553464 markings, 1086586 edges, 747 markings/sec, 735 secs
lola: sara is running 740 secs || 556767 markings, 1093513 edges, 661 markings/sec, 740 secs
lola: sara is running 745 secs || 560490 markings, 1100726 edges, 745 markings/sec, 745 secs
lola: sara is running 750 secs || 563889 markings, 1107720 edges, 680 markings/sec, 750 secs
lola: sara is running 755 secs || 567278 markings, 1114583 edges, 678 markings/sec, 755 secs
lola: sara is running 760 secs || 571047 markings, 1121969 edges, 754 markings/sec, 760 secs
lola: sara is running 765 secs || 573611 markings, 1127893 edges, 513 markings/sec, 765 secs
lola: sara is running 770 secs || 577489 markings, 1135195 edges, 776 markings/sec, 770 secs
lola: sara is running 775 secs || 580736 markings, 1141893 edges, 649 markings/sec, 775 secs
lola: sara is running 780 secs || 583539 markings, 1148034 edges, 561 markings/sec, 780 secs
lola: sara is running 785 secs || 587286 markings, 1155189 edges, 749 markings/sec, 785 secs
lola: sara is running 790 secs || 590537 markings, 1161993 edges, 650 markings/sec, 790 secs
lola: sara is running 795 secs || 593316 markings, 1168126 edges, 556 markings/sec, 795 secs
lola: sara is running 800 secs || 597031 markings, 1175241 edges, 743 markings/sec, 800 secs
lola: sara is running 805 secs || 600385 markings, 1182139 edges, 671 markings/sec, 805 secs
lola: sara is running 810 secs || 602893 markings, 1188009 edges, 502 markings/sec, 810 secs
lola: sara is running 815 secs || 606623 markings, 1195153 edges, 746 markings/sec, 815 secs
lola: sara is running 820 secs || 610006 markings, 1202127 edges, 677 markings/sec, 820 secs
lola: sara is running 825 secs || 612890 markings, 1208310 edges, 577 markings/sec, 825 secs
lola: sara is running 830 secs || 618966 markings, 1218812 edges, 1215 markings/sec, 830 secs
lola: sara is running 835 secs || 623411 markings, 1227335 edges, 889 markings/sec, 835 secs
lola: sara is running 840 secs || 627390 markings, 1235117 edges, 796 markings/sec, 840 secs
lola: sara is running 845 secs || 631187 markings, 1242669 edges, 759 markings/sec, 845 secs
lola: sara is running 850 secs || 634576 markings, 1249679 edges, 678 markings/sec, 850 secs
lola: sara is running 855 secs || 638693 markings, 1257789 edges, 823 markings/sec, 855 secs
lola: sara is running 860 secs || 642241 markings, 1264971 edges, 710 markings/sec, 860 secs
lola: sara is running 865 secs || 646560 markings, 1273087 edges, 864 markings/sec, 865 secs
lola: sara is running 870 secs || 650069 markings, 1280189 edges, 702 markings/sec, 870 secs
lola: sara is running 875 secs || 653867 markings, 1287692 edges, 760 markings/sec, 875 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p0 <= 2)))
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 724 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 BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 79 markings, 78 edges
lola: ========================================
lola: subprocess 14 will run for 1326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p84 <= p0)))
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 724 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 BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 84 markings, 83 edges
lola: ========================================
lola: subprocess 15 will run for 2653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p185) OR (p181 + p182 <= 1) OR (3 <= p1))))
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 724 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 BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-15.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: RESULT
lola:
SUMMARY: no yes yes yes yes yes yes yes no yes no no unknown yes no yes
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P20N10-ReachabilityCardinality-15 TRUE 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="BridgeAndVehicles-COL-V80P20N10"
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/BridgeAndVehicles-COL-V80P20N10.tgz
mv BridgeAndVehicles-COL-V80P20N10 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 BridgeAndVehicles-COL-V80P20N10, 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 r031-ebro-152646309300215"
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 '' ReachabilityCardinality.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 ;