fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r099-smll-155246598300050
Last Updated
Apr 15, 2019

About the Execution of 2018-Gold for LamportFastMutEx-COL-5

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
172.700 1022.00 1162.00 32.50 FFFFFFFFTFTFTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r099-smll-155246598300050.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
Input is LamportFastMutEx-COL-5, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r099-smll-155246598300050
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 4.0K Feb 11 22:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 11 22:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 7 23:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 7 23:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 00:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 4 06:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 4 06:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Jan 31 23:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Jan 31 23:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:21 UpperBounds.xml

-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 41K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1552765690590

info: Time: 3600 - MCC
===========================================================================================
prep: translating LamportFastMutEx-COL-5 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating LamportFastMutEx-COL-5 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ LamportFastMutEx-COL-5 @ 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: 492/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 174
lola: finding significant places
lola: 174 places, 318 transitions, 124 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 452 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-COL-5-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (p89 + p88 + p87 + p86 + p85 + p84 <= p64 + p62 + p60 + p58 + p56 + p54 + p55 + p57 + p59 + p61 + p63 + p65)
lola: after: (p89 + p88 + p87 + p86 + p85 + p84 <= 5)
lola: LP says that atomic proposition is always true: (p89 + p88 + p87 + p86 + p85 + p84 <= 5)
lola: place invariant simplifies atomic proposition
lola: before: (p100 + p101 + p96 + p97 + p98 + p99 <= p144 + p145 + p146 + p147 + p148 + p149)
lola: after: (p100 + p101 + p96 + p97 + p98 + p99 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p144 + p145 + p146 + p147 + p148 + p149 <= p156 + p157 + p158 + p159 + p160 + p161)
lola: after: (1 <= p156 + p157 + p158 + p159 + p160 + p161)
lola: place invariant simplifies atomic proposition
lola: before: (p71 + p70 + p69 + p68 + p67 + p66 <= p144 + p145 + p146 + p147 + p148 + p149)
lola: after: (p71 + p70 + p69 + p68 + p67 + p66 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p162 + p163 + p164 + p165 + p166 + p167 <= p144 + p145 + p146 + p147 + p148 + p149)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (p150 + p151 + p152 + p153 + p154 + p155 <= p162 + p163 + p164 + p165 + p166 + p167)
lola: after: (p150 + p151 + p152 + p153 + p154 + p155 <= 1)
lola: A ((F (F ((3 <= p83 + p82 + p81 + p80 + p79 + p78))) U X (F ((1 <= p103 + p109 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p111 + p110 + p108 + p107 + p106 + p105 + p104 + p102))))) : A ((X (G ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10))) U (1 <= p83 + p82 + p81 + p80 + p79 + p78))) : A (X ((X (TRUE) U X ((3 <= p77 + p76 + p75 + p74 + p73 + p72))))) : A (F (X (G (F ((p168 + p169 + p170 + p171 + p172 + p173 <= p138 + p139 + p140 + p141 + p142 + p143)))))) : A ((1 <= p150 + p151 + p152 + p153 + p154 + p155)) : A (F (F (X (G ((p100 + p101 + p96 + p97 + p98 + p99 <= p103 + p109 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p111 + p110 + p108 + p107 + p106 + p105 + p104 + p102)))))) : A (G ((G ((p93 + p92 + p91 + p90 + p94 + p95 <= p103 + p109 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p111 + p110 + p108 + p107 + p106 + p105 + p104 + p102)) U X ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10))))) : A (G (X (G (X ((2 <= p156 + p157 + p158 + p159 + p160 + p161)))))) : A (X (F (((1 <= p100 + p101 + p96 + p97 + p98 + p99) U (p100 + p101 + p96 + p97 + p98 + p99 <= 1))))) : A (F (G ((3 <= p41 + p40 + p39 + p38 + p37 + p36)))) : A (F ((X ((1 <= p156 + p157 + p158 + p159 + p160 + p161)) U F ((p71 + p70 + p69 + p68 + p67 + p66 <= 1))))) : A (X (((2 <= p77 + p76 + p75 + p74 + p73 + p72) U G ((1 <= p103 + p109 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p111 + p110 + p108 + p107 + p106 + p105 + p104 + p102))))) : A ((p168 + p169 + p170 + p171 + p172 + p173 <= p53 + p52 + p51 + p50 + p48 + p49)) : A (G (G (G (X (TRUE))))) : A (F (F (((2 <= p71 + p70 + p69 + p68 + p67 + p66) U (2 <= p103 + p109 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p111 + p110 + p108 + p107 + p106 + p105 + p104 + p102))))) : A ((X (X ((2 <= p138 + p139 + p140 + p141 + p142 + p143))) U G (F ((p150 + p151 + p152 + p153 + p154 + p155 <= 1)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p150 + p151 + p152 + p153 + p154 + p155)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p150 + p151 + p152 + p153 + p154 + p155)
lola: processed formula length: 46
lola: 30 rewrites
lola: closed formula file LamportFastMutEx-COL-5-LTLCardinality.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: ========================================

FORMULA LamportFastMutEx-COL-5-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p168 + p169 + p170 + p171 + p172 + p173 <= p53 + p52 + p51 + p50 + p48 + p49)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p168 + p169 + p170 + p171 + p172 + p173 <= p53 + p52 + p51 + p50 + p48 + p49)
lola: processed formula length: 78
lola: 30 rewrites
lola: closed formula file LamportFastMutEx-COL-5-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-5-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((3 <= p77 + p76 + p75 + p74 + p73 + p72)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((3 <= p77 + p76 + p75 + p74 + p73 + p72)))))
lola: processed formula length: 56
lola: 30 rewrites
lola: closed formula file LamportFastMutEx-COL-5-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 110 markings, 112 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-5-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((3 <= p83 + p82 + p81 + p80 + p79 + p78)) U X (F ((1 <= p103 + p109 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p111 + p110 + p108 + p107 + p106 + p105 + p104 + p102)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((3 <= p83 + p82 + p81 + p80 + p79 + p78)) U X (F ((1 <= p103 + p109 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p111 + p110 + p108 + p107 + p106 + p105 + p104 + p102)))))
lola: processed formula length: 317
lola: 30 rewrites
lola: closed formula file LamportFastMutEx-COL-5-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 29415 markings, 57107 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-5-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((X ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10)) OR (G ((p93 + p92 + p91 + p90 + p94 + p95 <= p103 + p109 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10)) OR (G ((p93 + p92 + p91 + p90 + p94 + p95 <= p103 + p109 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + ... (shortened)
lola: processed formula length: 745
lola: 30 rewrites
lola: closed formula file LamportFastMutEx-COL-5-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 71 markings, 71 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-5-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((2 <= p156 + p157 + p158 + p159 + p160 + p161)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((2 <= p156 + p157 + p158 + p159 + p160 + p161)))))
lola: processed formula length: 62
lola: 30 rewrites
lola: closed formula file LamportFastMutEx-COL-5-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 71 markings, 71 edges

FORMULA LamportFastMutEx-COL-5-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p100 + p101 + p96 + p97 + p98 + p99 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p100 + p101 + p96 + p97 + p98 + p99 <= 1))))
lola: processed formula length: 54
lola: 30 rewrites
lola: closed formula file LamportFastMutEx-COL-5-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6 markings, 5 edges

