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

About the Execution of LoLA for PermAdmissibility-COL-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
178.730 99041.00 103924.00 39.10 TFTTTTTTTTTFTFFT 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 224K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 54K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PermAdmissibility-COL-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469500446
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527035687001

info: Time: 3600 - MCC
===========================================================================================
prep: translating PermAdmissibility-COL-05 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PermAdmissibility-COL-05 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking ReachabilityCardinality @ PermAdmissibility-COL-05 @ 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-05-ReachabilityCardinality.task
lola: LP says that atomic proposition is always true: (p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)
lola: E (F ((3 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207))) : A (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p28))) : E (F ((3 <= p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46))) : E (F (((p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + 1 <= p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (3 <= p90 + p89 + p88 + p87 + p91 + p92 + p93 + p94) AND (p191 <= 0)))) : E (F ((((p26 <= p8) OR (3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)) AND (1 <= p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36) AND (p38 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199)))) : E (F ((2 <= p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36))) : E (F ((((2 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) OR (p191 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)) AND ((2 <= p85 + p84 + p83 + p82 + p81 + p80 + p79 + p86) OR (3 <= p26) OR (3 <= p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54) OR (2 <= p172))))) : A (G (())) : E (F ((1 <= p181))) : E (F ((((2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) OR (p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 <= p145)) AND ((p181 <= p172) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p182)) AND (p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + 1 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190) AND (p38 <= 2)))) : E (F (((p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + 1 <= p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171) AND (p191 <= 0) AND ((p172 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118) OR (1 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143) OR (p127 + 1 <= p27))))) : A (G (((2 <= p9) OR (p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))) : E (F ((3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199))) : A (G ((((p28 <= 1) OR (p181 <= 0)) AND (p147 <= p85 + p84 + p83 + p82 + p81 + p80 + p79 + p86)))) : A (G (((3 <= p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) OR (p38 <= p191) OR (p85 + p84 + p83 + p82 + p81 + p80 + p79 + p86 + 1 <= p8) OR (1 <= p172)))) : E (F (((p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 <= 1) AND (p145 + 1 <= p182) AND ((p8 <= 1) OR (p127 + 1 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 217 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: closed formula file PermAdmissibility-COL-05-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: ========================================

FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 231 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p181)))
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 <= p181)))
lola: processed formula length: 19
lola: 4 rewrites
lola: closed formula file PermAdmissibility-COL-05-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 <= p181)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-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-05-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36)))
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 <= p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36)))
lola: processed formula length: 60
lola: 4 rewrites
lola: closed formula file PermAdmissibility-COL-05-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 <= p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-2-0.sara

FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)))
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 ((3 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)))
lola: processed formula length: 68
lola: 4 rewrites
lola: closed formula file PermAdmissibility-COL-05-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: (3 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 40 markings, 39 edges
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-3-0.sara
lola: ========================================

FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46)))
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 ((3 <= p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46)))
lola: processed formula length: 60
lola: 4 rewrites
lola: closed formula file PermAdmissibility-COL-05-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: (3 <= p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-4-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: 13 markings, 12 edges
lola: ========================================

FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199)))
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 ((3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199)))
lola: processed formula length: 68
lola: 4 rewrites
lola: closed formula file PermAdmissibility-COL-05-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: 25 markings, 24 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199)
lola:
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 6 will run for 347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p28)))
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 ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p28)))
lola: processed formula length: 54
lola: 5 rewrites
lola: closed formula file PermAdmissibility-COL-05-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: (p28 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)
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: 17 markings, 16 edges
lola: ========================================

FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p28 <= 1) OR (p181 <= 0)) AND (p147 <= p85 + p84 + p83 + p82 + p81 + p80 + p79 + p86))))
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 ((((p28 <= 1) OR (p181 <= 0)) AND (p147 <= p85 + p84 + p83 + p82 + p81 + p80 + p79 + p86))))
lola: processed formula length: 98
lola: 5 rewrites
lola: closed formula file PermAdmissibility-COL-05-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: (((2 <= p28) AND (1 <= p181)) OR (p85 + p84 + p83 + p82 + p81 + p80 + p79 + p86 + 1 <= p147))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-7-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: 7 markings, 6 edges

FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 434 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p9) OR (p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17))))
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 (((2 <= p9) OR (p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17))))
lola: processed formula length: 128
lola: 5 rewrites
lola: closed formula file PermAdmissibility-COL-05-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: ((p9 <= 1) AND (p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + 1 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-8-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: 8 markings, 7 edges

FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 496 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) OR (p38 <= p191) OR (p85 + p84 + p83 + p82 + p81 + p80 + p79 + p86 + 1 <= p8) OR (1 <= p172))))
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 <= p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) OR (p38 <= p191) OR (p85 + p84 + p83 + p82 + p81 + p80 + p79 + p86 + 1 <= p8) OR (1 <= p172))))
lola: processed formula length: 158
lola: 5 rewrites
lola: closed formula file PermAdmissibility-COL-05-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: 9 markings, 8 edges
lola: ========================================

FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 578 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 <= 1) AND (p145 + 1 <= p182) AND ((p8 <= 1) OR (p127 + 1 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190)))))
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 (((p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 <= 1) AND (p145 + 1 <= p182) AND ((p8 <= 1) OR (p127 + 1 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190)))))
lola: processed formula length: 181
lola: 4 rewrites
lola: closed formula file PermAdmissibility-COL-05-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: ========================================
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: 30 markings, 29 edges
lola: ========================================

FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 694 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + 1 <= p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (3 <= p90 + p89 + p88 + p87 + p91 + p92 + p93 + p94) AND (p191 <= 0))))
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 (((p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + 1 <= p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46) AND (3 <= p90 + p89 + p88 + p87 + p91 + p92 + p93 + p94) AND (p191 <= 0))))
lola: processed formula length: 191
lola: 4 rewrites
lola: closed formula file PermAdmissibility-COL-05-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: 16 markings, 15 edges
lola: ========================================

FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 868 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) OR (p191 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)) AND ((2 <= p85 + p84 + p83 + p82 + p81 + p80 + p79 + p86) OR (3 <= p26) OR (3 <= p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54) OR (2 <= p172)))))
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 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) OR (p191 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)) AND ((2 <= p85 + p84 + p83 + p82 + p81 + p80 + p79 + p86) OR (3 <= p26) OR (3 <= p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54) OR (2 <= p172)))))
lola: processed formula length: 287
lola: 4 rewrites
lola: closed formula file PermAdmissibility-COL-05-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 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) OR (p191 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)) AND ((2 <= p85 + p84 + p83 + p82 + p81 + p80 + p79 + p86) OR (3 <= p26) OR (3 <= p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54) OR (2 <= p172)))
lola: state equation: Generated DNF with 16 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 33 markings, 32 edges
lola:
state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-12-0.sara
lola: ========================================
FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1157 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p26 <= p8) OR (3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)) AND (1 <= p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36) AND (p38 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199))))
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 ((((p26 <= p8) OR (3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)) AND (1 <= p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36) AND (p38 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199))))
lola: processed formula length: 204
lola: 4 rewrites
lola: closed formula file PermAdmissibility-COL-05-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: (((p26 <= p8) OR (3 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)) AND (1 <= p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36) AND (p38 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================

FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1736 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + 1 <= p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171) AND (p191 <= 0) AND ((p172 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118) OR (1 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143) OR (p127 + 1 <= p27)))))
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 (((p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + 1 <= p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171) AND (p191 <= 0) AND ((p172 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118) OR (1 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143) OR (p127 + 1 <= p27)))))
lola: processed formula length: 299
lola: 4 rewrites
lola: closed formula file PermAdmissibility-COL-05-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: ((p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + 1 <= p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171) AND (p191 <= 0) AND ((p172 <= p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118) OR (1 <= p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143) OR (p127 + 1 <= p27)))
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-14-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: 10 markings, 9 edges

FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3471 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) OR (p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 <= p145)) AND ((p181 <= p172) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p182)) AND (p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + 1 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190) AND (p38 <= 2))))
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 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) OR (p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 <= p145)) AND ((p181 <= p172) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p182)) AND (p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + 1 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190) AND (p38 <= 2))))
lola: processed formula length: 341
lola: 4 rewrites
lola: closed formula file PermAdmissibility-COL-05-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 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17) OR (p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 <= p145)) AND ((p181 <= p172) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p182)) AND (p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + 1 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190) AND (p38 <= 2))
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-05-ReachabilityCardinality-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola: ========================================

FORMULA PermAdmissibility-COL-05-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes yes yes yes yes yes yes yes yes no yes no no yes
lola:
preliminary result: yes no yes yes yes yes yes yes yes yes yes no yes no no yes
lola: memory consumption: 27760 KB
lola: time consumption: 99 seconds

BK_STOP 1527035786042

--------------------
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-05"
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-05.tgz
mv PermAdmissibility-COL-05 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-05, 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-152666469500446"
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 ;