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

About the Execution of Irma.struct for PermAdmissibility-COL-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11269.930 570728.00 590593.00 223.90 ???????????????? 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-structural
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 r115-csrt-152666474100444
=====================================================================


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


BK_STOP 1527153922330

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-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': 'itstools'}].
CTLCardinality lola PermAdmissibility-COL-05...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33) OR (2 <= p84)))))) : E (F ((E (G ((p197 <= p111))) OR ()))) : (E (G (E (G ((p137 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67))))) AND (p207 <= p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155)) : E ((A (G ((1 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67))) U E (G ((2 <= p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155))))) : NOT(((E (G ((p102 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83))) AND ((3 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67) AND (p24 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) AND (p85 <= 0))) AND (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= 2))) : A (F (A (G ((p90 + p89 + p88 + p87 + p86 + p91 + p92 + p93 <= 0))))) : A (G (A (F ((p100 + p101 + p94 + p95 + p96 + p97 + p98 + p99 <= 0))))) : (A (G ((p51 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67))) AND A (X (((p137 <= p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155) OR (3 <= p198) OR (p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59))))) : (((((2 <= p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110) AND (p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 <= p25)) OR (p34 + 1 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188) OR (p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 <= p90 + p89 + p88 + p87 + p86 + p91 + p92 + p93) OR (2 <= p198) OR ((p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 <= p136) AND (p147 <= p84))) AND ((p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) AND A (F ((1 <= p51))))) OR (((p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 <= p147) OR E (X ((p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 <= p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146)))) AND ((((p147 <= p111) AND (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15)) OR (p197 + 1 <= p24)) OR A (X ((3 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196)))))) : E (F (E (((2 <= p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196) U (3 <= p25))))) : A ((E (X ((p137 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206))) U ((1 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59) OR ((1 <= p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50) AND (p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 <= p102))))) : A (F ((A (G ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75))) AND (2 <= p90 + p89 + p88 + p87 + p86 + p91 + p92 + p93)))) : A (F (A (((p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) U (2 <= p90 + p89 + p88 + p87 + p86 + p91 + p92 + p93))))) : (A (X (((p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 <= 1) AND (p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + 1 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206)))) OR E (G (((p137 <= p51) OR (p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= p164) OR (3 <= p111))))) : ((p147 <= p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23) AND E (G (A (G ((p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206)))))) : E (F (E (((p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 <= p137) U (1 <= p90 + p89 + p88 + p87 + p86 + p91 + p92 + p93)))))
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 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33) OR (2 <= p84))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(((2 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33) OR (2 <= p84))))))
lola: processed formula length: 93
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: 34 markings, 33 edges
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: lola: ========================================...considering subproblem: E (F ((E (G ((p197 <= p111))) OR ())))

lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (p111 + 1 <= p197))))
lola: processed formula length: 43
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: 1186055 markings, 1760486 edges, 2806861595810988032 markings/sec, 0 secs
lola: 2381447 markings, 3513894 edges, 239078 markings/sec, 5 secs
lola: 3464405 markings, 5572811 edges, 216592 markings/sec, 10 secs
lola: 4260869 markings, 7723850 edges, 159293 markings/sec, 15 secs
lola: 5084037 markings, 9604965 edges, 164634 markings/sec, 20 secs
lola: 5794576 markings, 11494346 edges, 142108 markings/sec, 25 secs
lola: 6557387 markings, 13380863 edges, 152562 markings/sec, 30 secs
lola: 7355925 markings, 15200025 edges, 159708 markings/sec, 35 secs
lola: 8105990 markings, 17088990 edges, 150013 markings/sec, 40 secs
lola: 8840327 markings, 18936270 edges, 146867 markings/sec, 45 secs
lola: 9680048 markings, 20922166 edges, 167944 markings/sec, 50 secs
lola: 10416223 markings, 22725141 edges, 147235 markings/sec, 55 secs
lola: 11096688 markings, 24489503 edges, 136093 markings/sec, 60 secs
lola: 11864577 markings, 26299107 edges, 153578 markings/sec, 65 secs
lola: 12580484 markings, 28146657 edges, 143181 markings/sec, 70 secs
lola: 13329936 markings, 29943474 edges, 149890 markings/sec, 75 secs
lola: 13971306 markings, 31587534 edges, 128274 markings/sec, 80 secs
lola: 14767603 markings, 33416447 edges, 159259 markings/sec, 85 secs
lola: 15499097 markings, 35295065 edges, 146299 markings/sec, 90 secs
lola: 16284863 markings, 37229647 edges, 157153 markings/sec, 95 secs
lola: 17077140 markings, 39125270 edges, 158455 markings/sec, 100 secs
lola: 17888139 markings, 41031246 edges, 162200 markings/sec, 105 secs
lola: 18579340 markings, 43021990 edges, 138240 markings/sec, 110 secs
lola: 19223792 markings, 44832024 edges, 128890 markings/sec, 115 secs
lola: 19858675 markings, 46619316 edges, 126977 markings/sec, 120 secs
lola: 20519320 markings, 48500340 edges, 132129 markings/sec, 125 secs
lola: 21127427 markings, 50243551 edges, 121621 markings/sec, 130 secs
lola: 21764738 markings, 52040138 edges, 127462 markings/sec, 135 secs
lola: 22419618 markings, 53830343 edges, 130976 markings/sec, 140 secs
lola: 23002490 markings, 55703993 edges, 116574 markings/sec, 145 secs
lola: 23572721 markings, 57570569 edges, 114046 markings/sec, 150 secs
lola: 24184864 markings, 59461454 edges, 122429 markings/sec, 155 secs
lola: 24709442 markings, 61191854 edges, 104916 markings/sec, 160 secs
lola: 25259758 markings, 62940407 edges, 110063 markings/sec, 165 secs
lola: 25794970 markings, 64676272 edges, 107042 markings/sec, 170 secs
lola: 26341043 markings, 66469475 edges, 109215 markings/sec, 175 secs
lola: 26919670 markings, 68315614 edges, 115725 markings/sec, 180 secs
lola: 27520463 markings, 70186909 edges, 120159 markings/sec, 185 secs
lola: 28161033 markings, 72007597 edges, 128114 markings/sec, 190 secs
lola: 28861713 markings, 74236770 edges, 140136 markings/sec, 195 secs
lola: 29533611 markings, 76180999 edges, 134380 markings/sec, 200 secs
lola: 30138427 markings, 78209776 edges, 120963 markings/sec, 205 secs
lola: 30738347 markings, 80269287 edges, 119984 markings/sec, 210 secs
lola: 31345151 markings, 82292626 edges, 121361 markings/sec, 215 secs
lola: 31902620 markings, 84285793 edges, 111494 markings/sec, 220 secs
lola: 32487241 markings, 86259734 edges, 116924 markings/sec, 225 secs
lola: 33088071 markings, 88316251 edges, 120166 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 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (G ((p137 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67))))) AND (p207 <= p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G ((p137 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + 1 <= p137))))
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: (p207 <= p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p207 <= p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155)
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 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67))) U E (G ((2 <= p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(E(TRUE U (p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= 0))) U NOT(A(TRUE U (p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 <= 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 ((p102 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83))) AND ((3 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67) AND (p24 <= p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119) AND (p85 <= 0))) AND (p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 <= 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 ((p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83 + 1 <= p102)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83 + 1 <= p102)))
lola: processed formula: A (F ((p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83 + 1 <= p102)))
lola: processed formula length: 67
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: (((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= 2) OR (p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + 1 <= p24) OR (1 <= p85)) OR (3 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 <= 2) OR (p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + 1 <= p24) OR (1 <= p85)) OR (3 <= p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127))
lola: processed formula length: 206
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 ((p90 + p89 + p88 + p87 + p86 + p91 + p92 + p93 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((p90 + p89 + p88 + p87 + p86 + p91 + p92 + p93 <= 0)))))
lola: processed formula: A (F (A (G ((p90 + p89 + p88 + p87 + p86 + p91 + p92 + p93 <= 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 ((p100 + p101 + p94 + p95 + p96 + p97 + p98 + p99 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (p100 + p101 + p94 + p95 + p96 + p97 + p98 + p99 <= 0)))))
lola: processed formula length: 84
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: 773013 markings, 2338166 edges, 3687029175060791296 markings/sec, 0 secs
lola: 1518635 markings, 5041067 edges, 149124 markings/sec, 5 secs
lola: 2128972 markings, 7618838 edges, 122067 markings/sec, 10 secs
lola: 2723361 markings, 9970109 edges, 118878 markings/sec, 15 secs
lola: 3284778 markings, 12284103 edges, 112283 markings/sec, 20 secs
lola: 3716680 markings, 14523266 edges, 86380 markings/sec, 25 secs
lola: 4214245 markings, 17002910 edges, 99513 markings/sec, 30 secs
lola: 4652726 markings, 19319924 edges, 87696 markings/sec, 35 secs
lola: 5339119 markings, 21595829 edges, 137279 markings/sec, 40 secs
lola: 5953488 markings, 24011368 edges, 122874 markings/sec, 45 secs
lola: 6514597 markings, 26413758 edges, 112222 markings/sec, 50 secs
lola: 7006858 markings, 28794386 edges, 98452 markings/sec, 55 secs
lola: 7539005 markings, 31062263 edges, 106429 markings/sec, 60 secs
lola: 7969903 markings, 33474696 edges, 86180 markings/sec, 65 secs
lola: 8451891 markings, 36121056 edges, 96398 markings/sec, 70 secs
lola: 8985503 markings, 38743160 edges, 106722 markings/sec, 75 secs
lola: 9652915 markings, 41521377 edges, 133482 markings/sec, 80 secs
lola: 10289629 markings, 44089709 edges, 127343 markings/sec, 85 secs
lola: 10823640 markings, 46606683 edges, 106802 markings/sec, 90 secs
lola: 11326255 markings, 48917387 edges, 100523 markings/sec, 95 secs
lola: 11870851 markings, 51324160 edges, 108919 markings/sec, 100 secs
lola: 12403906 markings, 53671568 edges, 106611 markings/sec, 105 secs
lola: 12855680 markings, 56074523 edges, 90355 markings/sec, 110 secs
lola: 13343463 markings, 58522653 edges, 97557 markings/sec, 115 secs
lola: 13831676 markings, 60721407 edges, 97643 markings/sec, 120 secs
lola: 14267373 markings, 63155759 edges, 87139 markings/sec, 125 secs
lola: 14640084 markings, 65359132 edges, 74542 markings/sec, 130 secs
lola: 15150797 markings, 67572673 edges, 102143 markings/sec, 135 secs
lola: 15695389 markings, 69781763 edges, 108918 markings/sec, 140 secs
lola: 16097259 markings, 72025627 edges, 80374 markings/sec, 145 secs
lola: 16515573 markings, 74220072 edges, 83663 markings/sec, 150 secs
lola: 17044816 markings, 76363627 edges, 105849 markings/sec, 155 secs
lola: 17494252 markings, 78585040 edges, 89887 markings/sec, 160 secs
lola: 17908290 markings, 80820753 edges, 82808 markings/sec, 165 secs
lola: 18271528 markings, 83115381 edges, 72648 markings/sec, 170 secs
lola: 18649433 markings, 85270705 edges, 75581 markings/sec, 175 secs
lola: 18976736 markings, 87402678 edges, 65461 markings/sec, 180 secs
lola: 19391874 markings, 89760393 edges, 83028 markings/sec, 185 secs
lola: 19851465 markings, 92235105 edges, 91918 markings/sec, 190 secs
lola: 20228718 markings, 94584213 edges, 75451 markings/sec, 195 secs
lola: 20624853 markings, 97055905 edges, 79227 markings/sec, 200 secs
lola: 20986361 markings, 99220997 edges, 72302 markings/sec, 205 secs
lola: 21338355 markings, 101333847 edges, 70399 markings/sec, 210 secs
lola: 21671380 markings, 103331144 edges, 66605 markings/sec, 215 secs
lola: 22047050 markings, 105594318 edges, 75134 markings/sec, 220 secs
lola: 22707364 markings, 107822855 edges, 132063 markings/sec, 225 secs
lola: 23355291 markings, 110213150 edges, 129585 markings/sec, 230 secs
lola: 23910008 markings, 112501478 edges, 110943 markings/sec, 235 secs
lola: 24480950 markings, 114886091 edges, 114188 markings/sec, 240 secs
lola: 25057286 markings, 117267007 edges, 115267 markings/sec, 245 secs
lola: 25511454 markings, 119606768 edges, 90834 markings/sec, 250 secs
lola: 25968289 markings, 121923424 edges, 91367 markings/sec, 255 secs
lola: 26402315 markings, 124357605 edges, 86805 markings/sec, 260 secs
lola: 27040769 markings, 126603112 edges, 127691 markings/sec, 265 secs
lola: 27620691 markings, 128959103 edges, 115984 markings/sec, 270 secs
lola: 28143221 markings, 131241379 edges, 104506 markings/sec, 275 secs
lola: 28573496 markings, 133420364 edges, 86055 markings/sec, 280 secs
lola: 29052281 markings, 135565817 edges, 95757 markings/sec, 285 secs
lola: 29443575 markings, 137724898 edges, 78259 markings/sec, 290 secs
lola: 29840290 markings, 139988341 edges, 79343 markings/sec, 295 secs
lola: 30212927 markings, 142218200 edges, 74527 markings/sec, 300 secs
lola: 30801353 markings, 144704236 edges, 117685 markings/sec, 305 secs
lola: 31358320 markings, 147059314 edges, 111393 markings/sec, 310 secs
lola: 31883704 markings, 149487837 edges, 105077 markings/sec, 315 secs
lola: 32360422 markings, 151765457 edges, 95344 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 stderr -----
----- Kill lola and sara stdout -----
----- 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-structural"
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-structural"
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 r115-csrt-152666474100444"
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 ;