Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.................
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.5K 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 9.2K 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 3.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 irma4mcc-full
Input is PermAdmissibility-COL-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-csrt-152666472700437
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527141189804


BK_STOP 1527142490317

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PermAdmissibility-COL-02 as instance name.
Using PermAdmissibility as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1581329, 'Memory': 15944.15, 'Tool': 'lola'}, {'Time': 1758215, 'Memory': 15952.46, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PermAdmissibility-COL-02...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PermAdmissibility-COL-02: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-02: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PermAdmissibility-COL-02 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 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: 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-02-CTLCardinality.task
lola: E (X ((((p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 <= p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85) OR (p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206) OR ((p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 <= p27) AND (2 <= p27))) AND A (F ((2 <= p86)))))) : E (G (((p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 <= 0) OR (p76 <= 0) OR (3 <= p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95)))) : (E (G (((p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) OR (p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95 <= 1)))) AND E (X ((p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 <= p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146)))) : A (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p180) AND (3 <= p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179) AND (p87 + 1 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130) AND (3 <= p197) AND (3 <= p76) AND (p86 <= 1)))) : (NOT((E (F ((p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206))) AND A (X ((2 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16))))) OR (A (G (((2 <= p122) AND (p180 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67)))) OR E (G (((3 <= p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179) OR (3 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188)))))) : E (G (E (F (((p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 <= p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85) AND (p163 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))))) : E (G (NOT(A (G ((3 <= p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95)))))) : NOT(A (F (A (G ((p121 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))))) : E (F (((1 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND E (X ((3 <= p207)))))) : A (G ((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= 2))) : NOT(A (G (E (F ((3 <= p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146)))))) : A ((E (F ((p122 <= p86))) U (p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43))) : A (X (E (((p122 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188) U (3 <= p180))))) : E (G (E (((3 <= p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179) U (1 <= p86))))) : (A (G (((p207 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16) OR (p87 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130) OR (p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 <= 1)))) OR E (G (((p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 <= p25) OR (3 <= p26) OR (p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 <= 2))))) : ((3 <= p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162) OR E (G ((p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((((p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 <= p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85) OR (p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206) OR ((p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 <= p27) AND (2 <= p27))) AND A (F ((2 <= p86))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((((p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 <= p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85) OR (p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206) OR ((p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 <= p27) AND (2 <= p27))) AND A(TRUE U (2 <= p86))))
lola: processed formula length: 330
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 51 markings, 53 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 <= 0) OR (p76 <= 0) OR (3 <= p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((1 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND (1 <= p76) AND (p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95 <= 2))))
lola: processed formula length: 141
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 37 markings, 36 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) OR (p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95 <= 1)))) AND E (X ((p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 <= p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) OR (p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + 1 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35) AND (2 <= p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95))))
lola: processed formula length: 182
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 33 markings, 32 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 <= p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 <= p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146))
lola: processed formula length: 108
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p180) AND (3 <= p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179) AND (p87 + 1 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130) AND (3 <= p197) AND (3 <= p76) AND (p86 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p180) AND (3 <= p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179) AND (p87 + 1 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130) AND (3 <= p197) AND (3 <= p76) AND (p86 <= 1))))
lola: processed formula: A (F (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p180) AND (3 <= p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179) AND (p87 + 1 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130) AND (3 <= p197) AND (3 <= p76) AND (p86 <= 1))))
lola: processed formula length: 239
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 33 markings, 33 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((E (F ((p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206))) AND A (X ((2 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16))))) OR (A (G (((2 <= p122) AND (p180 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67)))) OR E (G (((3 <= p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179) OR (3 <= p181 + p182 + p183 + p184 + p185 + p186 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + 1 <= p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 <= 1))
lola: processed formula length: 55
lola: 9 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p122) AND (p180 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((3 <= p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179) OR (3 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 <= 2) AND (p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= 2))))
lola: processed formula length: 142
lola: 10 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 956 markings, 1276 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 <= p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85) AND (p163 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U ((p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 <= p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85) AND (p163 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35))))))
lola: processed formula length: 196
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 33 markings, 76 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (G ((3 <= p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p90 + p89 + p88 + p91 + p92 + p93 + p94 + p95 <= 2)))))
lola: processed formula length: 82
lola: 5 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 33 markings, 73 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (G ((p121 <= p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + 1 <= p121)))))
lola: processed formula length: 89
lola: 7 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 920653 markings, 2718149 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1764866 markings, 5178819 edges, 168843 markings/sec, 5 secs
lola: 2678306 markings, 7521562 edges, 182688 markings/sec, 10 secs
lola: 3541206 markings, 9865409 edges, 172580 markings/sec, 15 secs
lola: 4435911 markings, 12442552 edges, 178941 markings/sec, 20 secs
lola: 5287741 markings, 14720004 edges, 170366 markings/sec, 25 secs
lola: 6175963 markings, 17209035 edges, 177644 markings/sec, 30 secs
lola: 6993508 markings, 19638821 edges, 163509 markings/sec, 35 secs
lola: 7850492 markings, 21854161 edges, 171397 markings/sec, 40 secs
lola: 8649171 markings, 24137252 edges, 159736 markings/sec, 45 secs
lola: 9461443 markings, 26314252 edges, 162454 markings/sec, 50 secs
lola: 10256764 markings, 28705121 edges, 159064 markings/sec, 55 secs
lola: 11037626 markings, 31024146 edges, 156172 markings/sec, 60 secs
lola: 11785735 markings, 33243750 edges, 149622 markings/sec, 65 secs
lola: 12529454 markings, 35464573 edges, 148744 markings/sec, 70 secs
lola: 13303119 markings, 37774193 edges, 154733 markings/sec, 75 secs
lola: 14034994 markings, 39947707 edges, 146375 markings/sec, 80 secs
lola: 14865020 markings, 42213323 edges, 166005 markings/sec, 85 secs
lola: 15652609 markings, 44359397 edges, 157518 markings/sec, 90 secs
lola: 16440170 markings, 46557866 edges, 157512 markings/sec, 95 secs
lola: 17246115 markings, 48718213 edges, 161189 markings/sec, 100 secs
lola: 17974673 markings, 50803428 edges, 145712 markings/sec, 105 secs
lola: 18644285 markings, 52791246 edges, 133922 markings/sec, 110 secs
lola: 19328891 markings, 54636769 edges, 136921 markings/sec, 115 secs
lola: 20106874 markings, 56759079 edges, 155597 markings/sec, 120 secs
lola: 20859125 markings, 58813356 edges, 150450 markings/sec, 125 secs
lola: 21613281 markings, 60842707 edges, 150831 markings/sec, 130 secs
lola: 22344745 markings, 62942043 edges, 146293 markings/sec, 135 secs
lola: 23054677 markings, 64907817 edges, 141986 markings/sec, 140 secs
lola: 23785614 markings, 66928770 edges, 146187 markings/sec, 145 secs
lola: 24558476 markings, 69015725 edges, 154572 markings/sec, 150 secs
lola: 25294559 markings, 71075576 edges, 147217 markings/sec, 155 secs
lola: 25997397 markings, 73054941 edges, 140568 markings/sec, 160 secs
lola: 26719640 markings, 75138609 edges, 144449 markings/sec, 165 secs
lola: 27451361 markings, 77062124 edges, 146344 markings/sec, 170 secs
lola: 28162337 markings, 79005190 edges, 142195 markings/sec, 175 secs
lola: 28841874 markings, 80909489 edges, 135907 markings/sec, 180 secs
lola: 29575462 markings, 82989409 edges, 146718 markings/sec, 185 secs
lola: 30279900 markings, 84887410 edges, 140888 markings/sec, 190 secs
lola: 30979744 markings, 86821786 edges, 139969 markings/sec, 195 secs
lola: 31682891 markings, 88784163 edges, 140629 markings/sec, 200 secs
lola: 32404627 markings, 90904734 edges, 144347 markings/sec, 205 secs
lola: 33179582 markings, 93297762 edges, 154991 markings/sec, 210 secs
lola: 33918131 markings, 95632733 edges, 147710 markings/sec, 215 secs
lola: 34673306 markings, 97894897 edges, 151035 markings/sec, 220 secs
lola: 35458062 markings, 100079625 edges, 156951 markings/sec, 225 secs
lola: 36263437 markings, 102213973 edges, 161075 markings/sec, 230 secs
lola: 37036715 markings, 104350659 edges, 154656 markings/sec, 235 secs
lola: 37784123 markings, 106436708 edges, 149482 markings/sec, 240 secs
lola: 38519839 markings, 108661247 edges, 147143 markings/sec, 245 secs
lola: 39253706 markings, 110862841 edges, 146773 markings/sec, 250 secs
lola: 40030609 markings, 112940348 edges, 155381 markings/sec, 255 secs
lola: 40776575 markings, 115032697 edges, 149193 markings/sec, 260 secs
lola: 41515547 markings, 117136361 edges, 147794 markings/sec, 265 secs
lola: 42239559 markings, 119388884 edges, 144802 markings/sec, 270 secs
lola: 42953993 markings, 121603147 edges, 142887 markings/sec, 275 secs
lola: 43660006 markings, 123776822 edges, 141203 markings/sec, 280 secs
lola: 44375587 markings, 125853509 edges, 143116 markings/sec, 285 secs
lola: 45170105 markings, 127738483 edges, 158904 markings/sec, 290 secs
lola: 45865754 markings, 129876654 edges, 139130 markings/sec, 295 secs
lola: 46569050 markings, 131958558 edges, 140659 markings/sec, 300 secs
lola: 47311049 markings, 133869556 edges, 148400 markings/sec, 305 secs
lola: 48016826 markings, 136023692 edges, 141155 markings/sec, 310 secs
lola: 48690052 markings, 138156761 edges, 134645 markings/sec, 315 secs
lola: 49374836 markings, 140285503 edges, 136957 markings/sec, 320 secs
lola: 50059445 markings, 142356788 edges, 136922 markings/sec, 325 secs
lola: 50746310 markings, 144480384 edges, 137373 markings/sec, 330 secs
lola: 51429731 markings, 146565611 edges, 136684 markings/sec, 335 secs
lola: 52085980 markings, 148638306 edges, 131250 markings/sec, 340 secs
lola: 52747762 markings, 150660944 edges, 132356 markings/sec, 345 secs
lola: 53420455 markings, 152686601 edges, 134539 markings/sec, 350 secs
lola: 54075871 markings, 154736864 edges, 131083 markings/sec, 355 secs
lola: 54732151 markings, 156790669 edges, 131256 markings/sec, 360 secs
lola: 55468249 markings, 159131300 edges, 147220 markings/sec, 365 secs
lola: 56181439 markings, 161381931 edges, 142638 markings/sec, 370 secs
lola: 56921260 markings, 163526473 edges, 147964 markings/sec, 375 secs
lola: 57687041 markings, 165643829 edges, 153156 markings/sec, 380 secs
lola: 58447533 markings, 167740247 edges, 152098 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND E (X ((3 <= p207))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U ((1 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43) AND EX((3 <= p207))))
lola: processed formula length: 84
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1017598 markings, 3012985 edges, 2933637760394723328 markings/sec, 0 secs
lola: 1881844 markings, 5483175 edges, 172849 markings/sec, 5 secs
lola: 2651756 markings, 7464738 edges, 153982 markings/sec, 10 secs
lola: 3459747 markings, 9690699 edges, 161598 markings/sec, 15 secs
lola: 4330959 markings, 12154149 edges, 174242 markings/sec, 20 secs
lola: 5117624 markings, 14258155 edges, 157333 markings/sec, 25 secs
lola: 5933798 markings, 16485468 edges, 163235 markings/sec, 30 secs
lola: 6827376 markings, 19151071 edges, 178716 markings/sec, 35 secs
lola: 7618180 markings, 21323413 edges, 158161 markings/sec, 40 secs
lola: 8401784 markings, 23417004 edges, 156721 markings/sec, 45 secs
lola: 9135958 markings, 25363134 edges, 146835 markings/sec, 50 secs
lola: 9848223 markings, 27489987 edges, 142453 markings/sec, 55 secs
lola: 10499755 markings, 29421484 edges, 130306 markings/sec, 60 secs
lola: 11137856 markings, 31340276 edges, 127620 markings/sec, 65 secs
lola: 11771249 markings, 33205221 edges, 126679 markings/sec, 70 secs
lola: 12382505 markings, 35042822 edges, 122251 markings/sec, 75 secs
lola: 13014888 markings, 36930499 edges, 126477 markings/sec, 80 secs
lola: 13644070 markings, 38796684 edges, 125836 markings/sec, 85 secs
lola: 14414043 markings, 41035526 edges, 153995 markings/sec, 90 secs
lola: 15154846 markings, 42997847 edges, 148161 markings/sec, 95 secs
lola: 15916535 markings, 45058440 edges, 152338 markings/sec, 100 secs
lola: 16709376 markings, 47301701 edges, 158568 markings/sec, 105 secs
lola: 17356941 markings, 48993831 edges, 129513 markings/sec, 110 secs
lola: 17983105 markings, 50828729 edges, 125233 markings/sec, 115 secs
lola: 18567927 markings, 52546207 edges, 116964 markings/sec, 120 secs
lola: 19153897 markings, 54267259 edges, 117194 markings/sec, 125 secs
lola: 19814629 markings, 55936722 edges, 132146 markings/sec, 130 secs
lola: 20485111 markings, 57889351 edges, 134096 markings/sec, 135 secs
lola: 21181243 markings, 59706764 edges, 139226 markings/sec, 140 secs
lola: 21837884 markings, 61482307 edges, 131328 markings/sec, 145 secs
lola: 22457279 markings, 63260279 edges, 123879 markings/sec, 150 secs
lola: 23111108 markings, 65079961 edges, 130766 markings/sec, 155 secs
lola: 23715578 markings, 66749382 edges, 120894 markings/sec, 160 secs
lola: 24414400 markings, 68647443 edges, 139764 markings/sec, 165 secs
lola: 25108498 markings, 70571287 edges, 138820 markings/sec, 170 secs
lola: 25676995 markings, 72145131 edges, 113699 markings/sec, 175 secs
lola: 26384531 markings, 74148405 edges, 141507 markings/sec, 180 secs
lola: 27004615 markings, 75845624 edges, 124017 markings/sec, 185 secs
lola: 27683955 markings, 77661085 edges, 135868 markings/sec, 190 secs
lola: 28399966 markings, 79675065 edges, 143202 markings/sec, 195 secs
lola: 28979320 markings, 81314667 edges, 115871 markings/sec, 200 secs
lola: 29656813 markings, 83213971 edges, 135499 markings/sec, 205 secs
lola: 30280186 markings, 84887962 edges, 124675 markings/sec, 210 secs
lola: 30914781 markings, 86628781 edges, 126919 markings/sec, 215 secs
lola: 31550510 markings, 88396285 edges, 127146 markings/sec, 220 secs
lola: 32138440 markings, 90083086 edges, 117586 markings/sec, 225 secs
lola: 32913658 markings, 92494085 edges, 155044 markings/sec, 230 secs
lola: 33701875 markings, 94932727 edges, 157643 markings/sec, 235 secs
lola: 34450683 markings, 97211145 edges, 149762 markings/sec, 240 secs
lola: 35151795 markings, 99179689 edges, 140222 markings/sec, 245 secs
lola: 35870761 markings, 101135656 edges, 143793 markings/sec, 250 secs
lola: 36566434 markings, 103054636 edges, 139135 markings/sec, 255 secs
lola: 37257173 markings, 104974606 edges, 138148 markings/sec, 260 secs
lola: 37933588 markings, 106851324 edges, 135283 markings/sec, 265 secs
lola: 38668549 markings, 109112818 edges, 146992 markings/sec, 270 secs
lola: 39368764 markings, 111156573 edges, 140043 markings/sec, 275 secs
lola: 40039875 markings, 112973822 edges, 134222 markings/sec, 280 secs
lola: 40722865 markings, 114917532 edges, 136598 markings/sec, 285 secs
lola: 41378062 markings, 116711719 edges, 131039 markings/sec, 290 secs
lola: 42123824 markings, 119032204 edges, 149152 markings/sec, 295 secs
lola: 42906330 markings, 121451163 edges, 156501 markings/sec, 300 secs
lola: 43609751 markings, 123643358 edges, 140684 markings/sec, 305 secs
lola: 44304417 markings, 125702032 edges, 138933 markings/sec, 310 secs
lola: 44889508 markings, 127013772 edges, 117018 markings/sec, 315 secs
lola: 45574391 markings, 128975683 edges, 136977 markings/sec, 320 secs
lola: 46272507 markings, 131133762 edges, 139623 markings/sec, 325 secs
lola: 46874806 markings, 132679703 edges, 120460 markings/sec, 330 secs
lola: 47464035 markings, 134328885 edges, 117846 markings/sec, 335 secs
lola: 48075639 markings, 136210422 edges, 122321 markings/sec, 340 secs
lola: 48688415 markings, 138148556 edges, 122555 markings/sec, 345 secs
lola: 49274026 markings, 139970517 edges, 117122 markings/sec, 350 secs
lola: 49881462 markings, 141806467 edges, 121487 markings/sec, 355 secs
lola: 50488395 markings, 143680707 edges, 121387 markings/sec, 360 secs
lola: 51109939 markings, 145604984 edges, 124309 markings/sec, 365 secs
lola: 51722599 markings, 147458859 edges, 122532 markings/sec, 370 secs
lola: 52307538 markings, 149280835 edges, 116988 markings/sec, 375 secs
lola: 52889243 markings, 151073485 edges, 116341 markings/sec, 380 secs
lola: 53475273 markings, 152859727 edges, 117206 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-02-CTLCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (E (F ((3 <= p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (3 <= p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146))))
lola: processed formula length: 85
lola: 8 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 956804 markings, 2832746 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1808010 markings, 5301450 edges, 170241 markings/sec, 5 secs
lola: 2712543 markings, 7619552 edges, 180907 markings/sec, 10 secs
lola: 3573376 markings, 9938011 edges, 172167 markings/sec, 15 secs
lola: 4408818 markings, 12368092 edges, 167088 markings/sec, 20 secs
lola: 5298966 markings, 14751596 edges, 178030 markings/sec, 25 secs
lola: 6134361 markings, 17089247 edges, 167079 markings/sec, 30 secs
lola: 6941440 markings, 19486620 edges, 161416 markings/sec, 35 secs
lola: 7815747 markings, 21775315 edges, 174861 markings/sec, 40 secs
lola: 8614970 markings, 24034315 edges, 159845 markings/sec, 45 secs
lola: 9415792 markings, 26179234 edges, 160164 markings/sec, 50 secs
lola: 10179980 markings, 28469963 edges, 152838 markings/sec, 55 secs
lola: 10919266 markings, 30681809 edges, 147857 markings/sec, 60 secs
lola: 11655929 markings, 32868032 edges, 147333 markings/sec, 65 secs
lola: 12387973 markings, 35057431 edges, 146409 markings/sec, 70 secs
lola: 13117895 markings, 37235078 edges, 145984 markings/sec, 75 secs
lola: 13893592 markings, 39534777 edges, 155139 markings/sec, 80 secs
lola: 14733333 markings, 41876043 edges, 167948 markings/sec, 85 secs
lola: 15537659 markings, 44059484 edges, 160865 markings/sec, 90 secs
lola: 16330176 markings, 46236467 edges, 158503 markings/sec, 95 secs
lola: 17112046 markings, 48365773 edges, 156374 markings/sec, 100 secs
lola: 17859100 markings, 50469581 edges, 149411 markings/sec, 105 secs
lola: 18600609 markings, 52643041 edges, 148302 markings/sec, 110 secs
lola: 19330926 markings, 54640817 edges, 146063 markings/sec, 115 secs
lola: 20107130 markings, 56759572 edges, 155241 markings/sec, 120 secs
lola: 20841884 markings, 58764033 edges, 146951 markings/sec, 125 secs
lola: 21582395 markings, 60770851 edges, 148102 markings/sec, 130 secs
lola: 22331616 markings, 62901766 edges, 149844 markings/sec, 135 secs
lola: 23054263 markings, 64905723 edges, 144529 markings/sec, 140 secs
lola: 23745021 markings, 66811547 edges, 138152 markings/sec, 145 secs
lola: 24459466 markings, 68737580 edges, 142889 markings/sec, 150 secs
lola: 25177369 markings, 70745451 edges, 143581 markings/sec, 155 secs
lola: 25846069 markings, 72641080 edges, 133740 markings/sec, 160 secs
lola: 26591808 markings, 74731969 edges, 149148 markings/sec, 165 secs
lola: 27319100 markings, 76690461 edges, 145458 markings/sec, 170 secs
lola: 28088689 markings, 78788734 edges, 153918 markings/sec, 175 secs
lola: 28791584 markings, 80760064 edges, 140579 markings/sec, 180 secs
lola: 29591396 markings, 83026208 edges, 159962 markings/sec, 185 secs
lola: 30336308 markings, 85046491 edges, 148982 markings/sec, 190 secs
lola: 31070842 markings, 87051739 edges, 146907 markings/sec, 195 secs
lola: 31768702 markings, 89073321 edges, 139572 markings/sec, 200 secs
lola: 32558883 markings, 91368735 edges, 158036 markings/sec, 205 secs
lola: 33330673 markings, 93781499 edges, 154358 markings/sec, 210 secs
lola: 34082256 markings, 96138263 edges, 150317 markings/sec, 215 secs
lola: 34868127 markings, 98482286 edges, 157174 markings/sec, 220 secs
lola: 35687829 markings, 100655267 edges, 163940 markings/sec, 225 secs
lola: 36477073 markings, 102781130 edges, 157849 markings/sec, 230 secs
lola: 37228090 markings, 104885410 edges, 150203 markings/sec, 235 secs
lola: 37978895 markings, 106988619 edges, 150161 markings/sec, 240 secs
lola: 38692460 markings, 109203520 edges, 142713 markings/sec, 245 secs
lola: 39430113 markings, 111296861 edges, 147531 markings/sec, 250 secs
lola: 40175167 markings, 113407013 edges, 149011 markings/sec, 255 secs
lola: 40923815 markings, 115438448 edges, 149730 markings/sec, 260 secs
lola: 41672647 markings, 117619878 edges, 149766 markings/sec, 265 secs
lola: 42396181 markings, 119862613 edges, 144707 markings/sec, 270 secs
lola: 43093501 markings, 122045035 edges, 139464 markings/sec, 275 secs
lola: 43809207 markings, 124198273 edges, 143141 markings/sec, 280 secs
lola: 44580821 markings, 126306727 edges, 154323 markings/sec, 285 secs
lola: 45364060 markings, 128329261 edges, 156648 markings/sec, 290 secs
lola: 46054642 markings, 130466330 edges, 138116 markings/sec, 295 secs
lola: 46786493 markings, 132461424 edges, 146370 markings/sec, 300 secs
lola: 47498338 markings, 134443623 edges, 142369 markings/sec, 305 secs
lola: 48193462 markings, 136579490 edges, 139025 markings/sec, 310 secs
lola: 48879884 markings, 138735521 edges, 137284 markings/sec, 315 secs
lola: 49543473 markings, 140793670 edges, 132718 markings/sec, 320 secs
lola: 50222781 markings, 142849112 edges, 135862 markings/sec, 325 secs
lola: 50893341 markings, 144967178 edges, 134112 markings/sec, 330 secs
lola: 51582735 markings, 147040032 edges, 137879 markings/sec, 335 secs
lola: 52266238 markings, 149152069 edges, 136701 markings/sec, 340 secs
lola: 52944451 markings, 151240680 edges, 135643 markings/sec, 345 secs
lola: 53620927 markings, 153303129 edges, 135295 markings/sec, 350 secs
lola: 54280948 markings, 155375128 edges, 132004 markings/sec, 355 secs
lola: 54982130 markings, 157571540 edges, 140236 markings/sec, 360 secs
lola: 55735150 markings, 159977611 edges, 150604 markings/sec, 365 secs
lola: 56472280 markings, 162271515 edges, 147426 markings/sec, 370 secs
lola: 57236061 markings, 164376271 edges, 152756 markings/sec, 375 secs
lola: 57984425 markings, 166431539 edges, 149673 markings/sec, 380 secs
lola: 58695772 markings, 168519620 edges, 142269 markings/sec, 385 secs
lola: 59397971 markings, 170631193 edges, 140440 markings/sec, 390 secs
lola: 60142690 markings, 172734150 edges, 148944 markings/sec, 395 secs
lola: 60858760 markings, 174804053 edges, 143214 markings/sec, 400 secs
lola: 61573030 markings, 177071653 edges, 142854 markings/sec, 405 secs
lola: 62272954 markings, 179251035 edges, 139985 markings/sec, 410 secs
lola: 63042530 markings, 181227492 edges, 153915 markings/sec, 415 secs
lola: 63729687 markings, 183370116 edges, 137431 markings/sec, 420 secs
lola: 64445022 markings, 185300044 edges, 143067 markings/sec, 425 secs
lola: 65104861 markings, 187375079 edges, 131968 markings/sec, 430 secs
lola: 65765998 markings, 189409595 edges, 132227 markings/sec, 435 secs
lola: 66412245 markings, 191416663 edges, 129249 markings/sec, 440 secs
lola: 67072081 markings, 193405502 edges, 131967 markings/sec, 445 secs
lola: 67704381 markings, 195387709 edges, 126460 markings/sec, 450 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((p122 <= p86))) U (p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (p122 <= p86)) U (p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43))
lola: processed formula length: 133
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9067 markings, 16294 edges
lola: ========================================
lola: subprocess 12 will run for 573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (((p122 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188) U (3 <= p180)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E((p122 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188) U (3 <= p180)))
lola: processed formula length: 84
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1341377 markings, 1799622 edges, 2994657906957221888 markings/sec, 0 secs
lola: 2525187 markings, 3465822 edges, 236762 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2644638 markings, 3646667 edges
lola: ========================================
lola: subprocess 13 will run for 761 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (((3 <= p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179) U (1 <= p86)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E((3 <= p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179) U (1 <= p86)))))
lola: processed formula length: 96
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 956 markings, 1277 edges
lola: ========================================
lola: subprocess 14 will run for 1141 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((p207 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16) OR (p87 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130) OR (p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 <= 1)))) OR E (G (((p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 <= p25) OR (3 <= p26) OR (p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1141 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p207 <= p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16) OR (p87 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130) OR (p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: state equation: write sara problem file to PermAdmissibility-COL-02-CTLCardinality-14.sara
lola: subprocess 15 will run for 2283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162) OR E (G ((p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 <= p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162)
lola: processed formula length: 60
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no yes yes unknown unknown yes unknown yes no no yes unknown
FORMULA PermAdmissibility-COL-02-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is PermAdmissibility-COL-02, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-csrt-152666472700437"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;