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 216K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 16K 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.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 54K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is PermAdmissibility-COL-50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-csrt-152732587500133
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527831080998


BK_STOP 1527832159495

--------------------
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-50 as instance name.
Using PermAdmissibility 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': 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': 1598647, 'Memory': 15941.8, 'Tool': 'lola'}, {'Time': 1698764, 'Memory': 15936.43, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PermAdmissibility-COL-50...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PermAdmissibility-COL-50: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-50: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ PermAdmissibility-COL-50 @ 3540 seconds
----- Start make result stdout -----
----- 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-50-LTLCardinality.task
lola: A (((p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40) U G ((p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 <= p76 + p75 + p74 + p73 + p72 + p71 + p70 + p77)))) : A ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 <= p121)) : A (F (F (F ((2 <= p112))))) : A ((p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138)) : A ((X ((p130 <= p86)) U X (F ((1 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206))))) : A (F ((X ((p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138)) U G ((3 <= p87))))) : A ((1 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99)) : A (X ((3 <= p189))) : A (((3 <= p87) U X (F ((p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40))))) : A (X ((F ((3 <= p147)) U X ((3 <= p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179))))) : A ((p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 <= p76 + p75 + p74 + p73 + p72 + p71 + p70 + p77)) : A ((p147 <= p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155)) : A (G (F (((p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8) U (p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= p43))))) : A (G (((2 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) U X ((2 <= p87))))) : A ((G ((3 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68)) U G ((p198 <= p87)))) : A ((X (G ((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 <= p112))) U G ((2 <= p130))))
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 (((p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40) U G ((p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 <= p76 + p75 + p74 + p73 + p72 + p71 + p70 + p77))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40) U G ((p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 <= p76 + p75 + p74 + p73 + p72 + p71 + p70 + p77))))
lola: processed formula: A (((p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40) U G ((p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 <= p76 + p75 + p74 + p73 + p72 + p71 + p70 + p77))))
lola: processed formula length: 213
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 29 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: 801 markings, 801 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 <= p121))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 <= p121)
lola: processed formula length: 47
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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 (F (F (F ((2 <= p112)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p112)))
lola: processed formula: A (F ((2 <= p112)))
lola: processed formula length: 19
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.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: 1322 markings, 1322 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138)
lola: processed formula length: 112
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((p130 <= p86)) U X (F ((1 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((p130 <= p86) U F ((1 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206)))))
lola: processed formula: A (X (((p130 <= p86) U F ((1 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206)))))
lola: processed formula length: 90
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1016262 markings, 1332804 edges, 203252 markings/sec, 0 secs
lola: 1968364 markings, 2659698 edges, 190420 markings/sec, 5 secs
lola: 2953926 markings, 4026389 edges, 197112 markings/sec, 10 secs
lola: 3874500 markings, 5339927 edges, 184115 markings/sec, 15 secs
lola: 4788730 markings, 6664885 edges, 182846 markings/sec, 20 secs
lola: 5756041 markings, 8013802 edges, 193462 markings/sec, 25 secs
lola: 6680740 markings, 9365162 edges, 184940 markings/sec, 30 secs
lola: 7620939 markings, 10664421 edges, 188040 markings/sec, 35 secs
lola: 8611169 markings, 12015554 edges, 198046 markings/sec, 40 secs
lola: 9485801 markings, 13246961 edges, 174926 markings/sec, 45 secs
lola: 10402011 markings, 14536126 edges, 183242 markings/sec, 50 secs
lola: 11364222 markings, 15910570 edges, 192442 markings/sec, 55 secs
lola: 12209918 markings, 17152901 edges, 169139 markings/sec, 60 secs
lola: 13118332 markings, 18427268 edges, 181683 markings/sec, 65 secs
lola: 14020992 markings, 19724939 edges, 180532 markings/sec, 70 secs
lola: 14895644 markings, 21021900 edges, 174930 markings/sec, 75 secs
lola: 15808752 markings, 22342204 edges, 182622 markings/sec, 80 secs
lola: 16683949 markings, 23648516 edges, 175039 markings/sec, 85 secs
lola: 17539910 markings, 24944198 edges, 171192 markings/sec, 90 secs
lola: 18453576 markings, 26313370 edges, 182733 markings/sec, 95 secs
lola: 19410059 markings, 27702255 edges, 191297 markings/sec, 100 secs
lola: 20466512 markings, 29184911 edges, 211291 markings/sec, 105 secs
lola: 21491006 markings, 30701307 edges, 204899 markings/sec, 110 secs
lola: 22517071 markings, 32173802 edges, 205213 markings/sec, 115 secs
lola: 23475176 markings, 33593187 edges, 191621 markings/sec, 120 secs
lola: 24378916 markings, 34979056 edges, 180748 markings/sec, 125 secs
lola: 25336083 markings, 36405462 edges, 191433 markings/sec, 130 secs
lola: 26294463 markings, 37859688 edges, 191676 markings/sec, 135 secs
lola: 27062112 markings, 38941353 edges, 153530 markings/sec, 140 secs
lola: 27062629 markings, 38942081 edges, 103 markings/sec, 145 secs
lola: 27064984 markings, 38945459 edges, 471 markings/sec, 150 secs
lola: 27066070 markings, 38946981 edges, 217 markings/sec, 155 secs
lola: 27067835 markings, 38949460 edges, 353 markings/sec, 160 secs
lola: 27067846 markings, 38949477 edges, 2 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138)) U G ((3 <= p87)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((X ((p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138)) U G ((3 <= p87)))))
lola: processed formula: A (F ((X ((p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138)) U G ((3 <= p87)))))
lola: processed formula length: 143
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.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: 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: 802 markings, 803 edges
lola: ========================================
lola: subprocess 6 will run for 334 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99)
lola: processed formula length: 56
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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 7 will run for 371 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p189)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((3 <= p189)))
lola: processed formula: A (X ((3 <= p189)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 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: 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: 801 markings, 801 edges
lola: ========================================
lola: subprocess 8 will run for 417 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p87) U X (F ((p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((3 <= p87) U X (F ((p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40)))))
lola: processed formula: A (((3 <= p87) U X (F ((p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 <= p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40)))))
lola: processed formula length: 123
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 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: 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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 9 will run for 477 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((3 <= p147)) U X ((3 <= p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((F ((3 <= p147)) U X ((3 <= p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179)))))
lola: processed formula: A (X ((F ((3 <= p147)) U X ((3 <= p172 + p173 + p174 + p175 + p176 + p177 + p178 + p179)))))
lola: processed formula length: 92
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 1332 markings, 1332 edges
lola: ========================================
lola: subprocess 10 will run for 556 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 <= p76 + p75 + p74 + p73 + p72 + p71 + p70 + p77))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60 <= p76 + p75 + p74 + p73 + p72 + p71 + p70 + p77)
lola: processed formula length: 96
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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 11 will run for 668 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p147 <= p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p147 <= p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155)
lola: processed formula length: 63
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-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 12 will run for 835 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8) U (p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= p43)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (((p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8) U (p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= p43)))))
lola: processed formula: A (G (F (((p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8) U (p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51 <= p43)))))
lola: processed formula length: 167
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.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: 32332 markings, 81709 edges, 6466 markings/sec, 0 secs
lola: 66198 markings, 175692 edges, 6773 markings/sec, 5 secs
lola: 95048 markings, 272608 edges, 5770 markings/sec, 10 secs
lola: 130346 markings, 379060 edges, 7060 markings/sec, 15 secs
lola: 163703 markings, 486587 edges, 6671 markings/sec, 20 secs
lola: 197102 markings, 588627 edges, 6680 markings/sec, 25 secs
lola: 228582 markings, 688038 edges, 6296 markings/sec, 30 secs
lola: 258289 markings, 790085 edges, 5941 markings/sec, 35 secs
lola: 287888 markings, 891870 edges, 5920 markings/sec, 40 secs
lola: 315554 markings, 988501 edges, 5533 markings/sec, 45 secs
lola: 341394 markings, 1083311 edges, 5168 markings/sec, 50 secs
lola: 373641 markings, 1178363 edges, 6449 markings/sec, 55 secs
lola: 402931 markings, 1274414 edges, 5858 markings/sec, 60 secs
lola: 432450 markings, 1373333 edges, 5904 markings/sec, 65 secs
lola: 463802 markings, 1476923 edges, 6270 markings/sec, 70 secs
lola: 492030 markings, 1572326 edges, 5646 markings/sec, 75 secs
lola: 519426 markings, 1673562 edges, 5479 markings/sec, 80 secs
lola: 547849 markings, 1779580 edges, 5685 markings/sec, 85 secs
lola: 578267 markings, 1892491 edges, 6084 markings/sec, 90 secs
lola: 606712 markings, 2006032 edges, 5689 markings/sec, 95 secs
lola: 642164 markings, 2114554 edges, 7090 markings/sec, 100 secs
lola: 675673 markings, 2223738 edges, 6702 markings/sec, 105 secs
lola: 708279 markings, 2331114 edges, 6521 markings/sec, 110 secs
lola: 738188 markings, 2440090 edges, 5982 markings/sec, 115 secs
lola: 768653 markings, 2544903 edges, 6093 markings/sec, 120 secs
lola: 794828 markings, 2642777 edges, 5235 markings/sec, 125 secs
lola: 819643 markings, 2743380 edges, 4963 markings/sec, 130 secs
lola: 849306 markings, 2840323 edges, 5933 markings/sec, 135 secs
lola: 875941 markings, 2934322 edges, 5327 markings/sec, 140 secs
lola: 901669 markings, 3028761 edges, 5146 markings/sec, 145 secs
lola: 932103 markings, 3121582 edges, 6087 markings/sec, 150 secs
lola: 961387 markings, 3217423 edges, 5857 markings/sec, 155 secs
lola: 991406 markings, 3324324 edges, 6004 markings/sec, 160 secs
lola: 1021589 markings, 3433670 edges, 6037 markings/sec, 165 secs
lola: 1051695 markings, 3538300 edges, 6021 markings/sec, 170 secs
lola: 1079276 markings, 3643635 edges, 5516 markings/sec, 175 secs
lola: 1107401 markings, 3744691 edges, 5625 markings/sec, 180 secs
lola: 1137882 markings, 3846937 edges, 6096 markings/sec, 185 secs
lola: 1166506 markings, 3950691 edges, 5725 markings/sec, 190 secs
lola: 1192963 markings, 4051674 edges, 5291 markings/sec, 195 secs
lola: 1218571 markings, 4151133 edges, 5122 markings/sec, 200 secs
lola: 1245558 markings, 4256755 edges, 5397 markings/sec, 205 secs
lola: 1268673 markings, 4356008 edges, 4623 markings/sec, 210 secs
lola: 1299727 markings, 4460420 edges, 6211 markings/sec, 215 secs
lola: 1328678 markings, 4566053 edges, 5790 markings/sec, 220 secs
lola: 1356592 markings, 4672551 edges, 5583 markings/sec, 225 secs
lola: 1383340 markings, 4779599 edges, 5350 markings/sec, 230 secs
lola: 1408490 markings, 4879897 edges, 5030 markings/sec, 235 secs
lola: 1433131 markings, 4974728 edges, 4928 markings/sec, 240 secs
lola: 1461145 markings, 5069131 edges, 5603 markings/sec, 245 secs
lola: 1492554 markings, 5165226 edges, 6282 markings/sec, 250 secs
lola: 1524025 markings, 5270016 edges, 6294 markings/sec, 255 secs
lola: 1552006 markings, 5366340 edges, 5596 markings/sec, 260 secs
lola: 1582096 markings, 5461735 edges, 6018 markings/sec, 265 secs
lola: 1608912 markings, 5557174 edges, 5363 markings/sec, 270 secs
lola: 1637089 markings, 5663838 edges, 5635 markings/sec, 275 secs
lola: 1665849 markings, 5770019 edges, 5752 markings/sec, 280 secs
lola: 1694192 markings, 5877068 edges, 5669 markings/sec, 285 secs
lola: 1720537 markings, 5982226 edges, 5269 markings/sec, 290 secs
lola: 1750071 markings, 6084422 edges, 5907 markings/sec, 295 secs
lola: 1776523 markings, 6187648 edges, 5290 markings/sec, 300 secs
lola: 1803470 markings, 6290450 edges, 5389 markings/sec, 305 secs
lola: 1830429 markings, 6391824 edges, 5392 markings/sec, 310 secs
lola: 1861090 markings, 6493799 edges, 6132 markings/sec, 315 secs
lola: 1888801 markings, 6594165 edges, 5542 markings/sec, 320 secs
lola: 1915797 markings, 6698279 edges, 5399 markings/sec, 325 secs
lola: 1941927 markings, 6799677 edges, 5226 markings/sec, 330 secs
lola: 1967954 markings, 6902898 edges, 5205 markings/sec, 335 secs
lola: 1992777 markings, 7007733 edges, 4965 markings/sec, 340 secs
lola: 2018696 markings, 7109991 edges, 5184 markings/sec, 345 secs
lola: 2043460 markings, 7212635 edges, 4953 markings/sec, 350 secs
lola: 2070906 markings, 7316939 edges, 5489 markings/sec, 355 secs
lola: 2099320 markings, 7426570 edges, 5683 markings/sec, 360 secs
lola: 2125753 markings, 7535634 edges, 5287 markings/sec, 365 secs
lola: 2149230 markings, 7636039 edges, 4695 markings/sec, 370 secs
lola: 2173565 markings, 7735088 edges, 4867 markings/sec, 375 secs
lola: 2196061 markings, 7834703 edges, 4499 markings/sec, 380 secs
lola: 2224427 markings, 7936081 edges, 5673 markings/sec, 385 secs
lola: 2256332 markings, 8037061 edges, 6381 markings/sec, 390 secs
lola: 2286584 markings, 8136416 edges, 6050 markings/sec, 395 secs
lola: 2317036 markings, 8240385 edges, 6090 markings/sec, 400 secs
lola: 2343743 markings, 8340947 edges, 5341 markings/sec, 405 secs
lola: 2372131 markings, 8437107 edges, 5678 markings/sec, 410 secs
lola: 2397053 markings, 8532932 edges, 4984 markings/sec, 415 secs
lola: 2421763 markings, 8631201 edges, 4942 markings/sec, 420 secs
lola: 2448961 markings, 8724782 edges, 5440 markings/sec, 425 secs
lola: 2479266 markings, 8829396 edges, 6061 markings/sec, 430 secs
lola: 2507442 markings, 8936663 edges, 5635 markings/sec, 435 secs
lola: 2535116 markings, 9039729 edges, 5535 markings/sec, 440 secs
lola: 2559300 markings, 9138112 edges, 4837 markings/sec, 445 secs
lola: 2584314 markings, 9240882 edges, 5003 markings/sec, 450 secs
lola: 2611629 markings, 9337138 edges, 5463 markings/sec, 455 secs
lola: 2638586 markings, 9439595 edges, 5391 markings/sec, 460 secs
lola: 2665075 markings, 9544983 edges, 5298 markings/sec, 465 secs
lola: 2689679 markings, 9640592 edges, 4921 markings/sec, 470 secs
lola: 2712432 markings, 9737965 edges, 4551 markings/sec, 475 secs
lola: 2736451 markings, 9835286 edges, 4804 markings/sec, 480 secs
lola: 2759199 markings, 9935923 edges, 4550 markings/sec, 485 secs
lola: 2784913 markings, 10039817 edges, 5143 markings/sec, 490 secs
lola: 2815481 markings, 10142851 edges, 6114 markings/sec, 495 secs
lola: 2843928 markings, 10245671 edges, 5689 markings/sec, 500 secs
lola: 2872223 markings, 10349535 edges, 5659 markings/sec, 505 secs
lola: 2897980 markings, 10453005 edges, 5151 markings/sec, 510 secs
lola: 2923550 markings, 10548847 edges, 5114 markings/sec, 515 secs
lola: 2951423 markings, 10650182 edges, 5575 markings/sec, 520 secs
lola: 2979829 markings, 10743415 edges, 5681 markings/sec, 525 secs
lola: 3008291 markings, 10835789 edges, 5692 markings/sec, 530 secs
lola: 3034534 markings, 10930877 edges, 5249 markings/sec, 535 secs
lola: 3060075 markings, 11026539 edges, 5108 markings/sec, 540 secs
lola: 3088874 markings, 11127795 edges, 5760 markings/sec, 545 secs
lola: 3117862 markings, 11231153 edges, 5798 markings/sec, 550 secs
lola: 3144877 markings, 11335742 edges, 5403 markings/sec, 555 secs
lola: 3172092 markings, 11439057 edges, 5443 markings/sec, 560 secs
lola: 3203311 markings, 11543529 edges, 6244 markings/sec, 565 secs
lola: 3229351 markings, 11638622 edges, 5208 markings/sec, 570 secs
lola: 3254011 markings, 11735645 edges, 4932 markings/sec, 575 secs
lola: 3279247 markings, 11830547 edges, 5047 markings/sec, 580 secs
lola: 3302935 markings, 11925537 edges, 4738 markings/sec, 585 secs
lola: 3326785 markings, 12022689 edges, 4770 markings/sec, 590 secs
lola: 3350121 markings, 12120924 edges, 4667 markings/sec, 595 secs
lola: 3378781 markings, 12219021 edges, 5732 markings/sec, 600 secs
lola: 3404729 markings, 12312774 edges, 5190 markings/sec, 605 secs
lola: 3428655 markings, 12407529 edges, 4785 markings/sec, 610 secs
lola: 3454674 markings, 12506826 edges, 5204 markings/sec, 615 secs
lola: 3477722 markings, 12603043 edges, 4610 markings/sec, 620 secs
lola: 3501101 markings, 12697851 edges, 4676 markings/sec, 625 secs
lola: 3527153 markings, 12797812 edges, 5210 markings/sec, 630 secs
lola: 3550112 markings, 12891601 edges, 4592 markings/sec, 635 secs
lola: 3579939 markings, 12990186 edges, 5965 markings/sec, 640 secs
lola: 3607617 markings, 13091989 edges, 5536 markings/sec, 645 secs
lola: 3633029 markings, 13189576 edges, 5082 markings/sec, 650 secs
lola: 3657715 markings, 13284262 edges, 4937 markings/sec, 655 secs
lola: 3681669 markings, 13379684 edges, 4791 markings/sec, 660 secs
lola: 3706964 markings, 13482884 edges, 5059 markings/sec, 665 secs
lola: 3731977 markings, 13590096 edges, 5003 markings/sec, 670 secs
lola: 3758179 markings, 13695277 edges, 5240 markings/sec, 675 secs
lola: 3782578 markings, 13801002 edges, 4880 markings/sec, 680 secs
lola: 3807230 markings, 13900463 edges, 4930 markings/sec, 685 secs
lola: 3831086 markings, 13998460 edges, 4771 markings/sec, 690 secs
lola: 3853971 markings, 14100086 edges, 4577 markings/sec, 695 secs
lola: 3875492 markings, 14198891 edges, 4304 markings/sec, 700 secs
lola: 3903373 markings, 14292525 edges, 5576 markings/sec, 705 secs
lola: 3929461 markings, 14386790 edges, 5218 markings/sec, 710 secs
lola: 3953743 markings, 14482886 edges, 4856 markings/sec, 715 secs
lola: 3977967 markings, 14575876 edges, 4845 markings/sec, 720 secs
lola: 4001129 markings, 14671316 edges, 4632 markings/sec, 725 secs
lola: 4023939 markings, 14767544 edges, 4562 markings/sec, 730 secs
lola: 4049175 markings, 14868119 edges, 5047 markings/sec, 735 secs
lola: 4074092 markings, 14972109 edges, 4983 markings/sec, 740 secs
lola: 4095848 markings, 15067411 edges, 4351 markings/sec, 745 secs
lola: 4117075 markings, 15166181 edges, 4245 markings/sec, 750 secs
lola: 4141741 markings, 15258145 edges, 4933 markings/sec, 755 secs
lola: 4166029 markings, 15354415 edges, 4858 markings/sec, 760 secs
lola: 4188755 markings, 15447951 edges, 4545 markings/sec, 765 secs
lola: 4219817 markings, 15543351 edges, 6212 markings/sec, 770 secs
lola: 4248738 markings, 15639404 edges, 5784 markings/sec, 775 secs
lola: 4278323 markings, 15740186 edges, 5917 markings/sec, 780 secs
lola: 4307335 markings, 15835902 edges, 5802 markings/sec, 785 secs
lola: 4337369 markings, 15935826 edges, 6007 markings/sec, 790 secs
lola: 4364985 markings, 16038796 edges, 5523 markings/sec, 795 secs
lola: 4392011 markings, 16141088 edges, 5405 markings/sec, 800 secs
lola: 4420257 markings, 16244722 edges, 5649 markings/sec, 805 secs
lola: 4447390 markings, 16349033 edges, 5427 markings/sec, 810 secs
lola: 4473603 markings, 16449720 edges, 5243 markings/sec, 815 secs
lola: 4501846 markings, 16551921 edges, 5649 markings/sec, 820 secs
lola: 4526873 markings, 16651919 edges, 5005 markings/sec, 825 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 835 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) U X ((2 <= p87)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (((2 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) U X ((2 <= p87)))))
lola: processed formula: A (G (((2 <= p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111) U X ((2 <= p87)))))
lola: processed formula length: 87
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 801 markings, 801 edges
lola: ========================================
lola: subprocess 14 will run for 1252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G ((3 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68)) U G ((p198 <= p87))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G ((3 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68)) U G ((p198 <= p87))))
lola: processed formula: A ((G ((3 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68)) U G ((p198 <= p87))))
lola: processed formula length: 82
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 29 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: 801 markings, 801 edges
lola: ========================================
lola: subprocess 15 will run for 2505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 <= p112))) U G ((2 <= p130))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (G ((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 <= p112))) U G ((2 <= p130))))
lola: processed formula: A ((X (G ((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 <= p112))) U G ((2 <= p130))))
lola: processed formula length: 87
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 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: 801 markings, 801 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes unknown no no no yes no yes yes unknown no no no
FORMULA PermAdmissibility-COL-50-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
FORMULA PermAdmissibility-COL-50-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- 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-50"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-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-50.tgz
mv PermAdmissibility-COL-50 execution
cd execution
pwd
ls -lh

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