FORMULA LamportFastMutEx-COL-5-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((2 <= p77 + p76 + p75 + p74 + p73 + p72) U G ((1 <= p103 + p109 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p111 + p110 + p108 + p107 + p106 + p105 + p104 + p102)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((2 <= p77 + p76 + p75 + p74 + p73 + p72) U G ((1 <= p103 + p109 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p111 + p110 + p108 + p107 + p106 + p105 + p104 + p102)))))
lola: processed formula length: 313
lola: 30 rewrites
lola: closed formula file LamportFastMutEx-COL-5-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 71 markings, 71 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-5-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10))) U (1 <= p83 + p82 + p81 + p80 + p79 + p78)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p13 + p19 + p25 + p31 + p35 + p34 + p33 + p32 + p30 + p29 + p28 + p27 + p26 + p24 + p23 + p22 + p21 + p20 + p18 + p17 + p16 + p15 + p14 + p12 + p11 + p10))) U (1 <= p83 + p82 + p81 + p80 + p79 + p78)))
lola: processed formula length: 267
lola: 30 rewrites
lola: closed formula file LamportFastMutEx-COL-5-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 71 markings, 71 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-5-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 30 rewrites
lola: closed formula file LamportFastMutEx-COL-5-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6 markings, 5 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-5-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p71 + p70 + p69 + p68 + p67 + p66 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (2 <= p71 + p70 + p69 + p68 + p67 + p66)
lola: processed formula length: 40
lola: 32 rewrites
lola: closed formula file LamportFastMutEx-COL-5-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-5-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p103 + p109 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p111 + p110 + p108 + p107 + p106 + p105 + p104 + p102)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p103 + p109 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p111 + p110 + p108 + p107 + p106 + p105 + p104 + p102 <= 1)
lola: processed formula length: 256
lola: 32 rewrites
lola: closed formula file LamportFastMutEx-COL-5-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 10 markings, 10 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-5-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((3 <= p41 + p40 + p39 + p38 + p37 + p36))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((3 <= p41 + p40 + p39 + p38 + p37 + p36))))
lola: processed formula length: 52
lola: 30 rewrites
lola: closed formula file LamportFastMutEx-COL-5-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 11 markings, 12 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-5-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p150 + p151 + p152 + p153 + p154 + p155 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p150 + p151 + p152 + p153 + p154 + p155 <= 1))))
lola: processed formula length: 58
lola: 30 rewrites
lola: closed formula file LamportFastMutEx-COL-5-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1104 markings, 1659 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-5-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p168 + p169 + p170 + p171 + p172 + p173 <= p138 + p139 + p140 + p141 + p142 + p143))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p168 + p169 + p170 + p171 + p172 + p173 <= p138 + p139 + p140 + p141 + p142 + p143))))
lola: processed formula length: 96
lola: 30 rewrites
lola: closed formula file LamportFastMutEx-COL-5-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 7292 markings, 18200 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-5-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p100 + p101 + p96 + p97 + p98 + p99 <= p103 + p109 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p111 + p110 + p108 + p107 + p106 + p105 + p104 + p102))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p100 + p101 + p96 + p97 + p98 + p99 <= p103 + p109 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p111 + p110 + p108 + p107 + p106 + p105 + p104 + p102))))
lola: processed formula length: 302
lola: 30 rewrites
lola: closed formula file LamportFastMutEx-COL-5-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 262
lola: add low 111
lola: add low 261
lola: add low 260
lola: add low 65
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: 302 markings, 542 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-5-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no no no no yes no yes no yes yes no no
lola:
preliminary result: no no no no no no no no yes no yes no yes yes no no
lola: memory consumption: 19924 KB
lola: time consumption: 1 seconds

BK_STOP 1552765691612

--------------------
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="LamportFastMutEx-COL-5"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3957"
echo " Executing tool win2018"
echo " Input is LamportFastMutEx-COL-5, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r099-smll-155246598300050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-5.tgz
mv LamportFastMutEx-COL-5 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;