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 18K 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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K 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 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K 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.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-csrt-152666472700458
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527141517268


BK_STOP 1527141690407

--------------------
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-20 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': 1679100, 'Memory': 15949.55, 'Tool': 'lola'}, {'Time': 1731033, 'Memory': 15946.95, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PermAdmissibility-COL-20...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PermAdmissibility-COL-20: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-20: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PermAdmissibility-COL-20 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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-20-CTLCardinality.task
lola: NOT(E (F (E (G ((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 <= p116)))))) : E (G ((E (F ((p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 <= p100 + p101 + p102 + p103 + p104 + p97 + p98 + p99))) OR TRUE))) : E (X ((A (G ((p114 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191))) OR (p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166)))) : (A (G (((p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= 0) OR (p115 <= 0)))) OR ((E (X ((p26 <= p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140))) AND (3 <= p105)) AND ((p36 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) AND (p87 <= p70)))) : (((((p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61) AND (p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 <= p37) AND (p70 <= p16)) AND E (X ((p27 <= p175)))) OR (((p158 <= p26) OR (1 <= p141)) AND (p96 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166))) AND (E (G (((3 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157) OR (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53)))) AND NOT(E (G ((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p85 + p84 + p83 + p82 + p81 + p80 + p79 + p86)))))) : A (F (NOT(E (F ((3 <= p141)))))) : A (G ((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 <= p36))) : A (X (A (((p26 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61) U (1 <= p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45))))) : (E (F ((1 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157))) AND A (F ((((p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 <= p96) OR (p87 <= p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132)) AND (p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24))))) : NOT(E (X (A (F ((2 <= p114)))))) : E (((p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 <= p62 + p63 + p64 + p65 + p66 + p67 + p68 + p69) U E (F ((3 <= p36))))) : E (G ((E (F ((3 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24))) OR (2 <= p37)))) : A (X (NOT(A (F ((1 <= p16)))))) : E (F (((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + 1 <= p175) AND (p36 + 1 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191) AND (1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7)))) : E (((p16 <= 1) U E (F ((3 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61))))) : E (G (E (X ((p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 <= p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (E (G ((p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 <= p116))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (p116 + 1 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24)))))
lola: processed formula length: 89
lola: 7 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 321 markings, 360 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 <= p100 + p101 + p102 + p103 + p104 + p97 + p98 + p99))) OR TRUE)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 4 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: processed formula with 0 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((A (G ((p114 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191))) OR (p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((p114 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + 1 <= p114))))
lola: processed formula length: 86
lola: 4 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 131 markings, 133 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166))
lola: processed formula length: 116
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: lola: SUBRESULT========================================

lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= 0) OR (p115 <= 0)))) OR ((E (X ((p26 <= p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140))) AND (3 <= p105)) AND ((p36 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) AND (p87 <= p70))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 <= 0) OR (p115 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
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 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 24 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((p26 <= p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((p26 <= p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140))
lola: processed formula length: 66
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p105) AND ((p36 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) AND (p87 <= p70)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p105) AND ((p36 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15) AND (p87 <= p70)))
lola: processed formula length: 89
lola: 2 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: processed formula with 3 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61) AND (p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 <= p37) AND (p70 <= p16)) AND E (X ((p27 <= p175)))) OR (((p158 <= p26) OR (1 <= p141)) AND (p96 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166))) AND (E (G (((3 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61) AND (p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 <= p37) AND (p70 <= p16))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 <= p54 + p55 + p56 + p57 + p58 + p59 + p60 + p61) AND (p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 <= p37) AND (p70 <= p16))
lola: processed formula length: 190
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: processed formula with 3 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p158 <= p26) OR (1 <= p141)) AND (p96 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p158 <= p26) OR (1 <= p141)) AND (p96 <= p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166))
lola: processed formula length: 100
lola: 3 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-CTLCardinality.task
lola: processed formula with 3 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((3 <= p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157) OR (p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 <= p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 <= 2) AND (p46 + p47 + p48 + p49 + p50 + p51 + p52 + p53 + 1 <= p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207))))
lola: processed formula length: 190
lola: 5 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-20-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: 1599349 markings, 1935606 edges, 3225752436249460736 markings/sec, 0 secs
lola: 3184577 markings, 3875952 edges, 317046 markings/sec, 5 secs
lola: 4696241 markings, 5756477 edges, 302333 markings/sec, 10 secs
lola: 6141835 markings, 7619215 edges, 289119 markings/sec, 15 secs
lola: 7570027 markings, 9417692 edges, 285638 markings/sec, 20 secs
lola: 9019322 markings, 11338412 edges, 289859 markings/sec, 25 secs
lola: 10457103 markings, 13334971 edges, 287556 markings/sec, 30 secs
lola: 11970936 markings, 15226598 edges, 302767 markings/sec, 35 secs
lola: 13389935 markings, 17061998 edges, 283800 markings/sec, 40 secs
lola: 14836934 markings, 18831970 edges, 289400 markings/sec, 45 secs
lola: 16225764 markings, 20584404 edges, 277766 markings/sec, 50 secs
lola: 17632415 markings, 22397205 edges, 281330 markings/sec, 55 secs
lola: 18995774 markings, 24217996 edges, 272672 markings/sec, 60 secs
lola: 20373247 markings, 26088748 edges, 275495 markings/sec, 65 secs
lola: 21766232 markings, 27847289 edges, 278597 markings/sec, 70 secs
lola: 23174938 markings, 29654789 edges, 281741 markings/sec, 75 secs
lola: 24564358 markings, 31466102 edges, 277884 markings/sec, 80 secs
lola: 25921291 markings, 33315330 edges, 271387 markings/sec, 85 secs
lola: 27308774 markings, 35169497 edges, 277497 markings/sec, 90 secs
lola: 28705587 markings, 37075730 edges, 279363 markings/sec, 95 secs
lola: 30147422 markings, 39085677 edges, 288367 markings/sec, 100 secs
lola: 31637153 markings, 40933600 edges, 297946 markings/sec, 105 secs
lola: 33105923 markings, 42788724 edges, 293754 markings/sec, 110 secs
lola: 34467166 markings, 44577677 edges, 272249 markings/sec, 115 secs
lola: 35942867 markings, 46440228 edges, 295140 markings/sec, 120 secs
lola: 37342052 markings, 48245631 edges, 279837 markings/sec, 125 secs
lola: 38744989 markings, 50094472 edges, 280587 markings/sec, 130 secs
lola: 40084648 markings, 51866487 edges, 267932 markings/sec, 135 secs
lola: 41385136 markings, 53648224 edges, 260098 markings/sec, 140 secs
lola: 42646588 markings, 55453626 edges, 252290 markings/sec, 145 secs
lola: 43002184 markings, 55920490 edges, 71119 markings/sec, 150 secs
lola: 43004909 markings, 55924361 edges, 545 markings/sec, 155 secs
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: '\ufffd'
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-20-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-20-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 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-20"
export BK_EXAMINATION="CTLCardinality"
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-20.tgz
mv PermAdmissibility-COL-20 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-20, 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 r114-csrt-152666472700458"
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 ;