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 212K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.2K 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 7.7K 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 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 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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-50, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469500467
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527036701738

info: Time: 3600 - MCC
===========================================================================================
prep: translating PermAdmissibility-COL-50 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PermAdmissibility-COL-50 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking ReachabilityCardinality @ PermAdmissibility-COL-50 @ 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-50-ReachabilityCardinality.task
lola: LP says that atomic proposition is always true: (p190 <= p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120)
lola: always true
lola: LP says that atomic proposition is always true: (p112 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130)
lola: LP says that atomic proposition is always true: (p50 <= p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148)
lola: place invariant simplifies atomic proposition
lola: before: (p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138)
lola: after: (0 <= 0)
lola: always true
lola: E (F ((2 <= p49))) : A (G (((p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 <= 0) OR (p121 <= 0)))) : E (F (())) : E (F ((p207 + 1 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76))) : A (G ((((3 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76) OR (2 <= p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31) OR (1 <= p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120) OR (1 <= p139))))) : E (F ((1 <= p140))) : A (G (((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 <= p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181) OR ((p60 <= 0))))) : E (F (((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p139) AND (p190 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15)))) : A (G (((p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + 1 <= p149) OR (p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + 1 <= p190) OR (p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 <= 2) OR (p139 + 1 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84)))) : A (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p140))) : E (F ((p85 + 1 <= p207))) : E (F ((((2 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206) AND (p50 <= p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173) AND (p85 <= 2)) OR (2 <= p32)))) : E (F ((((2 <= p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148) AND (p59 + 1 <= p139)) OR ((2 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157))))) : A (G ((((p50 <= p121) AND (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) OR ((p59 <= 0) AND (p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 <= 2))))) : A (G (((p59 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40) OR ((p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + 1 <= p103) AND (p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 <= 0))))) : E (F ((((3 <= p112) AND (2 <= p190)) OR (p103 + 1 <= p140) OR ((p121 + 1 <= p112) AND (p207 + 1 <= p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 214 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: closed formula file PermAdmissibility-COL-50-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA PermAdmissibility-COL-50-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p49)))
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 <= p49)))
lola: processed formula length: 18
lola: 4 rewrites
lola: closed formula file PermAdmissibility-COL-50-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 <= p49)
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: 17 markings, 16 edges
lola: ========================================

FORMULA PermAdmissibility-COL-50-ReachabilityCardinality-0 TRUE 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: E (F ((1 <= p140)))
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 <= p140)))
lola: processed formula length: 19
lola: 4 rewrites
lola: closed formula file PermAdmissibility-COL-50-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 <= p140)
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: ========================================

FORMULA PermAdmissibility-COL-50-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p85 + 1 <= 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 ((p85 + 1 <= p207)))
lola: processed formula length: 25
lola: 4 rewrites
lola: closed formula file PermAdmissibility-COL-50-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: (p85 + 1 <= p207)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-50-ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-50-ReachabilityCardinality-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 210 markings, 209 edges
lola: ========================================

FORMULA PermAdmissibility-COL-50-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 <= 0) OR (p121 <= 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 (((p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 <= 0) OR (p121 <= 0))))
lola: processed formula length: 86
lola: 5 rewrites
lola: closed formula file PermAdmissibility-COL-50-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 <= p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189) AND (1 <= p121))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-50-ReachabilityCardinality-4-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-50-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p140)))
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 <= p140)))
lola: processed formula length: 55
lola: 5 rewrites
lola: closed formula file PermAdmissibility-COL-50-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: (p140 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-50-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: 10 markings, 9 edges
lola: ========================================

FORMULA PermAdmissibility-COL-50-ReachabilityCardinality-9 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: E (F ((p207 + 1 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76)))
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 ((p207 + 1 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76)))
lola: processed formula length: 67
lola: 4 rewrites
lola: closed formula file PermAdmissibility-COL-50-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: (p207 + 1 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-50-ReachabilityCardinality-6-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: 17 markings, 16 edges
lola: ========================================

FORMULA PermAdmissibility-COL-50-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p139) AND (p190 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))))
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 (((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p139) AND (p190 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))))
lola: processed formula length: 121
lola: 4 rewrites
lola: closed formula file PermAdmissibility-COL-50-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: ((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p139) AND (p190 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-50-ReachabilityCardinality-7-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: 51 markings, 50 edges

FORMULA PermAdmissibility-COL-50-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p112) AND (2 <= p190)) OR (p103 + 1 <= p140) OR ((p121 + 1 <= p112) AND (p207 + 1 <= p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120)))))
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 <= p112) AND (2 <= p190)) OR (p103 + 1 <= p140) OR ((p121 + 1 <= p112) AND (p207 + 1 <= p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120)))))
lola: processed formula length: 159
lola: 4 rewrites
lola: closed formula file PermAdmissibility-COL-50-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 <= p112) AND (2 <= p190)) OR (p103 + 1 <= p140) OR ((p121 + 1 <= p112) AND (p207 + 1 <= p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120)))
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-50-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-50-ReachabilityCardinality-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 305 markings, 304 edges
lola: ========================================

