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

About the Execution of Irma.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
10584.010 570161.00 586202.00 178.40 ???????????????? 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 irma4mcc-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 r114-csrt-152666472700444
=====================================================================


--------------------
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 1527141254764


BK_STOP 1527141824925

--------------------
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 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) OR (2 <= p71)))))) : E (F ((E (G ((p68 <= p157))) OR ()))) : (E (G (E (G ((p88 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))))) AND (p140 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)) : E ((A (G ((1 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))) U E (G ((2 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207))))) : NOT(((E (G ((p67 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24))) AND ((3 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190) AND (p25 <= p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79) AND (p115 <= 0))) AND (p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 <= 2))) : A (F (A (G ((p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= 0))))) : A (G (A (F ((p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 <= 0))))) : (A (G ((p90 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))) AND A (X (((p88 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207) OR (3 <= p174) OR (p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7))))) : (((((2 <= p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173) AND (p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 <= p70)) OR (p191 + 1 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199) OR (p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 <= p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156) OR (2 <= p174) OR ((p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 <= p26) AND (p16 <= p71))) AND ((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98) AND A (F ((1 <= p90))))) OR (((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p16) OR E (X ((p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131)))) AND ((((p16 <= p157) AND (p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 <= p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98)) OR (p68 + 1 <= p25)) OR A (X ((3 <= p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165)))))) : E (F (E (((2 <= p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165) U (3 <= p70))))) : A ((E (X ((p88 <= p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114))) U ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7) OR ((1 <= p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58) AND (p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 <= p67))))) : A (F ((A (G ((p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15))) AND (2 <= p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156)))) : A (F (A (((p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 <= p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79) U (2 <= p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156))))) : (A (X (((p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 <= 1) AND (p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + 1 <= p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114)))) OR E (G (((p88 <= p90) OR (p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 <= p69) OR (3 <= p157))))) : ((p16 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p99) AND E (G (A (G ((p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79 <= p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114)))))) : E (F (E (((p86 + p85 + p84 + p83 + p82 + p81 + p80 + p87 <= p88) U (1 <= p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156)))))
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 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) OR (2 <= p71))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(((2 <= p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139) 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: 59 markings, 58 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (G ((p68 <= p157))) OR ())))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (p157 + 1 <= p68))))
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: 990702 markings, 2313241 edges, 3689320832170983424 markings/sec, 0 secs
lola: 1972254 markings, 4616439 edges, 196310 markings/sec, 5 secs
lola: 2895870 markings, 7042898 edges, 184723 markings/sec, 10 secs
lola: 3804055 markings, 9363626 edges, 181637 markings/sec, 15 secs
lola: 4704271 markings, 11645545 edges, 180043 markings/sec, 20 secs
lola: 5482901 markings, 13845508 edges, 155726 markings/sec, 25 secs
lola: 6428550 markings, 16123873 edges, 189130 markings/sec, 30 secs
lola: 7367077 markings, 18471957 edges, 187705 markings/sec, 35 secs
lola: 8276143 markings, 20648283 edges, 181813 markings/sec, 40 secs
lola: 9053343 markings, 22823279 edges, 155440 markings/sec, 45 secs
lola: 9793472 markings, 25039871 edges, 148026 markings/sec, 50 secs
lola: 10548858 markings, 27148300 edges, 151077 markings/sec, 55 secs
lola: 11307219 markings, 29312990 edges, 151672 markings/sec, 60 secs
lola: 12041397 markings, 31490600 edges, 146836 markings/sec, 65 secs
lola: 12950447 markings, 33678550 edges, 181810 markings/sec, 70 secs
lola: 13831836 markings, 35825828 edges, 176278 markings/sec, 75 secs
lola: 14792809 markings, 38130533 edges, 192195 markings/sec, 80 secs
lola: 15642078 markings, 40524958 edges, 169854 markings/sec, 85 secs
lola: 16553233 markings, 42716961 edges, 182231 markings/sec, 90 secs
lola: 17418867 markings, 45049664 edges, 173127 markings/sec, 95 secs
lola: 18340662 markings, 47188091 edges, 184359 markings/sec, 100 secs
lola: 19291810 markings, 49472403 edges, 190230 markings/sec, 105 secs
lola: 20179457 markings, 51928899 edges, 177529 markings/sec, 110 secs
lola: 21073989 markings, 54278338 edges, 178906 markings/sec, 115 secs
lola: 22065983 markings, 56588050 edges, 198399 markings/sec, 120 secs
lola: 22999224 markings, 58879984 edges, 186648 markings/sec, 125 secs
lola: 24012168 markings, 61208052 edges, 202589 markings/sec, 130 secs
lola: 24914908 markings, 63569289 edges, 180548 markings/sec, 135 secs
lola: 25918293 markings, 65841305 edges, 200677 markings/sec, 140 secs
lola: 26902397 markings, 68180773 edges, 196821 markings/sec, 145 secs
lola: 27808243 markings, 70500170 edges, 181169 markings/sec, 150 secs
lola: 28816640 markings, 72788839 edges, 201679 markings/sec, 155 secs
lola: 29685629 markings, 75181304 edges, 173798 markings/sec, 160 secs
lola: 30637326 markings, 77381312 edges, 190339 markings/sec, 165 secs
lola: 31362740 markings, 79652294 edges, 145083 markings/sec, 170 secs
lola: 32243153 markings, 81687758 edges, 176083 markings/sec, 175 secs
lola: 33064822 markings, 83727056 edges, 164334 markings/sec, 180 secs
lola: 34003456 markings, 85890677 edges, 187727 markings/sec, 185 secs
lola: 34850654 markings, 88055309 edges, 169440 markings/sec, 190 secs
lola: 35709987 markings, 90109614 edges, 171867 markings/sec, 195 secs
lola: 36554855 markings, 92059190 edges, 168974 markings/sec, 200 secs
lola: 37372942 markings, 94138996 edges, 163617 markings/sec, 205 secs
lola: 38288577 markings, 96455023 edges, 183127 markings/sec, 210 secs
lola: 39154126 markings, 98557978 edges, 173110 markings/sec, 215 secs
lola: 39851077 markings, 100692911 edges, 139390 markings/sec, 220 secs
lola: 40685210 markings, 102769113 edges, 166827 markings/sec, 225 secs
lola: 41492229 markings, 104852360 edges, 161404 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 ((p88 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))))) AND (p140 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207))
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 ((p88 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + 1 <= p88))))
lola: processed formula length: 91
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: (p140 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p140 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)
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 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190))) U E (G ((2 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(E(TRUE U (p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 <= 0))) U NOT(A(TRUE U (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= 1))))
lola: processed formula length: 156
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: 23 markings, 24 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (G ((p67 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24))) AND ((3 <= p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190) AND (p25 <= p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79) AND (p115 <= 0))) AND (p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 <= 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 ((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + 1 <= p67)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + 1 <= p67)))
lola: processed formula: A (F ((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + 1 <= p67)))
lola: processed formula length: 66
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: (((p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 <= 2) OR (p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79 + 1 <= p25) OR (1 <= p115)) OR (3 <= p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 <= 2) OR (p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79 + 1 <= p25) OR (1 <= p115)) OR (3 <= p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148))
lola: processed formula length: 207
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 ((p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= 0)))))
lola: processed formula: A (F (A (G ((p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= 0)))))
lola: processed formula length: 76
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 ((p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 <= 0)))))
lola: processed formula length: 90
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: 957603 markings, 2692072 edges, 3095368499137085440 markings/sec, 0 secs
lola: 1876163 markings, 5039783 edges, 183712 markings/sec, 5 secs
lola: 2651307 markings, 7577907 edges, 155029 markings/sec, 10 secs
lola: 3435513 markings, 9934332 edges, 156841 markings/sec, 15 secs
lola: 4203084 markings, 12200199 edges, 153514 markings/sec, 20 secs
lola: 5083290 markings, 14725845 edges, 176041 markings/sec, 25 secs
lola: 5918654 markings, 17445357 edges, 167073 markings/sec, 30 secs
lola: 6749495 markings, 19828533 edges, 166168 markings/sec, 35 secs
lola: 7470069 markings, 22242630 edges, 144115 markings/sec, 40 secs
lola: 8263254 markings, 24653686 edges, 158637 markings/sec, 45 secs
lola: 9147251 markings, 27078722 edges, 176799 markings/sec, 50 secs
lola: 9905739 markings, 29546850 edges, 151698 markings/sec, 55 secs
lola: 10747809 markings, 32020577 edges, 168414 markings/sec, 60 secs
lola: 11468554 markings, 34467442 edges, 144149 markings/sec, 65 secs
lola: 12216955 markings, 36957577 edges, 149680 markings/sec, 70 secs
lola: 13025782 markings, 39266270 edges, 161765 markings/sec, 75 secs
lola: 13696429 markings, 41867911 edges, 134129 markings/sec, 80 secs
lola: 14517185 markings, 44161796 edges, 164151 markings/sec, 85 secs
lola: 15259572 markings, 46490586 edges, 148477 markings/sec, 90 secs
lola: 15996450 markings, 48583477 edges, 147376 markings/sec, 95 secs
lola: 16723073 markings, 50792986 edges, 145325 markings/sec, 100 secs
lola: 17397111 markings, 53055377 edges, 134808 markings/sec, 105 secs
lola: 18216073 markings, 55324362 edges, 163792 markings/sec, 110 secs
lola: 18944231 markings, 57547980 edges, 145632 markings/sec, 115 secs
lola: 19703731 markings, 59791199 edges, 151900 markings/sec, 120 secs
lola: 20419969 markings, 62254307 edges, 143248 markings/sec, 125 secs
lola: 21232601 markings, 64593654 edges, 162526 markings/sec, 130 secs
lola: 22011332 markings, 66967237 edges, 155746 markings/sec, 135 secs
lola: 22794004 markings, 69343023 edges, 156534 markings/sec, 140 secs
lola: 23526808 markings, 71763718 edges, 146561 markings/sec, 145 secs
lola: 24182457 markings, 74142209 edges, 131130 markings/sec, 150 secs
lola: 24997425 markings, 76611929 edges, 162994 markings/sec, 155 secs
lola: 25635635 markings, 79133428 edges, 127642 markings/sec, 160 secs
lola: 26326256 markings, 81429408 edges, 138124 markings/sec, 165 secs
lola: 26981402 markings, 83615761 edges, 131029 markings/sec, 170 secs
lola: 27620235 markings, 85833398 edges, 127767 markings/sec, 175 secs
lola: 28321768 markings, 88071806 edges, 140307 markings/sec, 180 secs
lola: 28943152 markings, 90370179 edges, 124277 markings/sec, 185 secs
lola: 29619437 markings, 92621487 edges, 135257 markings/sec, 190 secs
lola: 30254576 markings, 94965456 edges, 127028 markings/sec, 195 secs
lola: 30896893 markings, 97317542 edges, 128463 markings/sec, 200 secs
lola: 31475861 markings, 99743211 edges, 115794 markings/sec, 205 secs
lola: 32227998 markings, 101983115 edges, 150427 markings/sec, 210 secs
lola: 32865010 markings, 104244946 edges, 127402 markings/sec, 215 secs
lola: 33604218 markings, 106582943 edges, 147842 markings/sec, 220 secs
lola: 34353658 markings, 109035736 edges, 149888 markings/sec, 225 secs
lola: 35064196 markings, 111478180 edges, 142108 markings/sec, 230 secs
lola: 35813420 markings, 113805240 edges, 149845 markings/sec, 235 secs
lola: 36486225 markings, 115934759 edges, 134561 markings/sec, 240 secs
lola: 37214495 markings, 118181357 edges, 145654 markings/sec, 245 secs
lola: 37878453 markings, 120418444 edges, 132792 markings/sec, 250 secs
lola: 38656421 markings, 122744468 edges, 155594 markings/sec, 255 secs
lola: 39309215 markings, 125086832 edges, 130559 markings/sec, 260 secs
lola: 40036306 markings, 127223396 edges, 145418 markings/sec, 265 secs
lola: 40691017 markings, 129356844 edges, 130942 markings/sec, 270 secs
lola: 41307682 markings, 131521694 edges, 123333 markings/sec, 275 secs
lola: 42002010 markings, 133625598 edges, 138866 markings/sec, 280 secs
lola: 42723658 markings, 135923126 edges, 144330 markings/sec, 285 secs
lola: 43350191 markings, 138181014 edges, 125307 markings/sec, 290 secs
lola: 43991023 markings, 140226327 edges, 128166 markings/sec, 295 secs
lola: 44598632 markings, 142444106 edges, 121522 markings/sec, 300 secs
lola: 45359466 markings, 144670250 edges, 152167 markings/sec, 305 secs
lola: 46008258 markings, 146855778 edges, 129758 markings/sec, 310 secs
lola: 46709823 markings, 148988627 edges, 140313 markings/sec, 315 secs
lola: 47418400 markings, 151111076 edges, 141715 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: '\ufffd'
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="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-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 irma4mcc-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 r114-csrt-152666472700444"
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 ;