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 220K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 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.1K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.8K 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 3.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 54K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PermAdmissibility-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-csrt-152732584000125
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527457025222


BK_STOP 1527457409452

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PermAdmissibility-COL-02 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': 728600, 'Memory': 15925.49, 'Tool': 'lola'}, {'Time': 766351, 'Memory': 15930.29, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
LTLCardinality lola PermAdmissibility-COL-02...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PermAdmissibility-COL-02: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-02: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ PermAdmissibility-COL-02 @ 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-02-LTLCardinality.task
lola: A (G (X (X ((3 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95))))) : A (F (G (((1 <= p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170) U (1 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))))) : A ((F (F ((2 <= p179))) U G ((p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206)))) : A ((p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112)) : A ((G (G ((p100 + p101 + p102 + p103 + p104 + p97 + p98 + p99 <= p190))) U G (F ((2 <= p54))))) : A (X (F ((2 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95)))) : A (((2 <= p52) U X ((p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178)))) : A ((X (G ((1 <= p96))) U F (X ((1 <= p1))))) : A (F (G (F (X ((2 <= p189)))))) : A (F (X (((p145 <= p52) U (p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 <= p52))))) : A ((2 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206)) : A (G (X (G ((3 <= p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51))))) : A ((p42 <= p207)) : A ((X (F ((p42 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112))) U (p207 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153))) : A ((p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 <= p42)) : A (G (F (X (F ((3 <= p190))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (X ((3 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (X ((3 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95)))))
lola: processed formula: A (G (X (X ((3 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95)))))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (((1 <= p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170) U (1 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (((1 <= p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170) U (1 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))
lola: processed formula: A (F (G (((1 <= p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170) U (1 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))))
lola: processed formula length: 121
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 34 markings, 35 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((2 <= p179))) U G ((p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71 <= 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 ((F ((2 <= p179)) U G ((p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206))))
lola: processed formula: A ((F ((2 <= p179)) U G ((p70 + p69 + p64 + p65 + p66 + p67 + p68 + p71 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206))))
lola: processed formula length: 132
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: 37 markings, 37 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112)
lola: processed formula length: 104
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((p100 + p101 + p102 + p103 + p104 + p97 + p98 + p99 <= p190))) U G (F ((2 <= p54)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((p100 + p101 + p102 + p103 + p104 + p97 + p98 + p99 <= p190))) U G (F ((2 <= p54)))))
lola: processed formula: A ((G (G ((p100 + p101 + p102 + p103 + p104 + p97 + p98 + p99 <= p190))) U G (F ((2 <= p54)))))
lola: processed formula length: 95
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((2 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95))))
lola: processed formula: A (X (F ((2 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: 1005709 markings, 1303869 edges, 201142 markings/sec, 0 secs
lola: 1947693 markings, 2568283 edges, 188397 markings/sec, 5 secs
lola: 2911817 markings, 3876925 edges, 192825 markings/sec, 10 secs
lola: 3822715 markings, 5154972 edges, 182180 markings/sec, 15 secs
lola: 4722391 markings, 6405940 edges, 179935 markings/sec, 20 secs
lola: 5683241 markings, 7674364 edges, 192170 markings/sec, 25 secs
lola: 6613176 markings, 8979475 edges, 185987 markings/sec, 30 secs
lola: 7512881 markings, 10270503 edges, 179941 markings/sec, 35 secs
lola: 8363323 markings, 11438740 edges, 170088 markings/sec, 40 secs
lola: 9244126 markings, 12715946 edges, 176161 markings/sec, 45 secs
lola: 10150570 markings, 13912301 edges, 181289 markings/sec, 50 secs
lola: 11051401 markings, 15197578 edges, 180166 markings/sec, 55 secs
lola: 11939881 markings, 16488296 edges, 177696 markings/sec, 60 secs
lola: 12781220 markings, 17669359 edges, 168268 markings/sec, 65 secs
lola: 13631022 markings, 18926071 edges, 169960 markings/sec, 70 secs
lola: 14509012 markings, 20133403 edges, 175598 markings/sec, 75 secs
lola: 15362727 markings, 21371140 edges, 170743 markings/sec, 80 secs
lola: 16262750 markings, 22638584 edges, 180005 markings/sec, 85 secs
lola: 17176096 markings, 23853139 edges, 182669 markings/sec, 90 secs
lola: 18092683 markings, 25059439 edges, 183317 markings/sec, 95 secs
lola: 18976016 markings, 26287865 edges, 176667 markings/sec, 100 secs
lola: 19843365 markings, 27520055 edges, 173470 markings/sec, 105 secs
lola: 20744347 markings, 28726147 edges, 180196 markings/sec, 110 secs
lola: 21598639 markings, 29950369 edges, 170858 markings/sec, 115 secs
lola: 22431506 markings, 31215690 edges, 166573 markings/sec, 120 secs
lola: 23323897 markings, 32423330 edges, 178478 markings/sec, 125 secs
lola: 24169815 markings, 33619933 edges, 169184 markings/sec, 130 secs
lola: 24974598 markings, 34822383 edges, 160957 markings/sec, 135 secs
lola: 25817200 markings, 36064011 edges, 168520 markings/sec, 140 secs
lola: 26669438 markings, 37304197 edges, 170448 markings/sec, 145 secs
lola: 27512605 markings, 38465719 edges, 168633 markings/sec, 150 secs
lola: 28388612 markings, 39651873 edges, 175201 markings/sec, 155 secs
lola: 29195481 markings, 40756876 edges, 161374 markings/sec, 160 secs
lola: 30025181 markings, 41921920 edges, 165940 markings/sec, 165 secs
lola: 30824412 markings, 43074475 edges, 159846 markings/sec, 170 secs
lola: 31642334 markings, 44313577 edges, 163584 markings/sec, 175 secs
lola: 32469385 markings, 45558990 edges, 165410 markings/sec, 180 secs
lola: 33301913 markings, 46790680 edges, 166506 markings/sec, 185 secs
lola: 34123504 markings, 47914987 edges, 164318 markings/sec, 190 secs
lola: 34941995 markings, 49075517 edges, 163698 markings/sec, 195 secs
lola: 35715114 markings, 50418715 edges, 154624 markings/sec, 200 secs
lola: 36594152 markings, 51623204 edges, 175808 markings/sec, 205 secs
lola: 37469467 markings, 52834337 edges, 175063 markings/sec, 210 secs
lola: 38403667 markings, 54123266 edges, 186840 markings/sec, 215 secs
lola: 39232368 markings, 55271152 edges, 165740 markings/sec, 220 secs
lola: 40065449 markings, 56463322 edges, 166616 markings/sec, 225 secs
lola: 40892652 markings, 57691694 edges, 165441 markings/sec, 230 secs
lola: 41682052 markings, 58792520 edges, 157880 markings/sec, 235 secs
lola: 42484006 markings, 59904821 edges, 160391 markings/sec, 240 secs
lola: 43265350 markings, 61076356 edges, 156269 markings/sec, 245 secs
lola: 44119236 markings, 62293202 edges, 170777 markings/sec, 250 secs
lola: 44932943 markings, 63476683 edges, 162741 markings/sec, 255 secs
lola: 45742150 markings, 64663803 edges, 161841 markings/sec, 260 secs
lola: 46560535 markings, 65935212 edges, 163677 markings/sec, 265 secs
lola: 47378661 markings, 67136416 edges, 163625 markings/sec, 270 secs
lola: 48154384 markings, 68301928 edges, 155145 markings/sec, 275 secs
lola: 48942763 markings, 69506084 edges, 157676 markings/sec, 280 secs
lola: 49675295 markings, 70532901 edges, 146506 markings/sec, 285 secs
lola: 49776092 markings, 70682681 edges, 20159 markings/sec, 290 secs
lola: 49779976 markings, 70688778 edges, 777 markings/sec, 295 secs
lola: 49783896 markings, 70694528 edges, 784 markings/sec, 300 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 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p52) U X ((p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= p52) U X ((p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178))))
lola: processed formula: A (((2 <= p52) U X ((p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 <= p171 + p172 + p173 + p174 + p175 + p176 + p177 + p178))))
lola: processed formula length: 135
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: 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 7 will run for 355 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((1 <= p96))) U F (X ((1 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (G ((1 <= p96))) U F (X ((1 <= p1)))))
lola: processed formula: A ((X (G ((1 <= p96))) U F (X ((1 <= p1)))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: 27041 markings, 37280 edges
lola: ========================================
lola: subprocess 8 will run for 400 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (F (X ((2 <= p189))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (X ((2 <= p189)))))
lola: processed formula: A (G (F (X ((2 <= p189)))))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: 39 markings, 39 edges
lola: ========================================
lola: subprocess 9 will run for 457 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((p145 <= p52) U (p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 <= p52)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (((p145 <= p52) U (p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 <= p52)))))
lola: processed formula: A (F (X (((p145 <= p52) U (p56 + p57 + p58 + p59 + p60 + p61 + p62 + p63 <= p52)))))
lola: processed formula length: 84
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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 10 will run for 533 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206)
lola: processed formula length: 60
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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 11 will run for 640 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (G ((3 <= p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (G ((3 <= p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51)))))
lola: processed formula: A (G (X (G ((3 <= p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51)))))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: 33 markings, 33 edges
lola: ========================================
lola: subprocess 12 will run for 800 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p42 <= p207))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p42 <= p207)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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 1067 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((p42 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112))) U (p207 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (F ((p42 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112))) U (p207 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153)))
lola: processed formula: A ((X (F ((p42 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112))) U (p207 <= p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153)))
lola: processed formula length: 142
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1601 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 <= p42))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 <= p42)
lola: processed formula length: 54
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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 15 will run for 3203 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (X (F ((3 <= p190))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (X (F ((3 <= p190))))))
lola: processed formula: A (G (F (X (F ((3 <= p190))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-02-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: 33 markings, 33 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no unknown yes yes no yes no no yes yes no no
FORMULA PermAdmissibility-COL-02-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

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-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-02.tgz
mv PermAdmissibility-COL-02 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is PermAdmissibility-COL-02, 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 r258-csrt-152732584000125"
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 ;