FORMULA PermAdmissibility-COL-50-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 <= p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181) OR ((p60 <= 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 (((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 <= p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181) OR ((p60 <= 0)))))
lola: processed formula length: 139
lola: 5 rewrites
lola: closed formula file PermAdmissibility-COL-50-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: ((p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + 1 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198) AND ((1 <= p60)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-50-ReachabilityCardinality-9-0.sara
lola: 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-50-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 571 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148) AND (p59 + 1 <= p139)) OR ((2 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157)))))
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 <= p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148) AND (p59 + 1 <= p139)) OR ((2 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157)))))
lola: processed formula length: 161
lola: 4 rewrites
lola: closed formula file PermAdmissibility-COL-50-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 <= p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148) AND (p59 + 1 <= p139)) OR ((2 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157)))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-50-ReachabilityCardinality-10-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: 9 markings, 8 edges
lola: ========================================

FORMULA PermAdmissibility-COL-50-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 686 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206) AND (p50 <= p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173) AND (p85 <= 2)) OR (2 <= p32))))
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 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206) AND (p50 <= p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173) AND (p85 <= 2)) OR (2 <= p32))))
lola: processed formula length: 169
lola: 4 rewrites
lola: closed formula file PermAdmissibility-COL-50-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 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206) AND (p50 <= p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173) AND (p85 <= 2)) OR (2 <= p32))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-50-ReachabilityCardinality-11-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================

FORMULA PermAdmissibility-COL-50-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 857 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76) OR (2 <= p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31) OR (1 <= p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120) OR (1 <= p139)))))
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 <= p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76) OR (2 <= p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31) OR (1 <= p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120) OR (1 <= p139)))))
lola: processed formula length: 202
lola: 5 rewrites
lola: closed formula file PermAdmissibility-COL-50-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: (((p75 + p74 + p73 + p72 + p71 + p70 + p69 + p76 <= 2) AND (p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 <= 1) AND (p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 <= 0) AND (p139 <= 0)))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-50-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-50-ReachabilityCardinality-12-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 300 markings, 299 edges
lola: ========================================

FORMULA PermAdmissibility-COL-50-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1143 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p59 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40) OR ((p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + 1 <= p103) AND (p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 <= 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 (((p59 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40) OR ((p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + 1 <= p103) AND (p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 <= 0)))))
lola: processed formula length: 203
lola: 5 rewrites
lola: closed formula file PermAdmissibility-COL-50-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: ((p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + 1 <= p59) AND ((p103 <= p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148) OR (1 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-50-ReachabilityCardinality-13-0.sara
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-50-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1715 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p50 <= p121) AND (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) OR ((p59 <= 0) AND (p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 <= 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 ((((p50 <= p121) AND (p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)) OR ((p59 <= 0) AND (p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 <= 2)))))
lola: processed formula length: 198
lola: 5 rewrites
lola: closed formula file PermAdmissibility-COL-50-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: (((p121 + 1 <= p50) OR (p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + 1 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15)) AND ((1 <= p59) OR (3 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138)))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-50-ReachabilityCardinality-14-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: 11 markings, 10 edges
lola: ========================================

FORMULA PermAdmissibility-COL-50-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + 1 <= p149) OR (p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + 1 <= p190) OR (p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 <= 2) OR (p139 + 1 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84))))
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 (((p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + 1 <= p149) OR (p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + 1 <= p190) OR (p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 <= 2) OR (p139 + 1 <= p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84))))
lola: processed formula length: 262
lola: 5 rewrites
lola: closed formula file PermAdmissibility-COL-50-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: ((p149 <= p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148) AND (p190 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68) AND (3 <= p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48) AND (p83 + p82 + p81 + p80 + p79 + p78 + p77 + p84 <= p139))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-50-ReachabilityCardinality-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 95 markings, 94 edges
lola: ========================================

FORMULA PermAdmissibility-COL-50-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes no yes no yes no no yes yes yes no no yes
lola:
preliminary result: yes no no yes no yes no yes no no yes yes yes no no yes
lola: memory consumption: 27876 KB
lola: time consumption: 140 seconds

BK_STOP 1527036841164

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