fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r112-csrt-152666469500453
Last Updated
June 26, 2018

About the Execution of LoLA for PermAdmissibility-COL-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
180.090 131436.00 139011.00 66.30 FFFTTFFTFTFFFFTF 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 204K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 37K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PermAdmissibility-COL-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469500453
=====================================================================


--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-00
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-01
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-02
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-03
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-04
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-05
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-06
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-07
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-08
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-09
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-10
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-11
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-12
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-13
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-14
FORMULA_NAME PermAdmissibility-COL-10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1527036184322

info: Time: 3600 - MCC
===========================================================================================
prep: translating PermAdmissibility-COL-10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PermAdmissibility-COL-10 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking ReachabilityCardinality @ PermAdmissibility-COL-10 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6656
lola: finding significant places
lola: 208 places, 1024 transitions, 177 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1460 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-10-ReachabilityCardinality.task
lola: LP says that atomic proposition is always true: (p147 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199)
lola: always true
lola: A (G (((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= 0) OR (p19 <= 1)))) : A (G (((p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 0) AND ((p22 <= 2) OR (p19 <= 0))))) : A (G (((p165 <= p88 + p87 + p86 + p85 + p84 + p83 + p82 + p89) AND ((1 <= p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64) OR (1 <= p88 + p87 + p86 + p85 + p84 + p83 + p82 + p89) OR ((2 <= p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48) AND (p39 <= p73)))))) : E (F (((1 <= p10)))) : E (F (((p100 + p101 + p102 + p103 + p104 + p105 + p98 + p99 + 1 <= p167) AND (p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 <= 0) AND (((2 <= p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38) AND (p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 <= p9)) OR (p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 <= p39))))) : A (G ((p40 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191))) : A (G ((p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= p80 + p79 + p78 + p77 + p76 + p75 + p74 + p81))) : E (F ((((2 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113) AND (p165 <= p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164) AND ((p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 <= p88 + p87 + p86 + p85 + p84 + p83 + p82 + p89) OR (p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 <= p19))) OR (1 <= p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)))) : A (G ((((3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199) AND (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48)) OR (2 <= p39) OR (1 <= p147)))) : E (F (((p80 + p79 + p78 + p77 + p76 + p75 + p74 + p81 <= p148) AND (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164) AND ((3 <= p20) OR (3 <= p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)) AND (2 <= p73)))) : A (G ((((p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 <= p167) AND (p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= p20)) OR (p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= 2) OR (((p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113) OR (p39 <= p165)))))) : A (G ((p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= p19))) : A (G (((1 <= p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121) OR (3 <= p71 + p70 + p69 + p65 + p66 + p67 + p68 + p72)))) : A (G (((p40 <= p122) OR (p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8)))) : E (F (((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p122) AND (2 <= p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56)))) : A (G (((1 <= p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164) OR (2 <= p166) OR (p20 + 1 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) OR (p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 <= 2))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 214 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((1 <= p10))))
lola: processed formula length: 20
lola: 1 rewrites
lola: closed formula file PermAdmissibility-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((1 <= p10))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 229 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= 0) OR (p19 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= 0) OR (p19 <= 1))))
lola: processed formula length: 85
lola: 2 rewrites
lola: closed formula file PermAdmissibility-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((1 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199) AND (2 <= p19))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================

FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p40 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p40 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)))
lola: processed formula length: 70
lola: 2 rewrites
lola: closed formula file PermAdmissibility-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + 1 <= p40)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================

FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= p19)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= p19)))
lola: processed formula length: 70
lola: 2 rewrites
lola: closed formula file PermAdmissibility-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p19 + 1 <= p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================

FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 0) AND ((p22 <= 2) OR (p19 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 <= 0) AND ((p22 <= 2) OR (p19 <= 0)))))
lola: processed formula length: 102
lola: 2 rewrites
lola: closed formula file PermAdmissibility-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================

FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= p80 + p79 + p78 + p77 + p76 + p75 + p74 + p81)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= p80 + p79 + p78 + p77 + p76 + p75 + p74 + p81)))
lola: processed formula length: 112
lola: 2 rewrites
lola: closed formula file PermAdmissibility-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p80 + p79 + p78 + p77 + p76 + p75 + p74 + p81 + 1 <= p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================

FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121) OR (3 <= p71 + p70 + p69 + p65 + p66 + p67 + p68 + p72))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((1 <= p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121) OR (3 <= p71 + p70 + p69 + p65 + p66 + p67 + p68 + p72))))
lola: processed formula length: 127
lola: 2 rewrites
lola: closed formula file PermAdmissibility-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 37 markings, 36 edges
lola: ========================================

FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p122) AND (2 <= p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p122) AND (2 <= p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56))))
lola: processed formula length: 130
lola: 1 rewrites
lola: closed formula file PermAdmissibility-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 33 markings, 32 edges
lola: ========================================

FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p40 <= p122) OR (p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((p40 <= p122) OR (p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + 1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8))))
lola: processed formula length: 128
lola: 2 rewrites
lola: closed formula file PermAdmissibility-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p122 + 1 <= p40) AND (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality-8-0.sara

FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 9 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199) AND (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48)) OR (2 <= p39) OR (1 <= p147))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199) AND (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48)) OR (2 <= p39) OR (1 <= p147))))
lola: processed formula length: 212
lola: 2 rewrites
lola: closed formula file PermAdmissibility-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= 2) OR (p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + 1 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)) AND (p39 <= 1) AND (p147 <= 0))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================

FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 573 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164) OR (2 <= p166) OR (p20 + 1 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) OR (p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((1 <= p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164) OR (2 <= p166) OR (p20 + 1 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) OR (p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 <= 2))))
lola: processed formula length: 222
lola: 2 rewrites
lola: closed formula file PermAdmissibility-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 <= 0) AND (p166 <= 1) AND (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p20) AND (3 <= p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 81 markings, 80 edges
lola: ========================================
sara: try reading problem file PermAdmissibility-COL-10-ReachabilityCardinality-8-0.sara.

FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 687 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p165 <= p88 + p87 + p86 + p85 + p84 + p83 + p82 + p89) AND ((1 <= p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64) OR (1 <= p88 + p87 + p86 + p85 + p84 + p83 + p82 + p89) OR ((2 <= p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48) AND (p39 <= p73))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((p165 <= p88 + p87 + p86 + p85 + p84 + p83 + p82 + p89) AND ((1 <= p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64) OR (1 <= p88 + p87 + p86 + p85 + p84 + p83 + p82 + p89) OR ((2 <= p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48) AND (p39 <= p73))))))
lola: processed formula length: 257
lola: 2 rewrites
lola: closed formula file PermAdmissibility-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p88 + p87 + p86 + p85 + p84 + p83 + p82 + p89 + 1 <= p165) OR ((p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 <= 0) AND (p88 + p87 + p86 + p85 + p84 + p83 + p82 + p89 <= 0) AND ((p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 <= 1) OR (p73 + 1 <= p39))))
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-10-ReachabilityCardinality-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: ========================================

FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 859 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p80 + p79 + p78 + p77 + p76 + p75 + p74 + p81 <= p148) AND (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164) AND ((3 <= p20) OR (3 <= p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)) AND (2 <= p73))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((p80 + p79 + p78 + p77 + p76 + p75 + p74 + p81 <= p148) AND (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164) AND ((3 <= p20) OR (3 <= p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)) AND (2 <= p73))))
lola: processed formula length: 271
lola: 1 rewrites
lola: closed formula file PermAdmissibility-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p80 + p79 + p78 + p77 + p76 + p75 + p74 + p81 <= p148) AND (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164) AND ((3 <= p20) OR (3 <= p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30)) AND (2 <= p73))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-10-ReachabilityCardinality-12-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
sara: place or transition ordering is non-deterministic
lola: ========================================

FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1146 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p100 + p101 + p102 + p103 + p104 + p105 + p98 + p99 + 1 <= p167) AND (p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 <= 0) AND (((2 <= p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38) AND (p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 <= p9)) OR (p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 <= p39)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((p100 + p101 + p102 + p103 + p104 + p105 + p98 + p99 + 1 <= p167) AND (p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 <= 0) AND (((2 <= p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38) AND (p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 <= p9)) OR (p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 <= p39)))))
lola: processed formula length: 334
lola: 1 rewrites
lola: closed formula file PermAdmissibility-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p100 + p101 + p102 + p103 + p104 + p105 + p98 + p99 + 1 <= p167) AND (p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 <= 0) AND (((2 <= p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38) AND (p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 <= p9)) OR (p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 <= p39)))
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-10-ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 45 markings, 44 edges
lola: ========================================

FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1719 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 <= p167) AND (p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= p20)) OR (p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= 2) OR (((p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113) OR (p39 <= p165))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 <= p167) AND (p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= p20)) OR (p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 <= 2) OR (((p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113) OR (p39 <= p165))))))
lola: processed formula length: 338
lola: 2 rewrites
lola: closed formula file PermAdmissibility-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((p167 + 1 <= p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121) OR (p20 + 1 <= p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156)) AND (3 <= p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30) AND (((p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + 1 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138) AND (p165 + 1 <= p39))))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-10-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 71 markings, 70 edges
lola: ========================================

FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113) AND (p165 <= p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164) AND ((p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 <= p88 + p87 + p86 + p85 + p84 + p83 + p82 + p89) OR (p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 <= p19))) OR (1 <= p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((2 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113) AND (p165 <= p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164) AND ((p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 <= p88 + p87 + p86 + p85 + p84 + p83 + p82 + p89) OR (p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 <= p19))) OR (1 <= p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))))
lola: processed formula length: 367
lola: 1 rewrites
lola: closed formula file PermAdmissibility-COL-10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (((2 <= p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113) AND (p165 <= p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164) AND ((p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 <= p88 + p87 + p86 + p85 + p84 + p83 + p82 + p89) OR (p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 <= p19))) OR (1 <= p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30))
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-10-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-10-ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================

FORMULA PermAdmissibility-COL-10-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes yes no no yes no yes no no no no yes no
lola:
preliminary result: no no no yes yes no no yes no yes no no no no yes no
lola: memory consumption: 28892 KB
lola: time consumption: 131 seconds


BK_STOP 1527036315758

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-COL-10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-10.tgz
mv PermAdmissibility-COL-10 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is PermAdmissibility-COL-10, 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 r112-csrt-152666469500453"
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 ;