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 204K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.0K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 37K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is PermAdmissibility-COL-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-csrt-152732587500129
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527831048006


BK_STOP 1527831718182

--------------------
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-10 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': 1769493, 'Memory': 7934.23, 'Tool': 'lola'}, {'Time': 1770567, 'Memory': 11344.28, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PermAdmissibility-COL-10...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PermAdmissibility-COL-10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-COL-10: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ PermAdmissibility-COL-10 @ 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-10-LTLCardinality.task
lola: A ((1 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68)) : A (X ((p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 <= p149))) : A (X (G (X (F ((2 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60)))))) : A (X (((2 <= p18) U G ((p18 <= p183))))) : A (X (F (F ((p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60))))) : A ((p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 <= p104)) : A ((p71 <= p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79)) : A (X (G (F ((1 <= p71))))) : A ((((1 <= p104) U (2 <= p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165)) U G (G ((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8))))) : A (G ((3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199))) : A ((p149 <= p43)) : A (F ((2 <= p105))) : A (X ((p132 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99))) : A (((2 <= p43) U F ((p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68)))) : A (X (F (G ((2 <= p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26))))) : A (X (G (G ((1 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60)))))
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 ((1 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68)
lola: processed formula length: 52
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 <= p149)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 <= p149)))
lola: processed formula: A (X ((p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 <= p149)))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X (F ((2 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (X (F ((2 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60))))))
lola: processed formula: A (X (G (X (F ((2 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60))))))
lola: processed formula length: 72
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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: 216 markings, 216 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((2 <= p18) U G ((p18 <= p183)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((2 <= p18) U G ((p18 <= p183)))))
lola: processed formula: A (X (((2 <= p18) U G ((p18 <= p183)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 161 markings, 161 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F ((p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60))))
lola: processed formula: A (X (F ((p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60))))
lola: processed formula length: 116
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 <= p104))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 <= p104)
lola: processed formula length: 63
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p71 <= p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p71 <= p78 + p77 + p76 + p75 + p74 + p73 + p72 + p79)
lola: processed formula length: 54
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F ((1 <= p71)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F ((1 <= p71)))))
lola: processed formula: A (X (G (F ((1 <= p71)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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: 968982 markings, 1078553 edges, 193796 markings/sec, 0 secs
lola: 1930902 markings, 2173278 edges, 192384 markings/sec, 5 secs
lola: 2852406 markings, 3217618 edges, 184301 markings/sec, 10 secs
lola: 3741605 markings, 4222782 edges, 177840 markings/sec, 15 secs
lola: 4635228 markings, 5239408 edges, 178725 markings/sec, 20 secs
lola: 5518122 markings, 6236832 edges, 176579 markings/sec, 25 secs
lola: 6386902 markings, 7218807 edges, 173756 markings/sec, 30 secs
lola: 7274399 markings, 8230004 edges, 177499 markings/sec, 35 secs
lola: 8147950 markings, 9251682 edges, 174710 markings/sec, 40 secs
lola: 9011378 markings, 10258829 edges, 172686 markings/sec, 45 secs
lola: 9869242 markings, 11254895 edges, 171573 markings/sec, 50 secs
lola: 10724773 markings, 12241478 edges, 171106 markings/sec, 55 secs
lola: 11566644 markings, 13217832 edges, 168374 markings/sec, 60 secs
lola: 12434153 markings, 14235292 edges, 173502 markings/sec, 65 secs
lola: 13299587 markings, 15265203 edges, 173087 markings/sec, 70 secs
lola: 14191644 markings, 16357323 edges, 178411 markings/sec, 75 secs
lola: 15075103 markings, 17437131 edges, 176692 markings/sec, 80 secs
lola: 15896090 markings, 18406163 edges, 164197 markings/sec, 85 secs
lola: 16729163 markings, 19384707 edges, 166615 markings/sec, 90 secs
lola: 17541599 markings, 20363013 edges, 162487 markings/sec, 95 secs
lola: 18348991 markings, 21352404 edges, 161478 markings/sec, 100 secs
lola: 19154592 markings, 22314618 edges, 161120 markings/sec, 105 secs
lola: 20031303 markings, 23340772 edges, 175342 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 427 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p104) U (2 <= p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165)) U G (G ((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= p104) U (2 <= p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165)) U G (G ((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8)))))
lola: processed formula: A ((((1 <= p104) U (2 <= p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165)) U G (G ((1 <= p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8)))))
lola: processed formula length: 137
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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: 161 markings, 161 edges
lola: ========================================
lola: subprocess 9 will run for 488 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 569 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p149 <= p43))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p149 <= p43)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 683 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p105)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p105)))
lola: processed formula: A (F ((2 <= p105)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 161 markings, 161 edges
lola: ========================================
lola: subprocess 12 will run for 854 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p132 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p132 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99)))
lola: processed formula: A (X ((p132 <= p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99)))
lola: processed formula length: 67
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 13 will run for 1139 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p43) U F ((p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= p43) U F ((p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68))))
lola: processed formula: A (((2 <= p43) U F ((p100 + p101 + p102 + p103 + p96 + p97 + p98 + p99 <= p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68))))
lola: processed formula length: 123
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 712 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1709 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G ((2 <= p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G ((2 <= p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26)))))
lola: processed formula: A (X (F (G ((2 <= p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26)))))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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: 691218 markings, 2723719 edges, 138244 markings/sec, 0 secs
lola: 1283375 markings, 5180084 edges, 118431 markings/sec, 5 secs
lola: 1910629 markings, 7742849 edges, 125451 markings/sec, 10 secs
lola: 2500360 markings, 10119676 edges, 117946 markings/sec, 15 secs
lola: 3070342 markings, 12376642 edges, 113996 markings/sec, 20 secs
lola: 3621655 markings, 14621602 edges, 110263 markings/sec, 25 secs
lola: 4169599 markings, 16803264 edges, 109589 markings/sec, 30 secs
lola: 4743693 markings, 19021989 edges, 114819 markings/sec, 35 secs
lola: 5295227 markings, 21222296 edges, 110307 markings/sec, 40 secs
lola: 5883761 markings, 23543481 edges, 117707 markings/sec, 45 secs
lola: 6424741 markings, 25679125 edges, 108196 markings/sec, 50 secs
lola: 7023321 markings, 27983378 edges, 119716 markings/sec, 55 secs
lola: 7607922 markings, 30229349 edges, 116920 markings/sec, 60 secs
lola: 8144752 markings, 32334654 edges, 107366 markings/sec, 65 secs
lola: 8660443 markings, 34473002 edges, 103138 markings/sec, 70 secs
lola: 9166498 markings, 36542168 edges, 101211 markings/sec, 75 secs
lola: 9655434 markings, 38585288 edges, 97787 markings/sec, 80 secs
lola: 10209513 markings, 40739141 edges, 110816 markings/sec, 85 secs
lola: 10693490 markings, 42728580 edges, 96795 markings/sec, 90 secs
lola: 11225979 markings, 44873918 edges, 106498 markings/sec, 95 secs
lola: 11715160 markings, 46863918 edges, 97836 markings/sec, 100 secs
lola: 12199988 markings, 48851868 edges, 96966 markings/sec, 105 secs
lola: 12689353 markings, 50880231 edges, 97873 markings/sec, 110 secs
lola: 13131556 markings, 52796129 edges, 88441 markings/sec, 115 secs
lola: 13585484 markings, 54647769 edges, 90786 markings/sec, 120 secs
lola: 14112193 markings, 56671217 edges, 105342 markings/sec, 125 secs
lola: 14649146 markings, 58787436 edges, 107391 markings/sec, 130 secs
lola: 15118627 markings, 60814847 edges, 93896 markings/sec, 135 secs
lola: 15540903 markings, 62693191 edges, 84455 markings/sec, 140 secs
lola: 16079917 markings, 64896905 edges, 107803 markings/sec, 145 secs
lola: 16665741 markings, 67302726 edges, 117165 markings/sec, 150 secs
lola: 17221382 markings, 69475619 edges, 111128 markings/sec, 155 secs
lola: 17745757 markings, 71603066 edges, 104875 markings/sec, 160 secs
lola: 18269892 markings, 73719599 edges, 104827 markings/sec, 165 secs
lola: 18741302 markings, 75676661 edges, 94282 markings/sec, 170 secs
lola: 19277070 markings, 77660654 edges, 107154 markings/sec, 175 secs
lola: 19792446 markings, 79771093 edges, 103075 markings/sec, 180 secs
lola: 20287955 markings, 81741658 edges, 99102 markings/sec, 185 secs
lola: 20797071 markings, 83740623 edges, 101823 markings/sec, 190 secs
lola: 21324900 markings, 85907391 edges, 105566 markings/sec, 195 secs
lola: 21851203 markings, 88013662 edges, 105261 markings/sec, 200 secs
lola: 22349432 markings, 90018307 edges, 99646 markings/sec, 205 secs
lola: 22906882 markings, 92166233 edges, 111490 markings/sec, 210 secs
lola: 23440422 markings, 94398817 edges, 106708 markings/sec, 215 secs
lola: 24002183 markings, 96526851 edges, 112352 markings/sec, 220 secs
lola: 24546996 markings, 98741255 edges, 108963 markings/sec, 225 secs
lola: 25074707 markings, 100878740 edges, 105542 markings/sec, 230 secs
lola: 25541193 markings, 102771213 edges, 93297 markings/sec, 235 secs
lola: 26017767 markings, 104777804 edges, 95315 markings/sec, 240 secs
lola: 26510886 markings, 106640262 edges, 98624 markings/sec, 245 secs
lola: 27020910 markings, 108668863 edges, 102005 markings/sec, 250 secs
lola: 27520996 markings, 110577574 edges, 100017 markings/sec, 255 secs
lola: 28009869 markings, 112547537 edges, 97775 markings/sec, 260 secs
lola: 28497837 markings, 114477063 edges, 97594 markings/sec, 265 secs
lola: 28970383 markings, 116395152 edges, 94509 markings/sec, 270 secs
lola: 29419942 markings, 118257194 edges, 89912 markings/sec, 275 secs
lola: 29865155 markings, 120128656 edges, 89043 markings/sec, 280 secs
lola: 30343971 markings, 122038488 edges, 95763 markings/sec, 285 secs
lola: 30905762 markings, 124112479 edges, 112358 markings/sec, 290 secs
lola: 31468531 markings, 126422360 edges, 112554 markings/sec, 295 secs
lola: 32021407 markings, 128570234 edges, 110575 markings/sec, 300 secs
lola: 32513013 markings, 130631277 edges, 98321 markings/sec, 305 secs
lola: 32967451 markings, 132701431 edges, 90888 markings/sec, 310 secs
lola: 33456961 markings, 134719689 edges, 97902 markings/sec, 315 secs
lola: 33926414 markings, 136624037 edges, 93891 markings/sec, 320 secs
lola: 34420991 markings, 138702641 edges, 98915 markings/sec, 325 secs
lola: 34922021 markings, 140715318 edges, 100206 markings/sec, 330 secs
lola: 35371847 markings, 142646518 edges, 89965 markings/sec, 335 secs
lola: 35837274 markings, 144703925 edges, 93085 markings/sec, 340 secs
lola: 36334238 markings, 146681262 edges, 99393 markings/sec, 345 secs
lola: 36834623 markings, 148628161 edges, 100077 markings/sec, 350 secs
lola: 37279059 markings, 150532967 edges, 88887 markings/sec, 355 secs
lola: 37732823 markings, 152388586 edges, 90753 markings/sec, 360 secs
lola: 38186754 markings, 154294218 edges, 90786 markings/sec, 365 secs
lola: 38664082 markings, 156149049 edges, 95466 markings/sec, 370 secs
lola: 39096046 markings, 157970366 edges, 86393 markings/sec, 375 secs
lola: 39544705 markings, 159812145 edges, 89732 markings/sec, 380 secs
lola: 40042618 markings, 161700931 edges, 99583 markings/sec, 385 secs
lola: 40552983 markings, 163649767 edges, 102073 markings/sec, 390 secs
lola: 41116622 markings, 165785466 edges, 112728 markings/sec, 395 secs
lola: 41620562 markings, 167858870 edges, 100788 markings/sec, 400 secs
lola: 42132084 markings, 169849955 edges, 102304 markings/sec, 405 secs
lola: 42661124 markings, 171916015 edges, 105808 markings/sec, 410 secs
lola: 43136416 markings, 173908249 edges, 95058 markings/sec, 415 secs
lola: 43616801 markings, 175941604 edges, 96077 markings/sec, 420 secs
lola: 44093326 markings, 177983380 edges, 95305 markings/sec, 425 secs
lola: 44592564 markings, 179976402 edges, 99848 markings/sec, 430 secs
lola: 45084506 markings, 181972440 edges, 98388 markings/sec, 435 secs
lola: 45546201 markings, 184021298 edges, 92339 markings/sec, 440 secs
lola: 45989693 markings, 186052152 edges, 88698 markings/sec, 445 secs
lola: 46506133 markings, 188111789 edges, 103288 markings/sec, 450 secs
lola: 47021673 markings, 190149364 edges, 103108 markings/sec, 455 secs
lola: 47465952 markings, 192043674 edges, 88856 markings/sec, 460 secs
lola: 48024033 markings, 194181428 edges, 111616 markings/sec, 465 secs
lola: 48551879 markings, 196210016 edges, 105569 markings/sec, 470 secs
lola: 49061752 markings, 198261122 edges, 101975 markings/sec, 475 secs
lola: 49583069 markings, 200267831 edges, 104263 markings/sec, 480 secs
lola: 50040556 markings, 202296104 edges, 91497 markings/sec, 485 secs
lola: 50532155 markings, 204216805 edges, 98320 markings/sec, 490 secs
lola: 51001384 markings, 206226428 edges, 93846 markings/sec, 495 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2913 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G ((1 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (G ((1 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60)))))
lola: processed formula: A (X (G (G ((1 <= p53 + p54 + p55 + p56 + p57 + p58 + p59 + p60)))))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 208 places; total mentions: 0
lola: closed formula file PermAdmissibility-COL-10-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: 161 markings, 161 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no yes yes yes unknown no no yes no yes yes unknown no
FORMULA PermAdmissibility-COL-10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-10-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 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-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is PermAdmissibility-COL-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-csrt-152732587500129"
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 ;