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

About the Execution of M4M.full for PermAdmissibility-COL-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8379.410 569672.00 578571.00 178.00 ???????????????? normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..............................................................................
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 353 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 54K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is PermAdmissibility-COL-05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666478500444
=====================================================================


--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-05-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527295074016


BK_STOP 1527295643688

--------------------
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-05 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': 1637299, 'Memory': 15950.7, 'Tool': 'lola'}, {'Time': 2007316, 'Memory': 15952.79, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PermAdmissibility-COL-05...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PermAdmissibility-COL-05: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-05: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ PermAdmissibility-COL-05 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- 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-05-CTLCardinality.task
lola: A (G (E (X (((2 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124) OR (2 <= p71)))))) : E (F ((E (G ((p115 <= p10))) OR ()))) : (E (G (E (G ((p166 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95))))) AND (p116 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199)) : E ((A (G ((1 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95))) U E (G ((2 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199))))) : NOT(((E (G ((p60 <= p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156))) AND ((3 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95) AND (p165 <= p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51) AND (p113 <= 0))) AND (p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79 <= 2))) : A (F (A (G ((p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 <= 0))))) : A (G (A (F ((p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 <= 0))))) : (A (G ((p114 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95))) AND A (X (((p166 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199) OR (3 <= p69) OR (p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 <= p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132))))) : (((((2 <= p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183) AND (p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 <= p0)) OR (p43 + 1 <= p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164) OR (p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68) OR (2 <= p69) OR ((p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 <= p96) AND (p167 <= p71))) AND ((p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191) AND A (F ((1 <= p114))))) OR (((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p167) OR E (X ((p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 <= p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140)))) AND ((((p167 <= p10) AND (p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)) OR (p115 + 1 <= p165)) OR A (X ((3 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175)))))) : E (F (E (((2 <= p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175) U (3 <= p0))))) : A ((E (X ((p166 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112))) U ((1 <= p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132) OR ((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8) AND (p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 <= p60))))) : A (F ((A (G ((p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148))) AND (2 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68)))) : A (F (A (((p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 <= p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51) U (2 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68))))) : (A (X (((p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 <= 1) AND (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + 1 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112)))) OR E (G (((p166 <= p114) OR (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 <= p9) OR (3 <= p10))))) : ((p167 <= p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87) AND E (G (A (G ((p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112)))))) : E (F (E (((p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 <= p166) U (1 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((2 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124) OR (2 <= p71))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(((2 <= p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124) OR (2 <= p71))))))
lola: processed formula length: 101
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 33 markings, 32 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((p115 <= p10))) OR ())))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (p10 + 1 <= p115))))
lola: processed formula length: 42
lola: 5 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 1379756 markings, 1960636 edges, 2549028318120771584 markings/sec, 0 secs
lola: 2712285 markings, 3865904 edges, 266506 markings/sec, 5 secs
lola: 4037805 markings, 5742101 edges, 265104 markings/sec, 10 secs
lola: 5312468 markings, 7632358 edges, 254933 markings/sec, 15 secs
lola: 6352566 markings, 9596583 edges, 208020 markings/sec, 20 secs
lola: 7060769 markings, 11691355 edges, 141641 markings/sec, 25 secs
lola: 7907037 markings, 13790333 edges, 169254 markings/sec, 30 secs
lola: 8731905 markings, 15757482 edges, 164974 markings/sec, 35 secs
lola: 9446597 markings, 17652765 edges, 142938 markings/sec, 40 secs
lola: 10138427 markings, 19646582 edges, 138366 markings/sec, 45 secs
lola: 10808331 markings, 21505247 edges, 133981 markings/sec, 50 secs
lola: 11486551 markings, 23405892 edges, 135644 markings/sec, 55 secs
lola: 12152696 markings, 25423041 edges, 133229 markings/sec, 60 secs
lola: 12926000 markings, 27163954 edges, 154661 markings/sec, 65 secs
lola: 13544872 markings, 29069780 edges, 123774 markings/sec, 70 secs
lola: 14334282 markings, 31010765 edges, 157882 markings/sec, 75 secs
lola: 15051426 markings, 32760475 edges, 143429 markings/sec, 80 secs
lola: 15689083 markings, 34641528 edges, 127531 markings/sec, 85 secs
lola: 16303249 markings, 36417318 edges, 122833 markings/sec, 90 secs
lola: 16969609 markings, 38268047 edges, 133272 markings/sec, 95 secs
lola: 17683464 markings, 40163965 edges, 142771 markings/sec, 100 secs
lola: 18424938 markings, 41977005 edges, 148295 markings/sec, 105 secs
lola: 19160457 markings, 43934923 edges, 147104 markings/sec, 110 secs
lola: 19913986 markings, 45891604 edges, 150706 markings/sec, 115 secs
lola: 20604747 markings, 47762310 edges, 138152 markings/sec, 120 secs
lola: 21242282 markings, 49492919 edges, 127507 markings/sec, 125 secs
lola: 21864429 markings, 51310732 edges, 124429 markings/sec, 130 secs
lola: 22452435 markings, 53092838 edges, 117601 markings/sec, 135 secs
lola: 23164380 markings, 54782929 edges, 142389 markings/sec, 140 secs
lola: 23751804 markings, 56517931 edges, 117485 markings/sec, 145 secs
lola: 24321940 markings, 58195996 edges, 114027 markings/sec, 150 secs
lola: 24927856 markings, 60296261 edges, 121183 markings/sec, 155 secs
lola: 25608024 markings, 62201251 edges, 136034 markings/sec, 160 secs
lola: 26225771 markings, 64067930 edges, 123549 markings/sec, 165 secs
lola: 26844095 markings, 66028331 edges, 123665 markings/sec, 170 secs
lola: 27499500 markings, 67889026 edges, 131081 markings/sec, 175 secs
lola: 28037501 markings, 69909062 edges, 107600 markings/sec, 180 secs
lola: 28610371 markings, 71785918 edges, 114574 markings/sec, 185 secs
lola: 29238068 markings, 73400250 edges, 125539 markings/sec, 190 secs
lola: 29868166 markings, 75208239 edges, 126020 markings/sec, 195 secs
lola: 30446111 markings, 77212368 edges, 115589 markings/sec, 200 secs
lola: 31056236 markings, 79300179 edges, 122025 markings/sec, 205 secs
lola: 31767332 markings, 81110811 edges, 142219 markings/sec, 210 secs
lola: 32460313 markings, 82982323 edges, 138596 markings/sec, 215 secs
lola: 33148408 markings, 84751014 edges, 137619 markings/sec, 220 secs
lola: 33843043 markings, 86578945 edges, 138927 markings/sec, 225 secs
lola: 34520050 markings, 88349210 edges, 135401 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (G ((p166 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95))))) AND (p116 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G ((p166 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95 + 1 <= p166))))
lola: processed formula length: 84
lola: 4 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 81 markings, 241 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p116 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p116 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199)
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (G ((1 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95))) U E (G ((2 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(E(TRUE U (p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95 <= 0))) U NOT(A(TRUE U (p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= 1))))
lola: processed formula length: 148
lola: 5 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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 3 significant temporal operators and needs 13 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: 11 markings, 12 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (G ((p60 <= p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156))) AND ((3 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95) AND (p165 <= p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51) AND (p113 <= 0))) AND (p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + 1 <= p60)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + 1 <= p60)))
lola: processed formula: A (F ((p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + 1 <= p60)))
lola: processed formula length: 74
lola: 8 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 81 markings, 81 edges
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95 <= 2) OR (p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + 1 <= p165) OR (1 <= p113)) OR (3 <= p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95 <= 2) OR (p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + 1 <= p165) OR (1 <= p113)) OR (3 <= p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79))
lola: processed formula length: 192
lola: 9 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
lola: processed formula with 4 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 <= 0)))))
lola: processed formula: A (F (A (G ((p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 <= 0)))))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 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: 82 markings, 83 edges
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 <= 0)))))
lola: processed formula length: 82
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 831368 markings, 2004209 edges, 3687028350427070464 markings/sec, 0 secs
lola: 1565435 markings, 3890683 edges, 146813 markings/sec, 5 secs
lola: 2158815 markings, 5949312 edges, 118676 markings/sec, 10 secs
lola: 2836514 markings, 8045327 edges, 135540 markings/sec, 15 secs
lola: 3569468 markings, 10141596 edges, 146591 markings/sec, 20 secs
lola: 4334311 markings, 12129912 edges, 152969 markings/sec, 25 secs
lola: 5059356 markings, 14101908 edges, 145009 markings/sec, 30 secs
lola: 5711384 markings, 16449524 edges, 130406 markings/sec, 35 secs
lola: 6341500 markings, 18358358 edges, 126023 markings/sec, 40 secs
lola: 6939681 markings, 20428400 edges, 119636 markings/sec, 45 secs
lola: 7568977 markings, 22251562 edges, 125859 markings/sec, 50 secs
lola: 8216272 markings, 24025514 edges, 129459 markings/sec, 55 secs
lola: 8822028 markings, 26004286 edges, 121151 markings/sec, 60 secs
lola: 9369909 markings, 28041253 edges, 109576 markings/sec, 65 secs
lola: 10061277 markings, 29992044 edges, 138274 markings/sec, 70 secs
lola: 10838270 markings, 31964155 edges, 155399 markings/sec, 75 secs
lola: 11494923 markings, 34011514 edges, 131331 markings/sec, 80 secs
lola: 12082438 markings, 36012134 edges, 117503 markings/sec, 85 secs
lola: 12721711 markings, 37828641 edges, 127855 markings/sec, 90 secs
lola: 13380239 markings, 39768383 edges, 131706 markings/sec, 95 secs
lola: 13864225 markings, 41842746 edges, 96797 markings/sec, 100 secs
lola: 14546156 markings, 43714335 edges, 136386 markings/sec, 105 secs
lola: 15185869 markings, 45653020 edges, 127943 markings/sec, 110 secs
lola: 15847582 markings, 47584593 edges, 132343 markings/sec, 115 secs
lola: 16504432 markings, 49604287 edges, 131370 markings/sec, 120 secs
lola: 17279634 markings, 51544412 edges, 155040 markings/sec, 125 secs
lola: 17940684 markings, 53392321 edges, 132210 markings/sec, 130 secs
lola: 18509022 markings, 55391131 edges, 113668 markings/sec, 135 secs
lola: 19164718 markings, 57364030 edges, 131139 markings/sec, 140 secs
lola: 19813594 markings, 59293217 edges, 129775 markings/sec, 145 secs
lola: 20511621 markings, 61111613 edges, 139605 markings/sec, 150 secs
lola: 21138920 markings, 63201242 edges, 125460 markings/sec, 155 secs
lola: 21763774 markings, 65252542 edges, 124971 markings/sec, 160 secs
lola: 22338901 markings, 66990237 edges, 115025 markings/sec, 165 secs
lola: 22960020 markings, 68758622 edges, 124224 markings/sec, 170 secs
lola: 23529258 markings, 70740845 edges, 113848 markings/sec, 175 secs
lola: 24184131 markings, 72704490 edges, 130975 markings/sec, 180 secs
lola: 24899713 markings, 74565035 edges, 143116 markings/sec, 185 secs
lola: 25491792 markings, 76649523 edges, 118416 markings/sec, 190 secs
lola: 26109926 markings, 78439302 edges, 123627 markings/sec, 195 secs
lola: 26672868 markings, 80330956 edges, 112588 markings/sec, 200 secs
lola: 27280848 markings, 82229037 edges, 121596 markings/sec, 205 secs
lola: 27911289 markings, 84174591 edges, 126088 markings/sec, 210 secs
lola: 28526563 markings, 86092040 edges, 123055 markings/sec, 215 secs
lola: 29197345 markings, 87975937 edges, 134156 markings/sec, 220 secs
lola: 29876475 markings, 89798545 edges, 135826 markings/sec, 225 secs
lola: 30507080 markings, 91848000 edges, 126121 markings/sec, 230 secs
lola: 31207214 markings, 93802273 edges, 140027 markings/sec, 235 secs
lola: 31871428 markings, 95855409 edges, 132843 markings/sec, 240 secs
lola: 32558597 markings, 97769896 edges, 137434 markings/sec, 245 secs
lola: 33198817 markings, 99799052 edges, 128044 markings/sec, 250 secs
lola: 33867728 markings, 101671132 edges, 133782 markings/sec, 255 secs
lola: 34566753 markings, 103628798 edges, 139805 markings/sec, 260 secs
lola: 35317890 markings, 105549879 edges, 150227 markings/sec, 265 secs
lola: 36026545 markings, 107386468 edges, 141731 markings/sec, 270 secs
lola: 36652311 markings, 109467138 edges, 125153 markings/sec, 275 secs
lola: 37338931 markings, 111303157 edges, 137324 markings/sec, 280 secs
lola: 38018741 markings, 113202279 edges, 135962 markings/sec, 285 secs
lola: 38748498 markings, 115172317 edges, 145951 markings/sec, 290 secs
lola: 39447955 markings, 117084242 edges, 139891 markings/sec, 295 secs
lola: 40081217 markings, 119068324 edges, 126652 markings/sec, 300 secs
lola: 40692547 markings, 121035002 edges, 122266 markings/sec, 305 secs
lola: 41336690 markings, 123080440 edges, 128829 markings/sec, 310 secs
lola: 41987587 markings, 125172825 edges, 130179 markings/sec, 315 secs
lola: 42535700 markings, 127128377 edges, 109623 markings/sec, 320 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: ' '
Aborted (core dumped)
FORMULA PermAdmissibility-COL-05-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-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 stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-COL-05"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-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-05.tgz
mv PermAdmissibility-COL-05 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is PermAdmissibility-COL-05, 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 r118-csrt-152666478500444"
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 ;