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 212K
-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.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.2K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 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 irma4mcc-structural
Input is PermAdmissibility-COL-50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-csrt-152666474100465
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527153743203


BK_STOP 1527154432013

--------------------
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': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1722293, 'Memory': 15950.7, 'Tool': 'lola'}, {'Time': 2107935, 'Memory': 15950.71, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLCardinality 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 CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ PermAdmissibility-COL-50 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 208 places, 1024 transitions, 177 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1460 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-50-CTLCardinality.task
lola: (((p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68) AND E (G ((p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85 + 1 <= p146)))) OR E (F (((2 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68) AND (2 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59) AND (3 <= p155))))) : (E (((p121 <= 1) U (p0 + 1 <= p156))) AND E (F (E (F ((p96 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25)))))) : E (((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 <= 1) U (p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + 1 <= p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165))) : (NOT(A (F (((p87 <= p86) AND (p157 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34))))) OR E (F (A (X ((1 <= p60)))))) : A (F ((A (F ((1 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34))) AND ((p77 <= 1) AND (p146 <= 2))))) : (E (((p146 <= p121) U ((p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 <= p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) AND (3 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95)))) AND A ((((3 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112) AND (1 <= p0)) U ((3 <= p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) OR (3 <= p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50))))) : (NOT((E (G ((p77 <= p0))) AND (p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59))) OR NOT(((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154) OR A (G ((1 <= p100 + p101 + p102 + p103 + p104 + p97 + p98 + p99)))))) : A (F (A (G ((p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + 1 <= p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198))))) : NOT(A (F ((p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + 1 <= p0)))) : NOT(A (F ((((2 <= p155) OR (p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 <= p35 + p36 + p37 + p38 + p39 + p40 + p41 + p42)) AND ((p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= p96) OR (2 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))))) : A (F (A (((p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85 <= p51) U (2 <= p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173))))) : A (X (A (F (((3 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154) AND (p199 <= p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))))) : A ((((2 <= p60) OR ((p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95) AND (p86 <= p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120))) U E (F ((2 <= p199))))) : E (G (A (F (((1 <= p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) OR (p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 <= p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137)))))) : E ((((p155 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112) AND (3 <= p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181) AND (p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 <= p51)) U A (G ((1 <= p96))))) : E (G (E (G ((p146 <= 0)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68) AND E (G ((p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85 + 1 <= p146)))) OR E (F (((2 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68) AND (2 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59) AND (3 <= p155)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68)
lola: processed formula length: 104
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85 + 1 <= p146)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p146 <= p84 + p83 + p82 + p81 + p80 + p79 + p78 + p85)))
lola: processed formula length: 70
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68) AND (2 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59) AND (3 <= p155))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 46 markings, 45 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((p121 <= 1) U (p0 + 1 <= p156))) AND E (F (E (F ((p96 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p121 <= 1) U (p0 + 1 <= p156)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p121 <= 1) U (p0 + 1 <= p156))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 56 markings, 55 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p96 <= p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 <= 1) U (p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + 1 <= p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 <= 1) U (p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + 1 <= p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165))
lola: processed formula length: 182
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1622641 markings, 1956833 edges, 2976872481744224256 markings/sec, 0 secs
lola: 3190450 markings, 3870257 edges, 313562 markings/sec, 5 secs
lola: 4888011 markings, 5935228 edges, 339512 markings/sec, 10 secs
lola: 6520492 markings, 7992464 edges, 326496 markings/sec, 15 secs
lola: 8088560 markings, 10041958 edges, 313614 markings/sec, 20 secs
lola: 9678606 markings, 11963584 edges, 318009 markings/sec, 25 secs
lola: 11329602 markings, 14058519 edges, 330199 markings/sec, 30 secs
lola: 12996311 markings, 16167566 edges, 333342 markings/sec, 35 secs
lola: 14659581 markings, 18228620 edges, 332654 markings/sec, 40 secs
lola: 16208331 markings, 20137632 edges, 309750 markings/sec, 45 secs
lola: 17653498 markings, 21977821 edges, 289033 markings/sec, 50 secs
lola: 19100110 markings, 23904508 edges, 289322 markings/sec, 55 secs
lola: 20566496 markings, 25749180 edges, 293277 markings/sec, 60 secs
lola: 21943149 markings, 27680451 edges, 275331 markings/sec, 65 secs
lola: 23329938 markings, 29518786 edges, 277358 markings/sec, 70 secs
lola: 24755308 markings, 31336104 edges, 285074 markings/sec, 75 secs
lola: 26251246 markings, 33128830 edges, 299188 markings/sec, 80 secs
lola: 27667986 markings, 35001151 edges, 283348 markings/sec, 85 secs
lola: 29190572 markings, 37080655 edges, 304517 markings/sec, 90 secs
lola: 30835912 markings, 39151038 edges, 329068 markings/sec, 95 secs
lola: 32408832 markings, 41110432 edges, 314584 markings/sec, 100 secs
lola: 33893139 markings, 43150319 edges, 296861 markings/sec, 105 secs
lola: 35276537 markings, 45043794 edges, 276680 markings/sec, 110 secs
lola: 36703787 markings, 46923509 edges, 285450 markings/sec, 115 secs
lola: 38032831 markings, 48752913 edges, 265809 markings/sec, 120 secs
lola: 39537506 markings, 50552944 edges, 300935 markings/sec, 125 secs
lola: 40826048 markings, 52436144 edges, 257708 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 261 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (F (((p87 <= p86) AND (p157 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34))))) OR E (F (A (X ((1 <= p60))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 261 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p86 + 1 <= p87) OR (p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + 1 <= p157))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p87 <= p86) AND (p157 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34))))
lola: processed formula length: 89
lola: 5 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((1 <= p60)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((1 <= p60)))
lola: processed formula length: 24
lola: 5 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 801 markings, 800 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F ((1 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34))) AND ((p77 <= 1) AND (p146 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A(TRUE U (1 <= p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34)) AND ((p77 <= 1) AND (p146 <= 2))))
lola: processed formula length: 107
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1314809 markings, 2197886 edges, 3225752436249460736 markings/sec, 0 secs
lola: 2578838 markings, 4340001 edges, 252806 markings/sec, 5 secs
lola: 3720716 markings, 6482126 edges, 228376 markings/sec, 10 secs
lola: 4989686 markings, 8621847 edges, 253794 markings/sec, 15 secs
lola: 6148866 markings, 10796883 edges, 231836 markings/sec, 20 secs
lola: 7431695 markings, 12955854 edges, 256566 markings/sec, 25 secs
lola: 8577659 markings, 15113695 edges, 229193 markings/sec, 30 secs
lola: 9765394 markings, 17333645 edges, 237547 markings/sec, 35 secs
lola: 10697574 markings, 19392043 edges, 186436 markings/sec, 40 secs
lola: 11775154 markings, 21483063 edges, 215516 markings/sec, 45 secs
lola: 12907662 markings, 23665139 edges, 226502 markings/sec, 50 secs
lola: 13987871 markings, 25616020 edges, 216042 markings/sec, 55 secs
lola: 15043594 markings, 27590682 edges, 211145 markings/sec, 60 secs
lola: 16012319 markings, 29606653 edges, 193745 markings/sec, 65 secs
lola: 17200180 markings, 31811020 edges, 237572 markings/sec, 70 secs
lola: 18383175 markings, 33948181 edges, 236599 markings/sec, 75 secs
lola: 19574010 markings, 36041549 edges, 238167 markings/sec, 80 secs
lola: 20792391 markings, 38237693 edges, 243676 markings/sec, 85 secs
lola: 21938566 markings, 40345410 edges, 229235 markings/sec, 90 secs
lola: 22905230 markings, 42371873 edges, 193333 markings/sec, 95 secs
lola: 23859765 markings, 44429173 edges, 190907 markings/sec, 100 secs
lola: 24940093 markings, 46442607 edges, 216066 markings/sec, 105 secs
lola: 26045451 markings, 48505419 edges, 221072 markings/sec, 110 secs
lola: 26956423 markings, 50480255 edges, 182194 markings/sec, 115 secs
lola: 27978680 markings, 52554135 edges, 204451 markings/sec, 120 secs
lola: 28989878 markings, 54646872 edges, 202240 markings/sec, 125 secs
lola: 30030341 markings, 56568666 edges, 208093 markings/sec, 130 secs
lola: 30953522 markings, 58476268 edges, 184636 markings/sec, 135 secs
lola: 31888813 markings, 60404743 edges, 187058 markings/sec, 140 secs
lola: 32822783 markings, 62418604 edges, 186794 markings/sec, 145 secs
lola: 34038818 markings, 64498537 edges, 243207 markings/sec, 150 secs
lola: 35107033 markings, 66461709 edges, 213643 markings/sec, 155 secs
lola: 36159861 markings, 68424385 edges, 210566 markings/sec, 160 secs
lola: 37364260 markings, 70508326 edges, 240880 markings/sec, 165 secs
lola: 38539491 markings, 72650196 edges, 235046 markings/sec, 170 secs
lola: 39692822 markings, 74800784 edges, 230666 markings/sec, 175 secs
lola: 40647769 markings, 76883426 edges, 190989 markings/sec, 180 secs
lola: 41667545 markings, 78934085 edges, 203955 markings/sec, 185 secs
lola: 42734498 markings, 81025246 edges, 213391 markings/sec, 190 secs
lola: 43571421 markings, 82927430 edges, 167385 markings/sec, 195 secs
lola: 44621697 markings, 84922921 edges, 210055 markings/sec, 200 secs
lola: 45575858 markings, 86866936 edges, 190832 markings/sec, 205 secs
lola: 46568612 markings, 88727491 edges, 198551 markings/sec, 210 secs
lola: 47470644 markings, 90583402 edges, 180406 markings/sec, 215 secs
lola: 48410926 markings, 92521373 edges, 188056 markings/sec, 220 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 288 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((p146 <= p121) U ((p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 <= p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) AND (3 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95)))) AND A ((((3 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112) AND (1 <= p0)) U ((3 <= p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) OR (3 <= p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 288 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p146 <= p121) U ((p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 <= p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) AND (3 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p146 <= p121) U ((p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 <= p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) AND (3 <= p89 + p88 + p90 + p91 + p92 + p93 + p94 + p95)))
lola: processed formula length: 183
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 708 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 28017 markings, 28024 edges
lola: ========================================
lola: subprocess 6 will run for 317 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112) AND (1 <= p0)) U ((3 <= p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) OR (3 <= p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((3 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112) AND (1 <= p0)) U ((3 <= p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) OR (3 <= p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50))))
lola: processed formula: A ((((3 <= p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112) AND (1 <= p0)) U ((3 <= p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129) OR (3 <= p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50))))
lola: processed formula length: 204
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 317 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((E (G ((p77 <= p0))) AND (p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59))) OR NOT(((p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 <= p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154) OR A (G ((1 <= p100 + p101 + p102 + p103 + p104 + p97 + p98 + p99))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 317 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p0 + 1 <= p77)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p0 + 1 <= p77)))
lola: processed formula: A (F ((p0 + 1 <= p77)))
lola: processed formula length: 23
lola: 11 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-50-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 47946 markings, 125527 edges, 9589 markings/sec, 0 secs
lola: 85760 markings, 244582 edges, 7563 markings/sec, 5 secs
lola: 125531 markings, 368994 edges, 7954 markings/sec, 10 secs
lola: 167368 markings, 491926 edges, 8367 markings/sec, 15 secs
lola: 204142 markings, 610493 edges, 7355 markings/sec, 20 secs
lola: 238893 markings, 730355 edges, 6950 markings/sec, 25 secs
lola: 272590 markings, 851458 edges, 6739 markings/sec, 30 secs
lola: 312944 markings, 978055 edges, 8071 markings/sec, 35 secs
lola: 350897 markings, 1104534 edges, 7591 markings/sec, 40 secs
lola: 385548 markings, 1228625 edges, 6930 markings/sec, 45 secs
lola: 426364 markings, 1358539 edges, 8163 markings/sec, 50 secs
lola: 467930 markings, 1493668 edges, 8313 markings/sec, 55 secs
lola: 510349 markings, 1626159 edges, 8484 markings/sec, 60 secs
lola: 548765 markings, 1755303 edges, 7683 markings/sec, 65 secs
lola: 584619 markings, 1883861 edges, 7171 markings/sec, 70 secs
lola: 620182 markings, 2016005 edges, 7113 markings/sec, 75 secs
lola: 656740 markings, 2144981 edges, 7312 markings/sec, 80 secs
lola: 691295 markings, 2272488 edges, 6911 markings/sec, 85 secs
lola: 724217 markings, 2395701 edges, 6584 markings/sec, 90 secs
lola: 757841 markings, 2520510 edges, 6725 markings/sec, 95 secs
lola: 790915 markings, 2637797 edges, 6615 markings/sec, 100 secs
lola: 828945 markings, 2761265 edges, 7606 markings/sec, 105 secs
lola: 867232 markings, 2889516 edges, 7657 markings/sec, 110 secs
lola: 902949 markings, 3016301 edges, 7143 markings/sec, 115 secs
lola: 940409 markings, 3143526 edges, 7492 markings/sec, 120 secs
lola: 973232 markings, 3269239 edges, 6565 markings/sec, 125 secs
lola: 1005685 markings, 3396646 edges, 6491 markings/sec, 130 secs
lola: 1046288 markings, 3527508 edges, 8121 markings/sec, 135 secs
lola: 1084568 markings, 3657400 edges, 7656 markings/sec, 140 secs
lola: 1120406 markings, 3784160 edges, 7168 markings/sec, 145 secs
lola: 1155690 markings, 3912914 edges, 7057 markings/sec, 150 secs
lola: 1196068 markings, 4050899 edges, 8076 markings/sec, 155 secs
lola: 1237021 markings, 4176742 edges, 8191 markings/sec, 160 secs
lola: 1277116 markings, 4305650 edges, 8019 markings/sec, 165 secs
lola: 1312282 markings, 4429573 edges, 7033 markings/sec, 170 secs
lola: 1348356 markings, 4553275 edges, 7215 markings/sec, 175 secs
lola: 1380677 markings, 4669585 edges, 6464 markings/sec, 180 secs
lola: 1412495 markings, 4788503 edges, 6364 markings/sec, 185 secs
lola: 1443339 markings, 4907587 edges, 6169 markings/sec, 190 secs
lola: 1475359 markings, 5023760 edges, 6404 markings/sec, 195 secs
lola: 1508120 markings, 5148294 edges, 6552 markings/sec, 200 secs
lola: 1541759 markings, 5274586 edges, 6728 markings/sec, 205 secs
lola: 1572994 markings, 5396361 edges, 6247 markings/sec, 210 secs
lola: 1605784 markings, 5525079 edges, 6558 markings/sec, 215 secs
lola: 1639533 markings, 5647393 edges, 6750 markings/sec, 220 secs
lola: 1674632 markings, 5775042 edges, 7020 markings/sec, 225 secs
lola: 1708754 markings, 5902160 edges, 6824 markings/sec, 230 secs
lola: 1740099 markings, 6029808 edges, 6269 markings/sec, 235 secs
lola: 1775312 markings, 6156056 edges, 7043 markings/sec, 240 secs
lola: 1806721 markings, 6283615 edges, 6282 markings/sec, 245 secs
lola: 1839615 markings, 6406373 edges, 6579 markings/sec, 250 secs
lola: 1871104 markings, 6530793 edges, 6298 markings/sec, 255 secs
lola: 1901756 markings, 6650730 edges, 6130 markings/sec, 260 secs
lola: 1936711 markings, 6772206 edges, 6991 markings/sec, 265 secs
lola: 1969151 markings, 6896319 edges, 6488 markings/sec, 270 secs
lola: 2007547 markings, 7020327 edges, 7679 markings/sec, 275 secs
lola: 2045361 markings, 7148208 edges, 7563 markings/sec, 280 secs
lola: 2081588 markings, 7275461 edges, 7245 markings/sec, 285 secs
lola: 2119365 markings, 7408048 edges, 7555 markings/sec, 290 secs
lola: 2154566 markings, 7542958 edges, 7040 markings/sec, 295 secs
lola: 2190338 markings, 7678673 edges, 7154 markings/sec, 300 secs
lola: 2229044 markings, 7815949 edges, 7741 markings/sec, 305 secs
lola: 2266050 markings, 7941417 edges, 7401 markings/sec, 310 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: ''
Aborted (core dumped)
FORMULA PermAdmissibility-COL-50-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-50-CTLCardinality-15 CANNOT_COMPUTE 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-50"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-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 irma4mcc-structural"
echo " Input is PermAdmissibility-COL-50, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r115-csrt-152666474100465"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;