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

About the Execution of Irma.full for BridgeAndVehicles-COL-V80P50N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1024.560 1440109.00 2812291.00 348.60 FTFTT?T?FTTF?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 232K
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K 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.8K 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.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K 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.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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-full
Input is BridgeAndVehicles-COL-V80P50N10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-ebro-152646308300236
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526758339907


BK_STOP 1526759780016

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using BridgeAndVehicles-COL-V80P50N10 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': 807841, 'Memory': 4001.15, 'Tool': 'lola'}, {'Time': 823393, 'Memory': 477.71, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola BridgeAndVehicles-COL-V80P50N10...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
BridgeAndVehicles-COL-V80P50N10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-COL-V80P50N10: translating COL formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ BridgeAndVehicles-COL-V80P50N10 @ 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: 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-V80P50N10-ReachabilityCardinality.task
lola: A (G (((p2 + 1 <= p97 + p96 + p95 + p94 + p93 + 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 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p98) OR (p105 + 1 <= p1) OR (p4 + p5 + 1 <= p101 + p102)))) : A (G ((1 <= 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 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186))) : A (G (((2 <= p1)))) : A (G ((1 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16))) : E (F ((p1 <= p4 + p5))) : A (G (((p1 <= p103 + p104) OR (1 <= p105) OR (p2 <= p4 + p5) OR ((p105 <= p187) AND (3 <= p105) AND (p4 + p5 <= 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 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186) AND (p101 + p102 <= p1))))) : E (F (((p1 <= p100) AND (((p105 <= p1) AND (1 <= p105)) OR ((p1 <= p187) AND (p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 <= p103 + p104)))))) : A (G (((p103 + p104 + 1 <= p105) AND (p103 + p104 <= 2) AND (p99 + 1 <= p105)))) : E (F (((3 <= p101 + p102) AND ((p105 <= p1) OR (p103 + p104 <= p105) OR (p1 <= p187) OR (1 <= 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 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186))))) : A (G (())) : E (F (((p187 + 1 <= p105) AND ((p2 <= p101 + p102) OR (p4 + p5 <= p101 + p102)) AND (2 <= p17) AND (p1 <= p3)))) : A (G (((p187 <= p2) OR (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 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + 1 <= p187)))) : A (G (((1 <= p187) OR (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 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + 1 <= p105)))) : A (G (((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 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 <= 1) OR (p4 + p5 + 1 <= p0) OR (3 <= p187)))) : A (G ((((p101 + p102 + 1 <= p1) AND (p101 + p102 <= 2)) OR (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 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 <= p0)))) : E (F ((p2 <= p0)))
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 (((p2 + 1 <= p97 + p96 + p95 + p94 + p93 + 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 ... (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 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= 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 + p16... (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: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality.sara
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= 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)
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality.sara.
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-V80P50N10-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 80 markings, 79 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16)))
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-V80P50N10-ReachabilityCardinality-3.sara
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p1 <= p4 + p5)))
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-V80P50N10-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 80 markings, 79 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1 <= p103 + p104) OR (1 <= p105) OR (p2 <= p4 + p5) OR ((p105 <= p187) AND (3 <= p105) AND (p4 + p5 <= 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 ... (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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 5732 markings, 12266 edges, 1146 markings/sec, 0 secs
lola: sara is running 5 secs || 10377 markings, 24438 edges, 929 markings/sec, 5 secs
lola: sara is running 10 secs || 15417 markings, 37498 edges, 1008 markings/sec, 10 secs
lola: sara is running 15 secs || 20629 markings, 51999 edges, 1042 markings/sec, 15 secs
lola: sara is running 20 secs || 25980 markings, 66326 edges, 1070 markings/sec, 20 secs
lola: sara is running 25 secs || 31072 markings, 80660 edges, 1018 markings/sec, 25 secs
lola: sara is running 30 secs || 36697 markings, 96392 edges, 1125 markings/sec, 30 secs
lola: sara is running 35 secs || 42302 markings, 112243 edges, 1121 markings/sec, 35 secs
lola: sara is running 40 secs || 47518 markings, 127504 edges, 1043 markings/sec, 40 secs
lola: sara is running 45 secs || 53010 markings, 143431 edges, 1098 markings/sec, 45 secs
lola: sara is running 50 secs || 58587 markings, 159027 edges, 1115 markings/sec, 50 secs
lola: sara is running 55 secs || 63929 markings, 174801 edges, 1068 markings/sec, 55 secs
lola: sara is running 60 secs || 69750 markings, 192140 edges, 1164 markings/sec, 60 secs
lola: sara is running 65 secs || 75079 markings, 207727 edges, 1066 markings/sec, 65 secs
lola: sara is running 70 secs || 80679 markings, 223600 edges, 1120 markings/sec, 70 secs
lola: sara is running 75 secs || 86256 markings, 239981 edges, 1115 markings/sec, 75 secs
lola: sara is running 80 secs || 92201 markings, 257850 edges, 1189 markings/sec, 80 secs
lola: sara is running 85 secs || 97734 markings, 274595 edges, 1107 markings/sec, 85 secs
lola: sara is running 90 secs || 102936 markings, 290341 edges, 1040 markings/sec, 90 secs
lola: sara is running 95 secs || 108294 markings, 305233 edges, 1072 markings/sec, 95 secs
lola: sara is running 100 secs || 114140 markings, 322523 edges, 1169 markings/sec, 100 secs
lola: sara is running 105 secs || 120214 markings, 340751 edges, 1215 markings/sec, 105 secs
lola: sara is running 110 secs || 125931 markings, 358081 edges, 1143 markings/sec, 110 secs
lola: sara is running 115 secs || 131659 markings, 375807 edges, 1146 markings/sec, 115 secs
lola: sara is running 120 secs || 136635 markings, 391508 edges, 995 markings/sec, 120 secs
lola: sara is running 125 secs || 141981 markings, 405929 edges, 1069 markings/sec, 125 secs
lola: sara is running 130 secs || 147708 markings, 422664 edges, 1145 markings/sec, 130 secs
lola: sara is running 135 secs || 153906 markings, 441312 edges, 1240 markings/sec, 135 secs
lola: sara is running 140 secs || 159792 markings, 459149 edges, 1177 markings/sec, 140 secs
lola: sara is running 145 secs || 165811 markings, 477733 edges, 1204 markings/sec, 145 secs
lola: sara is running 150 secs || 171145 markings, 494317 edges, 1067 markings/sec, 150 secs
lola: sara is running 155 secs || 176386 markings, 511183 edges, 1048 markings/sec, 155 secs
lola: sara is running 160 secs || 182328 markings, 527999 edges, 1188 markings/sec, 160 secs
lola: sara is running 165 secs || 187535 markings, 542873 edges, 1041 markings/sec, 165 secs
lola: sara is running 170 secs || 192645 markings, 558364 edges, 1022 markings/sec, 170 secs
lola: sara is running 175 secs || 197956 markings, 574690 edges, 1062 markings/sec, 175 secs
lola: sara is running 180 secs || 203411 markings, 591522 edges, 1091 markings/sec, 180 secs
lola: sara is running 185 secs || 209137 markings, 609357 edges, 1145 markings/sec, 185 secs
lola: sara is running 190 secs || 213871 markings, 624993 edges, 947 markings/sec, 190 secs
lola: sara is running 195 secs || 219690 markings, 642884 edges, 1164 markings/sec, 195 secs
lola: sara is running 200 secs || 225094 markings, 660525 edges, 1081 markings/sec, 200 secs
lola: sara is running 205 secs || 230592 markings, 677810 edges, 1100 markings/sec, 205 secs
lola: sara is running 210 secs || 236126 markings, 695950 edges, 1107 markings/sec, 210 secs
lola: sara is running 215 secs || 243520 markings, 719354 edges, 1479 markings/sec, 215 secs
lola: sara is running 220 secs || 249564 markings, 735886 edges, 1209 markings/sec, 220 secs
lola: sara is running 225 secs || 254562 markings, 750540 edges, 1000 markings/sec, 225 secs
lola: sara is running 230 secs || 259879 markings, 766952 edges, 1063 markings/sec, 230 secs
lola: sara is running 235 secs || 265241 markings, 783600 edges, 1072 markings/sec, 235 secs
lola: sara is running 240 secs || 270886 markings, 801044 edges, 1129 markings/sec, 240 secs
lola: sara is running 245 secs || 276067 markings, 817661 edges, 1036 markings/sec, 245 secs
lola: sara is running 250 secs || 281289 markings, 834387 edges, 1044 markings/sec, 250 secs
lola: sara is running 255 secs || 287265 markings, 853096 edges, 1195 markings/sec, 255 secs
lola: sara is running 260 secs || 292118 markings, 869324 edges, 971 markings/sec, 260 secs
lola: sara is running 265 secs || 298192 markings, 888484 edges, 1215 markings/sec, 265 secs
lola: sara is running 270 secs || 303230 markings, 905010 edges, 1008 markings/sec, 270 secs
lola: sara is running 275 secs || 308645 markings, 922788 edges, 1083 markings/sec, 275 secs
lola: sara is running 280 secs || 315584 markings, 944909 edges, 1388 markings/sec, 280 secs
lola: sara is running 285 secs || 321648 markings, 961710 edges, 1213 markings/sec, 285 secs
lola: sara is running 290 secs || 326771 markings, 976748 edges, 1025 markings/sec, 290 secs
lola: sara is running 295 secs || 332021 markings, 992784 edges, 1050 markings/sec, 295 secs
lola: sara is running 300 secs || 337527 markings, 1009651 edges, 1101 markings/sec, 300 secs
lola: sara is running 305 secs || 342530 markings, 1025700 edges, 1001 markings/sec, 305 secs
lola: sara is running 310 secs || 348024 markings, 1043257 edges, 1099 markings/sec, 310 secs
lola: sara is running 315 secs || 353680 markings, 1060923 edges, 1131 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1 <= p100) AND (((p105 <= p1) AND (1 <= p105)) OR ((p1 <= p187) AND (p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 <= p103 + p104))))))
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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 141 markings, 140 edges
lola: ========================================
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p103 + p104 + 1 <= p105) AND (p103 + p104 <= 2) AND (p99 + 1 <= p105))))
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 3 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 7798 markings, 19783 edges, 1560 markings/sec, 0 secs
lola: sara is running 5 secs || 15934 markings, 41587 edges, 1627 markings/sec, 5 secs
lola: sara is running 10 secs || 23382 markings, 61934 edges, 1490 markings/sec, 10 secs
lola: sara is running 15 secs || 31273 markings, 82483 edges, 1578 markings/sec, 15 secs
lola: sara is running 20 secs || 39172 markings, 103755 edges, 1580 markings/sec, 20 secs
lola: sara is running 25 secs || 46788 markings, 124709 edges, 1523 markings/sec, 25 secs
lola: sara is running 30 secs || 54412 markings, 145499 edges, 1525 markings/sec, 30 secs
lola: sara is running 35 secs || 62562 markings, 166537 edges, 1630 markings/sec, 35 secs
lola: sara is running 40 secs || 70709 markings, 188361 edges, 1629 markings/sec, 40 secs
lola: sara is running 45 secs || 78404 markings, 209405 edges, 1539 markings/sec, 45 secs
lola: sara is running 50 secs || 86019 markings, 229394 edges, 1523 markings/sec, 50 secs
lola: sara is running 55 secs || 93752 markings, 250403 edges, 1547 markings/sec, 55 secs
lola: sara is running 60 secs || 100607 markings, 269169 edges, 1371 markings/sec, 60 secs
lola: sara is running 65 secs || 108288 markings, 290174 edges, 1536 markings/sec, 65 secs
lola: sara is running 70 secs || 116223 markings, 310556 edges, 1587 markings/sec, 70 secs
lola: sara is running 75 secs || 124177 markings, 332044 edges, 1591 markings/sec, 75 secs
lola: sara is running 80 secs || 131780 markings, 352848 edges, 1521 markings/sec, 80 secs
lola: sara is running 85 secs || 139941 markings, 373912 edges, 1632 markings/sec, 85 secs
lola: sara is running 90 secs || 147959 markings, 395505 edges, 1604 markings/sec, 90 secs
lola: sara is running 95 secs || 155500 markings, 416179 edges, 1508 markings/sec, 95 secs
lola: sara is running 100 secs || 163687 markings, 437337 edges, 1637 markings/sec, 100 secs
lola: sara is running 105 secs || 170911 markings, 456656 edges, 1445 markings/sec, 105 secs
lola: sara is running 110 secs || 174299 markings, 466303 edges, 678 markings/sec, 110 secs
lola: sara is running 115 secs || 178350 markings, 477080 edges, 810 markings/sec, 115 secs
lola: sara is running 120 secs || 181945 markings, 487188 edges, 719 markings/sec, 120 secs
lola: sara is running 125 secs || 186461 markings, 498071 edges, 903 markings/sec, 125 secs
lola: sara is running 130 secs || 192710 markings, 515231 edges, 1250 markings/sec, 130 secs
lola: sara is running 135 secs || 201007 markings, 537451 edges, 1659 markings/sec, 135 secs
lola: sara is running 140 secs || 209001 markings, 558179 edges, 1599 markings/sec, 140 secs
lola: sara is running 145 secs || 216759 markings, 579099 edges, 1552 markings/sec, 145 secs
lola: sara is running 150 secs || 224428 markings, 600166 edges, 1534 markings/sec, 150 secs
lola: sara is running 155 secs || 231754 markings, 618945 edges, 1465 markings/sec, 155 secs
lola: sara is running 160 secs || 236741 markings, 632598 edges, 997 markings/sec, 160 secs
lola: sara is running 165 secs || 244957 markings, 654617 edges, 1643 markings/sec, 165 secs
lola: sara is running 170 secs || 252426 markings, 674104 edges, 1494 markings/sec, 170 secs
lola: sara is running 175 secs || 258990 markings, 692080 edges, 1313 markings/sec, 175 secs
lola: sara is running 180 secs || 268399 markings, 714059 edges, 1882 markings/sec, 180 secs
lola: sara is running 185 secs || 277393 markings, 735282 edges, 1799 markings/sec, 185 secs
lola: sara is running 190 secs || 285327 markings, 754526 edges, 1587 markings/sec, 190 secs
lola: sara is running 195 secs || 292472 markings, 772498 edges, 1429 markings/sec, 195 secs
lola: sara is running 200 secs || 300604 markings, 796224 edges, 1626 markings/sec, 200 secs
lola: sara is running 205 secs || 307923 markings, 821122 edges, 1464 markings/sec, 205 secs
lola: sara is running 210 secs || 315377 markings, 846913 edges, 1491 markings/sec, 210 secs
lola: sara is running 215 secs || 322982 markings, 872615 edges, 1521 markings/sec, 215 secs
lola: sara is running 220 secs || 330156 markings, 893164 edges, 1435 markings/sec, 220 secs
lola: sara is running 225 secs || 336465 markings, 910263 edges, 1262 markings/sec, 225 secs
lola: sara is running 230 secs || 342455 markings, 926674 edges, 1198 markings/sec, 230 secs
lola: sara is running 235 secs || 348469 markings, 943136 edges, 1203 markings/sec, 235 secs
lola: sara is running 240 secs || 355150 markings, 962191 edges, 1336 markings/sec, 240 secs
lola: sara is running 245 secs || 362873 markings, 988469 edges, 1545 markings/sec, 245 secs
lola: sara is running 250 secs || 370287 markings, 1014083 edges, 1483 markings/sec, 250 secs
lola: sara is running 255 secs || 377708 markings, 1039201 edges, 1484 markings/sec, 255 secs
lola: sara is running 260 secs || 384035 markings, 1057742 edges, 1265 markings/sec, 260 secs
lola: sara is running 265 secs || 386803 markings, 1065546 edges, 554 markings/sec, 265 secs
lola: sara is running 270 secs || 390192 markings, 1074462 edges, 678 markings/sec, 270 secs
lola: sara is running 275 secs || 392865 markings, 1082061 edges, 535 markings/sec, 275 secs
lola: sara is running 280 secs || 396614 markings, 1092130 edges, 750 markings/sec, 280 secs
lola: sara is running 285 secs || 399867 markings, 1100826 edges, 651 markings/sec, 285 secs
lola: sara is running 290 secs || 404503 markings, 1113576 edges, 927 markings/sec, 290 secs
lola: sara is running 295 secs || 411932 markings, 1136986 edges, 1486 markings/sec, 295 secs
lola: sara is running 300 secs || 420040 markings, 1165170 edges, 1622 markings/sec, 300 secs
lola: sara is running 305 secs || 427324 markings, 1190096 edges, 1457 markings/sec, 305 secs
lola: sara is running 310 secs || 434711 markings, 1212864 edges, 1477 markings/sec, 310 secs
lola: sara is running 315 secs || 441225 markings, 1230636 edges, 1303 markings/sec, 315 secs
lola: sara is running 320 secs || 447368 markings, 1247584 edges, 1229 markings/sec, 320 secs
lola: sara is running 325 secs || 453197 markings, 1263695 edges, 1166 markings/sec, 325 secs
lola: sara is running 330 secs || 459773 markings, 1282220 edges, 1315 markings/sec, 330 secs
lola: sara is running 335 secs || 467396 markings, 1307936 edges, 1525 markings/sec, 335 secs
lola: sara is running 340 secs || 474978 markings, 1334346 edges, 1516 markings/sec, 340 secs
lola: sara is running 345 secs || 482535 markings, 1360090 edges, 1511 markings/sec, 345 secs
lola: sara is running 350 secs || 489111 markings, 1378416 edges, 1315 markings/sec, 350 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p101 + p102) AND ((p105 <= p1) OR (p103 + p104 <= p105) OR (p1 <= p187) OR (1 <= 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 + 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 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 188 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 476 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p187 + 1 <= p105) AND ((p2 <= p101 + p102) OR (p4 + p5 <= p101 + p102)) AND (2 <= p17) AND (p1 <= p3))))
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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 166 markings, 165 edges
lola: ========================================
lola: subprocess 11 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p187 <= p2) OR (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... (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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 347 markings, 346 edges
lola: ========================================
lola: subprocess 12 will run for 714 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p187) OR (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 ... (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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 7)
lola: sara is running 0 secs || 5548 markings, 11669 edges, 1110 markings/sec, 0 secs
lola: sara is running 5 secs || 11113 markings, 24391 edges, 1113 markings/sec, 5 secs
lola: sara is running 10 secs || 16455 markings, 36726 edges, 1068 markings/sec, 10 secs
lola: sara is running 15 secs || 21176 markings, 48059 edges, 944 markings/sec, 15 secs
lola: sara is running 20 secs || 26674 markings, 60795 edges, 1100 markings/sec, 20 secs
lola: sara is running 25 secs || 32309 markings, 73796 edges, 1127 markings/sec, 25 secs
lola: sara is running 30 secs || 37100 markings, 85301 edges, 958 markings/sec, 30 secs
lola: sara is running 35 secs || 43824 markings, 101342 edges, 1345 markings/sec, 35 secs
lola: sara is running 40 secs || 49032 markings, 113206 edges, 1042 markings/sec, 40 secs
lola: sara is running 45 secs || 54109 markings, 125014 edges, 1015 markings/sec, 45 secs
lola: sara is running 50 secs || 59411 markings, 137302 edges, 1060 markings/sec, 50 secs
lola: sara is running 55 secs || 64881 markings, 149886 edges, 1094 markings/sec, 55 secs
lola: sara is running 60 secs || 69620 markings, 161370 edges, 948 markings/sec, 60 secs
lola: sara is running 65 secs || 75238 markings, 174321 edges, 1124 markings/sec, 65 secs
lola: sara is running 70 secs || 80033 markings, 185746 edges, 959 markings/sec, 70 secs
lola: sara is running 75 secs || 85764 markings, 198222 edges, 1146 markings/sec, 75 secs
lola: sara is running 80 secs || 91283 markings, 210849 edges, 1104 markings/sec, 80 secs
lola: sara is running 85 secs || 96606 markings, 223173 edges, 1065 markings/sec, 85 secs
lola: sara is running 90 secs || 101340 markings, 234486 edges, 947 markings/sec, 90 secs
lola: sara is running 95 secs || 106843 markings, 247282 edges, 1101 markings/sec, 95 secs
lola: sara is running 100 secs || 112434 markings, 260144 edges, 1118 markings/sec, 100 secs
lola: sara is running 105 secs || 117214 markings, 271622 edges, 956 markings/sec, 105 secs
lola: sara is running 110 secs || 122912 markings, 284038 edges, 1140 markings/sec, 110 secs
lola: sara is running 115 secs || 128412 markings, 296612 edges, 1100 markings/sec, 115 secs
lola: sara is running 120 secs || 133720 markings, 308913 edges, 1062 markings/sec, 120 secs
lola: sara is running 125 secs || 138459 markings, 320237 edges, 948 markings/sec, 125 secs
lola: sara is running 130 secs || 143909 markings, 332889 edges, 1090 markings/sec, 130 secs
lola: sara is running 135 secs || 149399 markings, 345549 edges, 1098 markings/sec, 135 secs
lola: sara is running 140 secs || 154175 markings, 357022 edges, 955 markings/sec, 140 secs
lola: sara is running 145 secs || 159841 markings, 369346 edges, 1133 markings/sec, 145 secs
lola: sara is running 150 secs || 165302 markings, 381859 edges, 1092 markings/sec, 150 secs
lola: sara is running 155 secs || 170598 markings, 394139 edges, 1059 markings/sec, 155 secs
lola: sara is running 160 secs || 175961 markings, 406502 edges, 1073 markings/sec, 160 secs
lola: sara is running 165 secs || 180684 markings, 417882 edges, 945 markings/sec, 165 secs
lola: sara is running 170 secs || 186217 markings, 430633 edges, 1107 markings/sec, 170 secs
lola: sara is running 175 secs || 191038 markings, 442053 edges, 964 markings/sec, 175 secs
lola: sara is running 180 secs || 196898 markings, 454804 edges, 1172 markings/sec, 180 secs
lola: sara is running 185 secs || 201968 markings, 466632 edges, 1014 markings/sec, 185 secs
lola: sara is running 190 secs || 207217 markings, 478792 edges, 1050 markings/sec, 190 secs
lola: sara is running 195 secs || 212575 markings, 491227 edges, 1072 markings/sec, 195 secs
lola: sara is running 200 secs || 217474 markings, 502735 edges, 980 markings/sec, 200 secs
lola: sara is running 205 secs || 222773 markings, 515232 edges, 1060 markings/sec, 205 secs
lola: sara is running 210 secs || 228375 markings, 527502 edges, 1120 markings/sec, 210 secs
lola: sara is running 215 secs || 233398 markings, 539154 edges, 1005 markings/sec, 215 secs
lola: sara is running 220 secs || 239066 markings, 552061 edges, 1134 markings/sec, 220 secs
lola: sara is running 225 secs || 243779 markings, 563351 edges, 943 markings/sec, 225 secs
lola: sara is running 230 secs || 249191 markings, 575940 edges, 1082 markings/sec, 230 secs
lola: sara is running 235 secs || 254720 markings, 588739 edges, 1106 markings/sec, 235 secs
lola: sara is running 240 secs || 259472 markings, 600016 edges, 950 markings/sec, 240 secs
lola: sara is running 245 secs || 265297 markings, 612685 edges, 1165 markings/sec, 245 secs
lola: sara is running 250 secs || 270428 markings, 624618 edges, 1026 markings/sec, 250 secs
lola: sara is running 255 secs || 275673 markings, 636827 edges, 1049 markings/sec, 255 secs
lola: sara is running 260 secs || 281062 markings, 649345 edges, 1078 markings/sec, 260 secs
lola: sara is running 265 secs || 286595 markings, 662113 edges, 1107 markings/sec, 265 secs
lola: sara is running 270 secs || 291361 markings, 673564 edges, 953 markings/sec, 270 secs
lola: sara is running 275 secs || 297164 markings, 686127 edges, 1161 markings/sec, 275 secs
lola: sara is running 280 secs || 302283 markings, 698020 edges, 1024 markings/sec, 280 secs
lola: sara is running 285 secs || 307521 markings, 710205 edges, 1048 markings/sec, 285 secs
lola: sara is running 290 secs || 312902 markings, 722651 edges, 1076 markings/sec, 290 secs
lola: sara is running 295 secs || 318420 markings, 735397 edges, 1104 markings/sec, 295 secs
lola: sara is running 300 secs || 323173 markings, 746819 edges, 951 markings/sec, 300 secs
lola: sara is running 305 secs || 328922 markings, 759330 edges, 1150 markings/sec, 305 secs
lola: sara is running 310 secs || 334019 markings, 771187 edges, 1019 markings/sec, 310 secs
lola: sara is running 315 secs || 339231 markings, 783326 edges, 1042 markings/sec, 315 secs
lola: sara is running 320 secs || 344595 markings, 795746 edges, 1073 markings/sec, 320 secs
lola: sara is running 325 secs || 350088 markings, 808445 edges, 1099 markings/sec, 325 secs
lola: sara is running 330 secs || 354873 markings, 819914 edges, 957 markings/sec, 330 secs
lola: sara is running 335 secs || 364270 markings, 841113 edges, 1879 markings/sec, 335 secs
lola: sara is running 340 secs || 375318 markings, 865432 edges, 2210 markings/sec, 340 secs
lola: sara is running 345 secs || 385887 markings, 889178 edges, 2114 markings/sec, 345 secs
lola: sara is running 350 secs || 396286 markings, 912921 edges, 2080 markings/sec, 350 secs
lola: sara is running 355 secs || 406666 markings, 936402 edges, 2076 markings/sec, 355 secs
lola: sara is running 360 secs || 416051 markings, 958050 edges, 1877 markings/sec, 360 secs
lola: sara is running 365 secs || 421369 markings, 975542 edges, 1064 markings/sec, 365 secs
lola: sara is running 370 secs || 426525 markings, 992703 edges, 1031 markings/sec, 370 secs
lola: sara is running 375 secs || 431827 markings, 1010310 edges, 1060 markings/sec, 375 secs
lola: sara is running 380 secs || 437283 markings, 1028304 edges, 1091 markings/sec, 380 secs
lola: sara is running 385 secs || 442001 markings, 1044372 edges, 944 markings/sec, 385 secs
lola: sara is running 390 secs || 447625 markings, 1062974 edges, 1125 markings/sec, 390 secs
lola: sara is running 395 secs || 452337 markings, 1078963 edges, 942 markings/sec, 395 secs
lola: sara is running 400 secs || 459903 markings, 1102935 edges, 1513 markings/sec, 400 secs
lola: sara is running 405 secs || 471288 markings, 1128645 edges, 2277 markings/sec, 405 secs
lola: sara is running 410 secs || 482057 markings, 1153531 edges, 2154 markings/sec, 410 secs
lola: sara is running 415 secs || 493338 markings, 1178764 edges, 2256 markings/sec, 415 secs
lola: sara is running 420 secs || 500662 markings, 1198554 edges, 1465 markings/sec, 420 secs
lola: sara is running 425 secs || 505704 markings, 1215307 edges, 1008 markings/sec, 425 secs
lola: sara is running 430 secs || 510848 markings, 1232442 edges, 1029 markings/sec, 430 secs
lola: sara is running 435 secs || 516149 markings, 1250063 edges, 1060 markings/sec, 435 secs
lola: sara is running 440 secs || 521587 markings, 1268133 edges, 1088 markings/sec, 440 secs
lola: sara is running 445 secs || 527163 markings, 1286489 edges, 1115 markings/sec, 445 secs
lola: sara is running 450 secs || 531889 markings, 1302634 edges, 945 markings/sec, 450 secs
lola: sara is running 455 secs || 538270 markings, 1321014 edges, 1276 markings/sec, 455 secs
lola: sara is running 460 secs || 547731 markings, 1342841 edges, 1892 markings/sec, 460 secs
lola: sara is running 465 secs || 558526 markings, 1367757 edges, 2159 markings/sec, 465 secs
lola: sara is running 470 secs || 569352 markings, 1392542 edges, 2165 markings/sec, 470 secs
lola: sara is running 475 secs || 580558 markings, 1417788 edges, 2241 markings/sec, 475 secs
lola: sara is running 480 secs || 590887 markings, 1441570 edges, 2066 markings/sec, 480 secs
lola: sara is running 485 secs || 596083 markings, 1458638 edges, 1039 markings/sec, 485 secs
lola: sara is running 490 secs || 601207 markings, 1475684 edges, 1025 markings/sec, 490 secs
lola: sara is running 495 secs || 606413 markings, 1492975 edges, 1041 markings/sec, 495 secs
lola: sara is running 500 secs || 611824 markings, 1510897 edges, 1082 markings/sec, 500 secs
lola: sara is running 505 secs || 616524 markings, 1526864 edges, 940 markings/sec, 505 secs
lola: sara is running 510 secs || 622085 markings, 1545309 edges, 1112 markings/sec, 510 secs
lola: sara is running 515 secs || 627725 markings, 1563027 edges, 1128 markings/sec, 515 secs
lola: sara is running 520 secs || 639031 markings, 1588500 edges, 2261 markings/sec, 520 secs
lola: sara is running 525 secs || 649027 markings, 1611680 edges, 1999 markings/sec, 525 secs
lola: sara is running 530 secs || 660208 markings, 1636677 edges, 2236 markings/sec, 530 secs
lola: sara is running 535 secs || 666923 markings, 1655538 edges, 1343 markings/sec, 535 secs
lola: sara is running 540 secs || 672377 markings, 1673460 edges, 1091 markings/sec, 540 secs
lola: sara is running 545 secs || 676649 markings, 1687551 edges, 854 markings/sec, 545 secs
lola: sara is running 550 secs || 679404 markings, 1696929 edges, 551 markings/sec, 550 secs
lola: sara is running 555 secs || 684628 markings, 1714223 edges, 1045 markings/sec, 555 secs
lola: sara is running 560 secs || 689352 markings, 1730234 edges, 945 markings/sec, 560 secs
lola: sara is running 565 secs || 694890 markings, 1748627 edges, 1108 markings/sec, 565 secs
lola: sara is running 570 secs || 701744 markings, 1767874 edges, 1371 markings/sec, 570 secs
lola: sara is running 575 secs || 712486 markings, 1792873 edges, 2148 markings/sec, 575 secs
lola: sara is running 580 secs || 723715 markings, 1818091 edges, 2246 markings/sec, 580 secs
lola: sara is running 585 secs || 734549 markings, 1842766 edges, 2167 markings/sec, 585 secs
lola: sara is running 590 secs || 739775 markings, 1859931 edges, 1045 markings/sec, 590 secs
lola: sara is running 595 secs || 744900 markings, 1876956 edges, 1025 markings/sec, 595 secs
lola: sara is running 600 secs || 750142 markings, 1894393 edges, 1048 markings/sec, 600 secs
lola: sara is running 605 secs || 755515 markings, 1912224 edges, 1075 markings/sec, 605 secs
lola: sara is running 610 secs || 761047 markings, 1930457 edges, 1106 markings/sec, 610 secs
lola: sara is running 615 secs || 765776 markings, 1946575 edges, 946 markings/sec, 615 secs
lola: sara is running 620 secs || 773278 markings, 1966752 edges, 1500 markings/sec, 620 secs
lola: sara is running 625 secs || 784057 markings, 1991802 edges, 2156 markings/sec, 625 secs
lola: sara is running 630 secs || 795055 markings, 2016616 edges, 2200 markings/sec, 630 secs
lola: sara is running 635 secs || 804884 markings, 2039697 edges, 1966 markings/sec, 635 secs
lola: sara is running 640 secs || 809905 markings, 2056345 edges, 1004 markings/sec, 640 secs
lola: sara is running 645 secs || 814944 markings, 2073099 edges, 1008 markings/sec, 645 secs
lola: sara is running 650 secs || 820142 markings, 2090424 edges, 1040 markings/sec, 650 secs
lola: sara is running 655 secs || 825481 markings, 2108117 edges, 1068 markings/sec, 655 secs
lola: sara is running 660 secs || 830982 markings, 2126280 edges, 1100 markings/sec, 660 secs
lola: sara is running 665 secs || 835712 markings, 2142409 edges, 946 markings/sec, 665 secs
lola: sara is running 670 secs || 844954 markings, 2165376 edges, 1848 markings/sec, 670 secs
lola: sara is running 675 secs || 856284 markings, 2190728 edges, 2266 markings/sec, 675 secs
lola: sara is running 680 secs || 867203 markings, 2215745 edges, 2184 markings/sec, 680 secs
lola: sara is running 685 secs || 874712 markings, 2235857 edges, 1502 markings/sec, 685 secs
lola: sara is running 690 secs || 879794 markings, 2252781 edges, 1016 markings/sec, 690 secs
lola: sara is running 695 secs || 885013 markings, 2270121 edges, 1044 markings/sec, 695 secs
lola: sara is running 700 secs || 890363 markings, 2287830 edges, 1070 markings/sec, 700 secs
lola: sara is running 705 secs || 895052 markings, 2303706 edges, 938 markings/sec, 705 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 715 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((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 + ... (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 3 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-V80P50N10-ReachabilityCardinality-13.sara
lola: lola: ========================================state equation: calling and running sara

lola: subprocess 14 will run for 1072 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p101 + p102 + 1 <= p1) AND (p101 + p102 <= 2)) OR (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 + 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)
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-13.sara.
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 BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 81 markings, 80 edges
lola: ========================================
lola: subprocess 15 will run for 2145 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p2 <= 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 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-V80P50N10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 81 markings, 80 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes yes unknown yes unknown no yes yes no unknown yes no yes
sara: place or transition ordering is non-deterministic

FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V80P50N10-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 stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V80P50N10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-full"
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-V80P50N10.tgz
mv BridgeAndVehicles-COL-V80P50N10 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-full"
echo " Input is BridgeAndVehicles-COL-V80P50N10, 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 r030-ebro-152646308300236"
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 ;