fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r259-csrt-152732584700127
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
15898.000 1066843.00 1027217.00 960.80 TFTFF?FFT?FFTT?T 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.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K 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.9K 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 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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r259-csrt-152732584700127
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527462851711


BK_STOP 1527463918554

--------------------
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': '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': 728317, 'Memory': 15952.8, 'Tool': 'lola'}, {'Time': 809424, 'Memory': 15936.52, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality 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 LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ PermAdmissibility-COL-05 @ 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-05-LTLCardinality.task
lola: A (F (F (X (F ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107)))))) : A ((G (F ((3 <= p33))) U G (F ((2 <= p137))))) : A ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 <= p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125)) : A ((X (X ((p147 <= p199))) U (p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91 <= p126))) : A (X ((1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117))) : A ((G (F ((p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 <= p147))) U X (F ((2 <= p147))))) : A (G (G (G (G ((2 <= p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91)))))) : A (G (F (G (X ((p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= p189)))))) : A ((p33 <= p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91)) : A (F (X (F (G ((p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p108)))))) : A (X ((3 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207))) : A (G (F (((p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57) U (3 <= p189))))) : A ((p108 <= p66)) : A ((F (F ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107))) U ((p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 <= p136) U (1 <= p198)))) : A (G (G (X (F ((p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134)))))) : A ((((1 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57) U (3 <= p148)) U F ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180))))
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 (F (F (X (F ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (F ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107)))))
lola: processed formula: A (F (X (F ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107)))))
lola: processed formula length: 128
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((3 <= p33))) U G (F ((2 <= p137)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (F ((3 <= p33))) U G (F ((2 <= p137)))))
lola: processed formula: A ((G (F ((3 <= p33))) U G (F ((2 <= p137)))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 102 markings, 102 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 <= p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 <= p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125)
lola: processed formula length: 112
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((p147 <= p199))) U (p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91 <= p126)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (X ((p147 <= p199))) U (p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91 <= p126)))
lola: processed formula: A ((X (X ((p147 <= p199))) U (p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91 <= p126)))
lola: processed formula length: 86
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 108 markings, 108 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117)))
lola: processed formula: A (X ((1 <= p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117)))
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-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: 81 markings, 81 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 <= p147))) U X (F ((2 <= p147)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (F ((p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 <= p147))) U X (F ((2 <= p147)))))
lola: processed formula: A ((G (F ((p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 <= p147))) U X (F ((2 <= p147)))))
lola: processed formula length: 99
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 884312 markings, 2140650 edges, 176862 markings/sec, 0 secs
lola: 1667980 markings, 4170065 edges, 156734 markings/sec, 5 secs
lola: 2373049 markings, 6206163 edges, 141014 markings/sec, 10 secs
lola: 3124041 markings, 8125515 edges, 150198 markings/sec, 15 secs
lola: 3902737 markings, 10092560 edges, 155739 markings/sec, 20 secs
lola: 4690542 markings, 12038758 edges, 157561 markings/sec, 25 secs
lola: 5455871 markings, 14008645 edges, 153066 markings/sec, 30 secs
lola: 6095999 markings, 15882028 edges, 128026 markings/sec, 35 secs
lola: 6765824 markings, 17657637 edges, 133965 markings/sec, 40 secs
lola: 7475881 markings, 19486562 edges, 142011 markings/sec, 45 secs
lola: 8288498 markings, 21526345 edges, 162523 markings/sec, 50 secs
lola: 8978040 markings, 23470982 edges, 137908 markings/sec, 55 secs
lola: 9643452 markings, 25275710 edges, 133082 markings/sec, 60 secs
lola: 10354655 markings, 27130026 edges, 142241 markings/sec, 65 secs
lola: 11125104 markings, 29072623 edges, 154090 markings/sec, 70 secs
lola: 11789825 markings, 31032763 edges, 132944 markings/sec, 75 secs
lola: 12492392 markings, 32954370 edges, 140513 markings/sec, 80 secs
lola: 13223859 markings, 34950300 edges, 146293 markings/sec, 85 secs
lola: 13895469 markings, 36905353 edges, 134322 markings/sec, 90 secs
lola: 14545550 markings, 38823575 edges, 130016 markings/sec, 95 secs
lola: 15235602 markings, 40715298 edges, 138010 markings/sec, 100 secs
lola: 15961679 markings, 42648840 edges, 145215 markings/sec, 105 secs
lola: 16654535 markings, 44667835 edges, 138571 markings/sec, 110 secs
lola: 17288521 markings, 46662515 edges, 126797 markings/sec, 115 secs
lola: 17974835 markings, 48601258 edges, 137263 markings/sec, 120 secs
lola: 18807423 markings, 50802537 edges, 166518 markings/sec, 125 secs
lola: 19533917 markings, 52963897 edges, 145299 markings/sec, 130 secs
lola: 20272913 markings, 55064905 edges, 147799 markings/sec, 135 secs
lola: 20919567 markings, 57048385 edges, 129331 markings/sec, 140 secs
lola: 21623094 markings, 59105865 edges, 140705 markings/sec, 145 secs
lola: 22278808 markings, 61110160 edges, 131143 markings/sec, 150 secs
lola: 22869880 markings, 63302529 edges, 118214 markings/sec, 155 secs
lola: 23491123 markings, 65462579 edges, 124249 markings/sec, 160 secs
lola: 24148698 markings, 67491258 edges, 131515 markings/sec, 165 secs
lola: 24819824 markings, 69401721 edges, 134225 markings/sec, 170 secs
lola: 25464224 markings, 71444525 edges, 128880 markings/sec, 175 secs
lola: 26139257 markings, 73477067 edges, 135007 markings/sec, 180 secs
lola: 26857095 markings, 75487256 edges, 143568 markings/sec, 185 secs
lola: 27495565 markings, 77505983 edges, 127694 markings/sec, 190 secs
lola: 28112725 markings, 79299956 edges, 123432 markings/sec, 195 secs
lola: 28742424 markings, 81074506 edges, 125940 markings/sec, 200 secs
lola: 29382431 markings, 82910725 edges, 128001 markings/sec, 205 secs
lola: 30022318 markings, 84771590 edges, 127977 markings/sec, 210 secs
lola: 30588996 markings, 86595472 edges, 113336 markings/sec, 215 secs
lola: 31248388 markings, 88566352 edges, 131878 markings/sec, 220 secs
lola: 31970512 markings, 90350455 edges, 144425 markings/sec, 225 secs
lola: 32640626 markings, 92081596 edges, 134023 markings/sec, 230 secs
lola: 33312448 markings, 93886447 edges, 134364 markings/sec, 235 secs
lola: 33934736 markings, 95659644 edges, 124458 markings/sec, 240 secs
lola: 34531589 markings, 97326050 edges, 119371 markings/sec, 245 secs
lola: 35184580 markings, 98997982 edges, 130598 markings/sec, 250 secs
lola: 35821307 markings, 100640056 edges, 127345 markings/sec, 255 secs
lola: 36502524 markings, 102272581 edges, 136243 markings/sec, 260 secs
lola: 37132409 markings, 103965069 edges, 125977 markings/sec, 265 secs
lola: 37781997 markings, 105657186 edges, 129918 markings/sec, 270 secs
lola: 38366330 markings, 107387755 edges, 116867 markings/sec, 275 secs
lola: 38944438 markings, 109004636 edges, 115622 markings/sec, 280 secs
lola: 39527688 markings, 110578541 edges, 116650 markings/sec, 285 secs
lola: 40223341 markings, 112276402 edges, 139131 markings/sec, 290 secs
lola: 40908044 markings, 114091528 edges, 136941 markings/sec, 295 secs
lola: 41611756 markings, 115899191 edges, 140742 markings/sec, 300 secs
lola: 42255059 markings, 117794335 edges, 128661 markings/sec, 305 secs
lola: 42842956 markings, 119632253 edges, 117579 markings/sec, 310 secs
lola: 43481058 markings, 121370471 edges, 127620 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (G (G ((2 <= p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (G (G ((2 <= p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91))))))
lola: processed formula: A (G (G (G (G ((2 <= p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91))))))
lola: processed formula length: 72
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 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 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (X ((p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= p189))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X ((p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= p189)))))
lola: processed formula: A (F (G (X ((p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 <= p189)))))
lola: processed formula length: 79
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 82 markings, 83 edges
lola: ========================================
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p33 <= p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p33 <= p90 + p89 + p88 + p87 + p86 + p85 + p84 + p91)
lola: processed formula length: 54
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-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 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (G ((p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p108))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (F (G ((p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p108))))))
lola: processed formula: A (F (X (F (G ((p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 <= p108))))))
lola: processed formula length: 75
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-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 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: 699494 markings, 2678767 edges, 139899 markings/sec, 0 secs
lola: 1351965 markings, 5342895 edges, 130494 markings/sec, 5 secs
lola: 1948039 markings, 7809642 edges, 119215 markings/sec, 10 secs
lola: 2491977 markings, 9987347 edges, 108788 markings/sec, 15 secs
lola: 3030399 markings, 12147947 edges, 107684 markings/sec, 20 secs
lola: 3598440 markings, 14429246 edges, 113608 markings/sec, 25 secs
lola: 4169592 markings, 16763075 edges, 114230 markings/sec, 30 secs
lola: 4704992 markings, 19030713 edges, 107080 markings/sec, 35 secs
lola: 5242163 markings, 21361965 edges, 107434 markings/sec, 40 secs
lola: 5735404 markings, 23596891 edges, 98648 markings/sec, 45 secs
lola: 6223114 markings, 25816769 edges, 97542 markings/sec, 50 secs
lola: 6739915 markings, 27985588 edges, 103360 markings/sec, 55 secs
lola: 7226905 markings, 30092020 edges, 97398 markings/sec, 60 secs
lola: 7664882 markings, 32178659 edges, 87595 markings/sec, 65 secs
lola: 8140237 markings, 34204117 edges, 95071 markings/sec, 70 secs
lola: 8654400 markings, 36347004 edges, 102833 markings/sec, 75 secs
lola: 9144245 markings, 38555499 edges, 97969 markings/sec, 80 secs
lola: 9626725 markings, 40636904 edges, 96496 markings/sec, 85 secs
lola: 10191792 markings, 42993342 edges, 113013 markings/sec, 90 secs
lola: 10725634 markings, 45374639 edges, 106768 markings/sec, 95 secs
lola: 11195156 markings, 47633932 edges, 93904 markings/sec, 100 secs
lola: 11796307 markings, 50020042 edges, 120230 markings/sec, 105 secs
lola: 12362487 markings, 52296984 edges, 113236 markings/sec, 110 secs
lola: 12865303 markings, 54370137 edges, 100563 markings/sec, 115 secs
lola: 13338794 markings, 56382841 edges, 94698 markings/sec, 120 secs
lola: 13784370 markings, 58346852 edges, 89115 markings/sec, 125 secs
lola: 14288772 markings, 60518345 edges, 100880 markings/sec, 130 secs
lola: 14802743 markings, 62789955 edges, 102794 markings/sec, 135 secs
lola: 15262575 markings, 64972100 edges, 91966 markings/sec, 140 secs
lola: 15763431 markings, 67115848 edges, 100171 markings/sec, 145 secs
lola: 16232038 markings, 69108947 edges, 93721 markings/sec, 150 secs
lola: 16674474 markings, 71124469 edges, 88487 markings/sec, 155 secs
lola: 17074487 markings, 73193555 edges, 80003 markings/sec, 160 secs
lola: 17557735 markings, 75347315 edges, 96650 markings/sec, 165 secs
lola: 18106661 markings, 77614582 edges, 109785 markings/sec, 170 secs
lola: 18611614 markings, 79720475 edges, 100991 markings/sec, 175 secs
lola: 19114606 markings, 81753605 edges, 100598 markings/sec, 180 secs
lola: 19596953 markings, 83743123 edges, 96469 markings/sec, 185 secs
lola: 20118045 markings, 85885265 edges, 104218 markings/sec, 190 secs
lola: 20579173 markings, 87958201 edges, 92226 markings/sec, 195 secs
lola: 21037833 markings, 89969524 edges, 91732 markings/sec, 200 secs
lola: 21514137 markings, 92037521 edges, 95261 markings/sec, 205 secs
lola: 21960856 markings, 94026719 edges, 89344 markings/sec, 210 secs
lola: 22390825 markings, 96011847 edges, 85994 markings/sec, 215 secs
lola: 22897602 markings, 97995291 edges, 101355 markings/sec, 220 secs
lola: 23494806 markings, 100318886 edges, 119441 markings/sec, 225 secs
lola: 24064797 markings, 102590798 edges, 113998 markings/sec, 230 secs
lola: 24659424 markings, 105111089 edges, 118925 markings/sec, 235 secs
lola: 25269716 markings, 107746668 edges, 122058 markings/sec, 240 secs
lola: 25830836 markings, 110184733 edges, 112224 markings/sec, 245 secs
lola: 26343320 markings, 112418988 edges, 102497 markings/sec, 250 secs
lola: 26846233 markings, 114473706 edges, 100583 markings/sec, 255 secs
lola: 27349307 markings, 116641324 edges, 100615 markings/sec, 260 secs
lola: 27855612 markings, 118861971 edges, 101261 markings/sec, 265 secs
lola: 28433976 markings, 121208452 edges, 115673 markings/sec, 270 secs
lola: 28991091 markings, 123365027 edges, 111423 markings/sec, 275 secs
lola: 29480334 markings, 125545954 edges, 97849 markings/sec, 280 secs
lola: 29994522 markings, 127663668 edges, 102838 markings/sec, 285 secs
lola: 30554811 markings, 130125800 edges, 112058 markings/sec, 290 secs
lola: 31132274 markings, 132507956 edges, 115493 markings/sec, 295 secs
lola: 31628954 markings, 134899054 edges, 99336 markings/sec, 300 secs
lola: 32120338 markings, 137236754 edges, 98277 markings/sec, 305 secs
lola: 32616867 markings, 139604704 edges, 99306 markings/sec, 310 secs
lola: 33102960 markings, 141883110 edges, 97219 markings/sec, 315 secs
lola: 33588772 markings, 144237831 edges, 97162 markings/sec, 320 secs
lola: 34048840 markings, 146459247 edges, 92014 markings/sec, 325 secs
lola: 34551385 markings, 148572626 edges, 100509 markings/sec, 330 secs
lola: 35001027 markings, 150651801 edges, 89928 markings/sec, 335 secs
lola: 35441539 markings, 152621597 edges, 88102 markings/sec, 340 secs
lola: 35891244 markings, 154706338 edges, 89941 markings/sec, 345 secs
lola: 36320616 markings, 156866676 edges, 85874 markings/sec, 350 secs
lola: 36804214 markings, 158984014 edges, 96720 markings/sec, 355 secs
lola: 37322712 markings, 161190826 edges, 103700 markings/sec, 360 secs
lola: 37841877 markings, 163446219 edges, 103833 markings/sec, 365 secs
lola: 38318545 markings, 165649371 edges, 95334 markings/sec, 370 secs
lola: 38767161 markings, 167806834 edges, 89723 markings/sec, 375 secs
lola: 39232191 markings, 169872649 edges, 93006 markings/sec, 380 secs
lola: 39661549 markings, 171821634 edges, 85872 markings/sec, 385 secs
lola: 40153933 markings, 173920742 edges, 98477 markings/sec, 390 secs
lola: 40649121 markings, 176072690 edges, 99038 markings/sec, 395 secs
lola: 41110952 markings, 178261821 edges, 92366 markings/sec, 400 secs
lola: 41551398 markings, 180255323 edges, 88089 markings/sec, 405 secs
lola: 41983725 markings, 182377464 edges, 86465 markings/sec, 410 secs
lola: 42382736 markings, 184427658 edges, 79802 markings/sec, 415 secs
lola: 42900520 markings, 186540747 edges, 103557 markings/sec, 420 secs
lola: 43457074 markings, 188731460 edges, 111311 markings/sec, 425 secs
lola: 43985067 markings, 191037613 edges, 105599 markings/sec, 430 secs
lola: 44503629 markings, 193279299 edges, 103712 markings/sec, 435 secs
lola: 45012167 markings, 195513072 edges, 101708 markings/sec, 440 secs
lola: 45521285 markings, 197734089 edges, 101824 markings/sec, 445 secs
lola: 46011102 markings, 199928402 edges, 97963 markings/sec, 450 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((3 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)))
lola: processed formula: A (X ((3 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207)))
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-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: 81 markings, 81 edges
lola: ========================================
lola: subprocess 11 will run for 551 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57) U (3 <= p189)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (((p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57) U (3 <= p189)))))
lola: processed formula: A (G (F (((p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57) U (3 <= p189)))))
lola: processed formula length: 132
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 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 12 will run for 689 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p108 <= p66))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p108 <= p66)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-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 13 will run for 919 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107))) U ((p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 <= p136) U (1 <= p198))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107)) U ((p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 <= p136) U (1 <= p198))))
lola: processed formula: A ((F ((1 <= p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107)) U ((p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 <= p136) U (1 <= p198))))
lola: processed formula length: 152
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-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 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: 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 14 will run for 1379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (X (F ((p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (X (F ((p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134))))))
lola: processed formula: A (G (G (X (F ((p73 + p72 + p71 + p70 + p69 + p67 + p68 + p74 <= p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134))))))
lola: processed formula length: 124
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: 1014119 markings, 1487557 edges, 202824 markings/sec, 0 secs
lola: 1886017 markings, 2763241 edges, 174380 markings/sec, 5 secs
lola: 2699978 markings, 3973347 edges, 162792 markings/sec, 10 secs
lola: 3480497 markings, 5162472 edges, 156104 markings/sec, 15 secs
lola: 4283604 markings, 6389277 edges, 160621 markings/sec, 20 secs
lola: 5120920 markings, 7737886 edges, 167463 markings/sec, 25 secs
lola: 6159423 markings, 9134937 edges, 207701 markings/sec, 30 secs
lola: 7166099 markings, 10424679 edges, 201335 markings/sec, 35 secs
lola: 8158561 markings, 11689171 edges, 198492 markings/sec, 40 secs
lola: 9177430 markings, 12996153 edges, 203774 markings/sec, 45 secs
lola: 10153674 markings, 14237363 edges, 195249 markings/sec, 50 secs
lola: 11195652 markings, 15574447 edges, 208396 markings/sec, 55 secs
lola: 12205034 markings, 16866733 edges, 201876 markings/sec, 60 secs
lola: 13181631 markings, 18116269 edges, 195319 markings/sec, 65 secs
lola: 14137634 markings, 19334151 edges, 191201 markings/sec, 70 secs
lola: 15080079 markings, 20492971 edges, 188489 markings/sec, 75 secs
lola: 16026468 markings, 21652642 edges, 189278 markings/sec, 80 secs
lola: 17106362 markings, 23033575 edges, 215979 markings/sec, 85 secs
lola: 18153645 markings, 24373498 edges, 209457 markings/sec, 90 secs
lola: 19148375 markings, 25644900 edges, 198946 markings/sec, 95 secs
lola: 20142652 markings, 26922929 edges, 198855 markings/sec, 100 secs
lola: 21096324 markings, 28143925 edges, 190734 markings/sec, 105 secs
lola: 22060935 markings, 29376942 edges, 192922 markings/sec, 110 secs
lola: 23077162 markings, 30677868 edges, 203245 markings/sec, 115 secs
lola: 24075269 markings, 31960098 edges, 199621 markings/sec, 120 secs
lola: 24991845 markings, 33131907 edges, 183315 markings/sec, 125 secs
lola: 25963460 markings, 34376570 edges, 194323 markings/sec, 130 secs
lola: 26868622 markings, 35508443 edges, 181032 markings/sec, 135 secs
lola: 27779654 markings, 36639915 edges, 182206 markings/sec, 140 secs
lola: 28735670 markings, 37832724 edges, 191203 markings/sec, 145 secs
lola: 29762375 markings, 39126558 edges, 205341 markings/sec, 150 secs
lola: 30745120 markings, 40354986 edges, 196549 markings/sec, 155 secs
lola: 31671734 markings, 41472213 edges, 185323 markings/sec, 160 secs
lola: 32557331 markings, 42600734 edges, 177119 markings/sec, 165 secs
lola: 33473530 markings, 43750845 edges, 183240 markings/sec, 170 secs
lola: 34439211 markings, 44902738 edges, 193136 markings/sec, 175 secs
lola: 35456329 markings, 46208982 edges, 203424 markings/sec, 180 secs
lola: 36461025 markings, 47496583 edges, 200939 markings/sec, 185 secs
lola: 37434014 markings, 48739875 edges, 194598 markings/sec, 190 secs
lola: 38387589 markings, 49957899 edges, 190715 markings/sec, 195 secs
lola: 39413642 markings, 51269124 edges, 205211 markings/sec, 200 secs
lola: 40450630 markings, 52600051 edges, 207398 markings/sec, 205 secs
lola: 41423563 markings, 53836655 edges, 194587 markings/sec, 210 secs
lola: 41530382 markings, 53972790 edges, 21364 markings/sec, 215 secs
lola: 41535765 markings, 53979625 edges, 1077 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57) U (3 <= p148)) U F ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57) U (3 <= p148)) U F ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180))))
lola: processed formula: A ((((1 <= p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57) U (3 <= p148)) U F ((p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180))))
lola: processed formula length: 193
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-05-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: lola: RESULT
========================================
lola:
SUMMARY: yes no yes no no unknown no no yes unknown no no yes yes unknown yes
FORMULA PermAdmissibility-COL-05-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-05-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-COL-05"
export BK_EXAMINATION="LTLCardinality"
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 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 r259-csrt-152732584700127"
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 ;