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 192K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K 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 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 14K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is CSRepetitions-COL-05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-ebro-152732364100119
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527506519587


BK_STOP 1527506845523

--------------------
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 CSRepetitions-COL-05 as instance name.
Using CSRepetitions as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': True, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 222047, 'Memory': 9457.14, 'Tool': 'lola'}, {'Time': 222059, 'Memory': 8749.66, 'Tool': 'lola'}, {'Time': 3512290, 'Memory': 15381.38, 'Tool': 'itstools'}, {'Time': 3512667, 'Memory': 15380.38, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'gspn'}].
LTLCardinality lola CSRepetitions-COL-05...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
CSRepetitions-COL-05: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
CSRepetitions-COL-05: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ CSRepetitions-COL-05 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
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: 531/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 206 places, 325 transitions, 176 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 501 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-COL-05-LTLCardinality.task
lola: A ((G ((1 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205)) U X (G ((3 <= p155))))) : A ((1 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205)) : A (X ((F ((1 <= p5 + p6 + p7 + p8 + p9 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)) U X ((2 <= p5 + p6 + p7 + p8 + p9 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10))))) : A ((1 <= p155)) : A ((G (G ((p5 + p6 + p7 + p8 + p9 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p160 + p159 + p158 + p157 + p156))) U X (X ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p95 + p96 + p97 + p98 + p99))))) : A (F (F (X (G ((p155 <= p0 + p1 + p2 + p3 + p4)))))) : A (G (X (G (G ((p0 + p1 + p2 + p3 + p4 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205)))))) : A ((((1 <= p5 + p6 + p7 + p8 + p9 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10) U (p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p160 + p159 + p158 + p157 + p156 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205)) U G (G ((p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= p0 + p1 + p2 + p3 + p4))))) : A (((2 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205) U (p0 + p1 + p2 + p3 + p4 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205))) : A (G (((3 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205) U X ((1 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205))))) : A ((G (X ((p5 + p6 + p7 + p8 + p9 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p0 + p1 + p2 + p3 + p4))) U ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p95 + p96 + p97 + p98 + p99) U (p0 + p1 + p2 + p3 + p4 <= p155)))) : A (G (F (G (X ((3 <= p155)))))) : A (F (F (G (F ((p0 + p1 + p2 + p3 + p4 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p160 + p159 + p158 + p157 + p156)))))) : A (((p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p160 + p159 + p158 + p157 + p156) U F (X ((3 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205))))) : A (F ((1 <= p5 + p6 + p7 + p8 + p9 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10))) : A (F ((F ((3 <= p0 + p1 + p2 + p3 + p4)) U F ((3 <= p0 + p1 + p2 + p3 + p4)))))
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 ((1 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205)) U X (G ((3 <= p155)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G ((1 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205)) U X (G ((3 <= p155)))))
lola: processed formula: A ((G ((1 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205)) U X (G ((3 <= p155)))))
lola: processed formula length: 211
lola: 0 rewrites
lola: formula mentions 0 of 206 places; total mentions: 0
lola: closed formula file CSRepetitions-COL-05-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 36 markings, 36 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205)
lola: processed formula length: 179
lola: 1 rewrites
lola: formula mentions 0 of 206 places; total mentions: 0
lola: closed formula file CSRepetitions-COL-05-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((1 <= p5 + p6 + p7 + p8 + p9 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)) U X ((2 <= p5 + p6 + p7 + p8 + p9 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((F ((1 <= p5 + p6 + p7 + p8 + p9 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)) U X ((2 <= p5 + p6 + p7 + p8 + p9 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)))))
lola: processed formula: A (X ((F ((1 <= p5 + p6 + p7 + p8 + p9 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)) U X ((2 <= p5 + p6 + p7 + p8 + p9 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10)))))
lola: processed formula length: 319
lola: 0 rewrites
lola: formula mentions 0 of 206 places; total mentions: 0
lola: closed formula file CSRepetitions-COL-05-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 351 markings, 650 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p155))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p155)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 206 places; total mentions: 0
lola: closed formula file CSRepetitions-COL-05-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((p5 + p6 + p7 + p8 + p9 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p160 + p159 + p158 + p157 + p156))) U X (X ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((p5 + p6 + p7 + p8 + p9 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p160 + p159 + p158 + p157 + p156))) U X (X ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p94 + p93 + p92 + p91 + p90 + p89 + p88 + p87 + p86 + p85 + p84 + p83 + p82 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69 + p95 + p96 + p97 + p98 + p99)))))
lola: processed formula: A ((G (G ((p5 + p6 + p7 + p8 + p9 + p29 + p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 <= p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p160 + p159 + p158 + p157 + p156))) U X (X ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107... (shortened)
lola: processed formula length: 1154
lola: 0 rewrites
lola: formula mentions 0 of 206 places; total mentions: 0
lola: closed formula file CSRepetitions-COL-05-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 11 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 36 markings, 36 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (X (G ((p155 <= p0 + p1 + p2 + p3 + p4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (G ((p155 <= p0 + p1 + p2 + p3 + p4)))))
lola: processed formula: A (F (X (G ((p155 <= p0 + p1 + p2 + p3 + p4)))))
lola: processed formula length: 48
lola: 1 rewrites
lola: formula mentions 0 of 206 places; total mentions: 0
lola: closed formula file CSRepetitions-COL-05-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 378968 markings, 2403712 edges, 75794 markings/sec, 0 secs
lola: 685136 markings, 4623845 edges, 61234 markings/sec, 5 secs
lola: 1003420 markings, 6943104 edges, 63657 markings/sec, 10 secs
lola: 1285458 markings, 9190645 edges, 56408 markings/sec, 15 secs
lola: 1601323 markings, 11475095 edges, 63173 markings/sec, 20 secs
lola: 1890860 markings, 13740227 edges, 57907 markings/sec, 25 secs
lola: 2174841 markings, 15995939 edges, 56796 markings/sec, 30 secs
lola: 2434294 markings, 18183945 edges, 51891 markings/sec, 35 secs
lola: 2693422 markings, 20363470 edges, 51826 markings/sec, 40 secs
lola: 2995662 markings, 22587773 edges, 60448 markings/sec, 45 secs
lola: 3262574 markings, 24752823 edges, 53382 markings/sec, 50 secs
lola: 3537598 markings, 26909855 edges, 55005 markings/sec, 55 secs
lola: 3787273 markings, 29039880 edges, 49935 markings/sec, 60 secs
lola: 4038132 markings, 31159057 edges, 50172 markings/sec, 65 secs
lola: 4295197 markings, 33279527 edges, 51413 markings/sec, 70 secs
lola: 4535121 markings, 35376208 edges, 47985 markings/sec, 75 secs
lola: 4772298 markings, 37443033 edges, 47435 markings/sec, 80 secs
lola: 5000216 markings, 39527299 edges, 45584 markings/sec, 85 secs
lola: 5210444 markings, 41568816 edges, 42046 markings/sec, 90 secs
lola: 5514772 markings, 43818760 edges, 60866 markings/sec, 95 secs
lola: 5795851 markings, 46005719 edges, 56216 markings/sec, 100 secs
lola: 6066214 markings, 48176807 edges, 54073 markings/sec, 105 secs
lola: 6325700 markings, 50321893 edges, 51897 markings/sec, 110 secs
lola: 6552982 markings, 52401961 edges, 45456 markings/sec, 115 secs
lola: 6820390 markings, 54476913 edges, 53482 markings/sec, 120 secs
lola: 7064741 markings, 56561172 edges, 48870 markings/sec, 125 secs
lola: 7305002 markings, 58675685 edges, 48052 markings/sec, 130 secs
lola: 7533337 markings, 60757059 edges, 45667 markings/sec, 135 secs
lola: 7758303 markings, 62836537 edges, 44993 markings/sec, 140 secs
lola: 8001985 markings, 64954046 edges, 48736 markings/sec, 145 secs
lola: 8253664 markings, 67036636 edges, 50336 markings/sec, 150 secs
lola: 8486400 markings, 69102091 edges, 46547 markings/sec, 155 secs
lola: 8726419 markings, 71177000 edges, 48004 markings/sec, 160 secs
lola: 8950016 markings, 73228009 edges, 44719 markings/sec, 165 secs
lola: 9154263 markings, 75236925 edges, 40849 markings/sec, 170 secs
lola: 9392757 markings, 77298294 edges, 47699 markings/sec, 175 secs
lola: 9614212 markings, 79335629 edges, 44291 markings/sec, 180 secs
lola: 9816340 markings, 81334855 edges, 40426 markings/sec, 185 secs
lola: 10028763 markings, 83313921 edges, 42485 markings/sec, 190 secs
lola: 10226129 markings, 85278677 edges, 39473 markings/sec, 195 secs
lola: 10412486 markings, 87216113 edges, 37271 markings/sec, 200 secs
lola: 10681167 markings, 89368167 edges, 53736 markings/sec, 205 secs
lola: 10971947 markings, 91600293 edges, 58156 markings/sec, 210 secs
lola: 11251741 markings, 93825026 edges, 55959 markings/sec, 215 secs
lola: 11518884 markings, 96027102 edges, 53429 markings/sec, 220 secs
lola: 11761862 markings, 98176909 edges, 48596 markings/sec, 225 secs
lola: 12036315 markings, 100373310 edges, 54891 markings/sec, 230 secs
lola: 12265982 markings, 102314393 edges, 45933 markings/sec, 235 secs
lola: 12484749 markings, 104275162 edges, 43753 markings/sec, 240 secs
lola: 12711130 markings, 106243780 edges, 45276 markings/sec, 245 secs
lola: 12923190 markings, 108212481 edges, 42412 markings/sec, 250 secs
lola: 13124134 markings, 110165199 edges, 40189 markings/sec, 255 secs
lola: 13386973 markings, 112238227 edges, 52568 markings/sec, 260 secs
lola: 13625112 markings, 114267878 edges, 47628 markings/sec, 265 secs
lola: 13851986 markings, 116273809 edges, 45375 markings/sec, 270 secs
lola: 14074131 markings, 118274586 edges, 44429 markings/sec, 275 secs
lola: 14287390 markings, 120251469 edges, 42652 markings/sec, 280 secs
lola: 14491830 markings, 122170483 edges, 40888 markings/sec, 285 secs
lola: 14713377 markings, 124142785 edges, 44309 markings/sec, 290 secs
lola: 14917452 markings, 126045691 edges, 40815 markings/sec, 295 secs
lola: 15113894 markings, 127958278 edges, 39288 markings/sec, 300 secs
lola: 15316732 markings, 129884255 edges, 40568 markings/sec, 305 secs
lola: 15509199 markings, 131801389 edges, 38493 markings/sec, 310 secs
lola: 15688504 markings, 133702315 edges, 35861 markings/sec, 315 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 CSRepetitions-COL-05-LTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-COL-05-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-COL-05-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-COL-05-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-COL-05-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-COL-05-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-COL-05-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-COL-05-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-COL-05-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-COL-05-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-COL-05-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-COL-05-LTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-COL-05-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-COL-05-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-COL-05-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-COL-05-LTLCardinality-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="CSRepetitions-COL-05"
export BK_EXAMINATION="LTLCardinality"
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/CSRepetitions-COL-05.tgz
mv CSRepetitions-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 CSRepetitions-COL-05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-ebro-152732364100119"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;