About the Execution of 2018-Gold for LamportFastMutEx-COL-6
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
154.180 | 959.00 | 1039.00 | 35.30 | TFTTFTTTFT?TFFTF | 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-155246598300053.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-6, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r099-smll-155246598300053
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.6K Feb 11 22:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 11 22:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 7 23:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 7 23:35 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 11K Feb 5 00:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.8K 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 3.1K Jan 31 23:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Jan 31 23:54 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 42K 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-6-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-COL-6-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552769335636
info: Time: 3600 - MCC
===========================================================================================
prep: translating LamportFastMutEx-COL-6 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-6 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ LamportFastMutEx-COL-6 @ 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: 637/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 217
lola: finding significant places
lola: 217 places, 420 transitions, 152 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 597 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-COL-6-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p21 + p22 + p23 + p24 + p25 + p26 + p27)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (2 <= p14 + p15 + p16 + p17 + p18 + p19 + p20)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p119 + p120 + p121 + p122 + p123 + p124 + p125 <= p28 + p40 + p30 + p38 + p32 + p36 + p34 + p35 + p33 + p37 + p31 + p39 + p29 + p41)
lola: after: (p119 + p120 + p121 + p122 + p123 + p124 + p125 <= 6)
lola: LP says that atomic proposition is always true: (p119 + p120 + p121 + p122 + p123 + p124 + p125 <= 6)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= p14 + p15 + p16 + p17 + p18 + p19 + p20)
lola: after: (0 <= 0)
lola: always true
lola: A ((p203 + p204 + p205 + p206 + p209 + p208 + p207 <= p140 + p141 + p142 + p143 + p144 + p145 + p146)) : A (X (G (G ((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))))) : A ((p63 + p64 + p65 + p66 + p67 + p68 + p69 <= p7 + p8 + p9 + p10 + p11 + p12 + p13)) : A ((((3 <= p140 + p141 + p142 + p143 + p144 + p145 + p146) U (p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p0 + p1 + p2 + p3 + p4 + p5 + p6)) U TRUE)) : A (F (X (X (G ((p62 + p61 + p60 + p59 + p58 + p57 + p56 <= p147 + p148 + p149 + p150 + p151 + p152 + p153)))))) : A (X ((X ((p203 + p204 + p205 + p206 + p209 + p208 + p207 <= p147 + p148 + p149 + p150 + p151 + p152 + p153)) U X ((p55 + p54 + p53 + p52 + p51 + p50 + p49 <= p147 + p148 + p149 + p150 + p151 + p152 + p153))))) : A ((p0 + p1 + p2 + p3 + p4 + p5 + p6 <= p55 + p54 + p53 + p52 + p51 + p50 + p49)) : A ((G (X ((p63 + p64 + p65 + p66 + p67 + p68 + p69 <= p62 + p61 + p60 + p59 + p58 + p57 + p56))) U F (X ((p62 + p61 + p60 + p59 + p58 + p57 + p56 <= p140 + p141 + p142 + p143 + p144 + p145 + p146))))) : A (X ((F ((p62 + p61 + p60 + p59 + p58 + p57 + p56 <= p55 + p54 + p53 + p52 + p51 + p50 + p49)) U X (FALSE)))) : A (X (TRUE)) : A ((X (X ((1 <= p147 + p148 + p149 + p150 + p151 + p152 + p153))) U X ((2 <= p63 + p64 + p65 + p66 + p67 + p68 + p69)))) : A ((X (G ((2 <= p63 + p64 + p65 + p66 + p67 + p68 + p69))) U (p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p190 + p197 + p202 + p201 + p200 + p199 + p198 + p196 + p195 + p194 + p193 + p192 + p191 + p189 + p188 + p187 + p186 + p185 <= p203 + p204 + p205 + p206 + p209 + p208 + p207))) : A ((1 <= p63 + p64 + p65 + p66 + p67 + p68 + p69)) : A (G ((G ((2 <= p133 + p134 + p135 + p136 + p137 + p138 + p139)) U G ((1 <= p63 + p64 + p65 + p66 + p67 + p68 + p69))))) : A (TRUE) : A ((p7 + p8 + p9 + p10 + p11 + p12 + p13 <= p133 + p134 + p135 + p136 + p137 + p138 + p139))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p203 + p204 + p205 + p206 + p209 + p208 + p207 <= p140 + p141 + p142 + p143 + p144 + p145 + p146)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p203 + p204 + p205 + p206 + p209 + p208 + p207 <= p140 + p141 + p142 + p143 + p144 + p145 + p146)
lola: processed formula length: 98
lola: 29 rewrites
lola: closed formula file LamportFastMutEx-COL-6-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-6-LTLCardinality-0 TRUE 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: (p63 + p64 + p65 + p66 + p67 + p68 + p69 <= p7 + p8 + p9 + p10 + p11 + p12 + p13)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p63 + p64 + p65 + p66 + p67 + p68 + p69 <= p7 + p8 + p9 + p10 + p11 + p12 + p13)
lola: processed formula length: 81
lola: 29 rewrites
lola: closed formula file LamportFastMutEx-COL-6-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-6-LTLCardinality-2 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 29 rewrites
lola: closed formula file LamportFastMutEx-COL-6-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-6-LTLCardinality-3 TRUE 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: (p0 + p1 + p2 + p3 + p4 + p5 + p6 <= p55 + p54 + p53 + p52 + p51 + p50 + p49)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 + p1 + p2 + p3 + p4 + p5 + p6 <= p55 + p54 + p53 + p52 + p51 + p50 + p49)
lola: processed formula length: 77
lola: 29 rewrites
lola: closed formula file LamportFastMutEx-COL-6-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-6-LTLCardinality-6 TRUE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 29 rewrites
lola: closed formula file LamportFastMutEx-COL-6-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-6-LTLCardinality-8 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: (1 <= p63 + p64 + p65 + p66 + p67 + p68 + p69)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p63 + p64 + p65 + p66 + p67 + p68 + p69)
lola: processed formula length: 46
lola: 29 rewrites
lola: closed formula file LamportFastMutEx-COL-6-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-6-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 29 rewrites
lola: closed formula file LamportFastMutEx-COL-6-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola:
FORMULA LamportFastMutEx-COL-6-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p7 + p8 + p9 + p10 + p11 + p12 + p13 <= p133 + p134 + p135 + p136 + p137 + p138 + p139)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p7 + p8 + p9 + p10 + p11 + p12 + p13 <= p133 + p134 + p135 + p136 + p137 + p138 + p139)
lola: processed formula length: 88
lola: 29 rewrites
lola: closed formula file LamportFastMutEx-COL-6-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-6-LTLCardinality-15 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 (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: 29 rewrites
lola: closed formula file LamportFastMutEx-COL-6-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: 7 markings, 6 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-6-LTLCardinality-9 TRUE 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 ((X ((1 <= p147 + p148 + p149 + p150 + p151 + p152 + p153)) U (2 <= p63 + p64 + p65 + p66 + p67 + p68 + p69))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((1 <= p147 + p148 + p149 + p150 + p151 + p152 + p153)) U (2 <= p63 + p64 + p65 + p66 + p67 + p68 + p69))))
lola: processed formula length: 116
lola: 29 rewrites
lola: closed formula file LamportFastMutEx-COL-6-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: 14 markings, 14 edges
lola:
FORMULA LamportFastMutEx-COL-6-LTLCardinality-10 FALSE 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 ((X (G ((2 <= p63 + p64 + p65 + p66 + p67 + p68 + p69))) U (p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p190 + p197 + p202 + p201 + p200 + p199 + p198 + p196 + p195 + p194 + p193 + p192 + p191 + p189 + p188 + p187 + p186 + p1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((2 <= p63 + p64 + p65 + p66 + p67 + p68 + p69))) U (p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p190 + p197 + p202 + p201 + p200 + p199 + p198 + p196 + p195 + p194 + p193 + p192 + p191 + p189 + p188 + p187 + p186 + p1... (shortened)
lola: processed formula length: 455
lola: 29 rewrites
lola: closed formula file LamportFastMutEx-COL-6-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: 1 markings, 0 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-6-LTLCardinality-11 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 (X (G ((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((3 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99))))
lola: processed formula length: 329
lola: 29 rewrites
lola: closed formula file LamportFastMutEx-COL-6-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: 14 markings, 14 edges
FORMULA LamportFastMutEx-COL-6-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((p62 + p61 + p60 + p59 + p58 + p57 + p56 <= p140 + p141 + p142 + p143 + p144 + p145 + p146)) OR (G ((p63 + p64 + p65 + p66 + p67 + p68 + p69 <= p62 + p61 + p60 + p59 + p58 + p57 + p56)) AND F ((p62 + p61 + p60 + p59 + p58 + p57 + p56 <= p140 + p141 + p142 + p143 + p144 + p145 + p146))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((p62 + p61 + p60 + p59 + p58 + p57 + p56 <= p140 + p141 + p142 + p143 + p144 + p145 + p146)) OR (G ((p63 + p64 + p65 + p66 + p67 + p68 + p69 <= p62 + p61 + p60 + p59 + p58 + p57 + p56)) AND F ((p62 + p61 + p60 + p59 + p58 + p57 + p56 <= p140 + p141 + p142 + p143 + p144 + p145 + p146))))))
lola: processed formula length: 299
lola: 29 rewrites
lola: closed formula file LamportFastMutEx-COL-6-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 13 markings, 12 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-6-LTLCardinality-7 TRUE 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 (X (X (((p203 + p204 + p205 + p206 + p209 + p208 + p207 <= p147 + p148 + p149 + p150 + p151 + p152 + p153) U (p55 + p54 + p53 + p52 + p51 + p50 + p49 <= p147 + p148 + p149 + p150 + p151 + p152 + p153)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((p203 + p204 + p205 + p206 + p209 + p208 + p207 <= p147 + p148 + p149 + p150 + p151 + p152 + p153) U (p55 + p54 + p53 + p52 + p51 + p50 + p49 <= p147 + p148 + p149 + p150 + p151 + p152 + p153)))))
lola: processed formula length: 206
lola: 29 rewrites
lola: closed formula file LamportFastMutEx-COL-6-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 28 markings, 42 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-6-LTLCardinality-5 TRUE 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 (F (G ((p62 + p61 + p60 + p59 + p58 + p57 + p56 <= p147 + p148 + p149 + p150 + p151 + p152 + p153))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p62 + p61 + p60 + p59 + p58 + p57 + p56 <= p147 + p148 + p149 + p150 + p151 + p152 + p153))))
lola: processed formula length: 103
lola: 29 rewrites
lola: closed formula file LamportFastMutEx-COL-6-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: 94 markings, 153 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-6-LTLCardinality-4 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 (G ((G ((1 <= p63 + p64 + p65 + p66 + p67 + p68 + p69)) OR (G ((2 <= p133 + p134 + p135 + p136 + p137 + p138 + p139)) AND F (G ((1 <= p63 + p64 + p65 + p66 + p67 + p68 + p69)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((G ((1 <= p63 + p64 + p65 + p66 + p67 + p68 + p69)) OR (G ((2 <= p133 + p134 + p135 + p136 + p137 + p138 + p139)) AND F (G ((1 <= p63 + p64 + p65 + p66 + p67 + p68 + p69)))))))
lola: processed formula length: 182
lola: 29 rewrites
lola: closed formula file LamportFastMutEx-COL-6-LTLCardinality.task
lola: the resulting Büchi automaton has 9 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: 10 markings, 10 edges
lola:
FORMULA LamportFastMutEx-COL-6-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================lola: RESULT
lola:
SUMMARY: yes no yes yes no yes yes yes no yes no yes no no yes no
lola:
preliminary result: yes no yes yes no yes yes yes no yes no yes no no yes no
lola: memory consumption: 20136 KB
lola: time consumption: 1 seconds
BK_STOP 1552769336595
--------------------
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-6"
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-6, 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-155246598300053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-6.tgz
mv LamportFastMutEx-COL-6 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 '
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 ;