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 216K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.8K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 122 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 360 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_pt
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 39K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is BridgeAndVehicles-COL-V20P20N10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-ebro-152732364700043
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527527233157


BK_STOP 1527527766951

--------------------
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 BridgeAndVehicles-COL-V20P20N10 as instance name.
Using BridgeAndVehicles 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': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 11300, 'Memory': 343.45, 'Tool': 'lola'}, {'Time': 14450, 'Memory': 335.77, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola BridgeAndVehicles-COL-V20P20N10...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
BridgeAndVehicles-COL-V20P20N10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-COL-V20P20N10: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ BridgeAndVehicles-COL-V20P20N10 @ 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: 616/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 68 places, 548 transitions, 61 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 693 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: A (X (G (F (F ((p66 + p67 <= p0)))))) : A (X ((X ((1 <= p39 + p40)) U X ((1 <= p1))))) : A ((G (G ((p1 <= p0))) U ((p39 + p40 <= p66 + p67) U (2 <= p0)))) : A ((G ((p0 <= p36)) U ((p0 <= p1) U (3 <= p1)))) : A (X (X ((3 <= p1)))) : A (X (X (G (X ((2 <= p2)))))) : A (X (F (((3 <= p39 + p40) U (2 <= p66 + p67))))) : A (F (G (X (F ((2 <= p38)))))) : A (((3 <= p1) U ((p2 <= p0) U (1 <= p2)))) : A ((p37 <= p65 + p64)) : A (F (X (G (G ((1 <= p65 + p64)))))) : A ((F (F ((2 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14))) U G (X ((2 <= p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35))))) : A ((3 <= p41)) : A ((3 <= p37)) : A (G ((p0 <= p37))) : A (G ((F ((p39 + p40 <= p65 + p64)) U X ((p38 <= p37)))))
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 (X (G (F (F ((p66 + p67 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F ((p66 + p67 <= p0)))))
lola: processed formula: A (X (G (F ((p66 + p67 <= p0)))))
lola: processed formula length: 33
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 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: 528932 markings, 1726786 edges, 105786 markings/sec, 0 secs
lola: 1005134 markings, 3338016 edges, 95240 markings/sec, 5 secs
lola: 1482860 markings, 4973296 edges, 95545 markings/sec, 10 secs
lola: 1943250 markings, 6567220 edges, 92078 markings/sec, 15 secs
lola: 2384934 markings, 8106832 edges, 88337 markings/sec, 20 secs
lola: 2800525 markings, 9561308 edges, 83118 markings/sec, 25 secs
lola: 3221318 markings, 11039223 edges, 84159 markings/sec, 30 secs
lola: 3636322 markings, 12502597 edges, 83001 markings/sec, 35 secs
lola: 4038686 markings, 13929642 edges, 80473 markings/sec, 40 secs
lola: 4447441 markings, 15364467 edges, 81751 markings/sec, 45 secs
lola: 4846567 markings, 16778740 edges, 79825 markings/sec, 50 secs
lola: 5231173 markings, 18147854 edges, 76921 markings/sec, 55 secs
lola: 5620669 markings, 19520837 edges, 77899 markings/sec, 60 secs
lola: 5993319 markings, 20859016 edges, 74530 markings/sec, 65 secs
lola: 6388269 markings, 22244873 edges, 78990 markings/sec, 70 secs
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: 6732570 markings, 23489236 edges
lola: ========================================
lola: subprocess 1 will run for 230 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((1 <= p39 + p40)) U X ((1 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (((1 <= p39 + p40) U (1 <= p1)))))
lola: processed formula: A (X (X (((1 <= p39 + p40) U (1 <= p1)))))
lola: processed formula length: 42
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 11 edges
lola: ========================================
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((p1 <= p0))) U ((p39 + p40 <= p66 + p67) U (2 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((p1 <= p0))) U ((p39 + p40 <= p66 + p67) U (2 <= p0))))
lola: processed formula: A ((G (G ((p1 <= p0))) U ((p39 + p40 <= p66 + p67) U (2 <= p0))))
lola: processed formula length: 65
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 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: 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 3 will run for 266 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G ((p0 <= p36)) U ((p0 <= p1) U (3 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G ((p0 <= p36)) U ((p0 <= p1) U (3 <= p1))))
lola: processed formula: A ((G ((p0 <= p36)) U ((p0 <= p1) U (3 <= p1))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 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: 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 4 will run for 288 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((3 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X ((3 <= p1))))
lola: processed formula: A (X (X ((3 <= p1))))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 9 markings, 11 edges
lola: ========================================
lola: subprocess 5 will run for 314 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (G (X ((2 <= p2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (G (X ((2 <= p2))))))
lola: processed formula: A (X (X (G (X ((2 <= p2))))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 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: 170 markings, 170 edges
lola: ========================================
lola: subprocess 6 will run for 346 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (((3 <= p39 + p40) U (2 <= p66 + p67)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (((3 <= p39 + p40) U (2 <= p66 + p67)))))
lola: processed formula: A (X (F (((3 <= p39 + p40) U (2 <= p66 + p67)))))
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 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: 170 markings, 170 edges
lola: ========================================
lola: subprocess 7 will run for 384 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (F ((2 <= p38))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (F ((2 <= p38))))))
lola: processed formula: A (F (G (X (F ((2 <= p38))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 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: 171 markings, 172 edges
lola: ========================================
lola: subprocess 8 will run for 432 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p1) U ((p2 <= p0) U (1 <= p2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((3 <= p1) U ((p2 <= p0) U (1 <= p2))))
lola: processed formula: A (((3 <= p1) U ((p2 <= p0) U (1 <= p2))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 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: 39807 markings, 142902 edges, 7961 markings/sec, 0 secs
lola: 73074 markings, 259902 edges, 6653 markings/sec, 5 secs
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: 100326 markings, 340185 edges
lola: ========================================
lola: subprocess 9 will run for 492 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p37 <= p65 + p64))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p37 <= p65 + p64)
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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 10 will run for 574 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (G (G ((1 <= p65 + p64))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (G (G ((1 <= p65 + p64))))))
lola: processed formula: A (F (X (G (G ((1 <= p65 + p64))))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 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: 468111 markings, 2321639 edges, 93622 markings/sec, 0 secs
lola: 904860 markings, 4604673 edges, 87350 markings/sec, 5 secs
lola: 1322554 markings, 6814229 edges, 83539 markings/sec, 10 secs
lola: 1737919 markings, 9018168 edges, 83073 markings/sec, 15 secs
lola: 2147924 markings, 11187451 edges, 82001 markings/sec, 20 secs
lola: 2539969 markings, 13265675 edges, 78409 markings/sec, 25 secs
lola: 2938233 markings, 15377178 edges, 79653 markings/sec, 30 secs
lola: 3328019 markings, 17485344 edges, 77957 markings/sec, 35 secs
lola: 3718560 markings, 19587939 edges, 78108 markings/sec, 40 secs
lola: 4092068 markings, 21633510 edges, 74702 markings/sec, 45 secs
lola: 4467843 markings, 23667280 edges, 75155 markings/sec, 50 secs
lola: 4823303 markings, 25615628 edges, 71092 markings/sec, 55 secs
lola: 5190056 markings, 27624006 edges, 73351 markings/sec, 60 secs
lola: 5553206 markings, 29598451 edges, 72630 markings/sec, 65 secs
lola: 5906995 markings, 31561520 edges, 70758 markings/sec, 70 secs
lola: 6268228 markings, 33528940 edges, 72247 markings/sec, 75 secs
lola: 6621192 markings, 35473363 edges, 70593 markings/sec, 80 secs
lola: 6954410 markings, 37334696 edges, 66644 markings/sec, 85 secs
lola: 7312941 markings, 39281955 edges, 71706 markings/sec, 90 secs
lola: 7654755 markings, 41170693 edges, 68363 markings/sec, 95 secs
lola: 7991016 markings, 43050021 edges, 67252 markings/sec, 100 secs
lola: 8337377 markings, 44948300 edges, 69272 markings/sec, 105 secs
lola: 8678055 markings, 46821874 edges, 68136 markings/sec, 110 secs
lola: 9012547 markings, 48689646 edges, 66898 markings/sec, 115 secs
lola: 9339809 markings, 50528056 edges, 65452 markings/sec, 120 secs
lola: 9691848 markings, 52439590 edges, 70408 markings/sec, 125 secs
lola: 10033439 markings, 54330246 edges, 68318 markings/sec, 130 secs
lola: 10366350 markings, 56200065 edges, 66582 markings/sec, 135 secs
lola: 10706882 markings, 58084542 edges, 68106 markings/sec, 140 secs
lola: 11055437 markings, 60002446 edges, 69711 markings/sec, 145 secs
lola: 11382582 markings, 61824320 edges, 65429 markings/sec, 150 secs
lola: 11712946 markings, 63680104 edges, 66073 markings/sec, 155 secs
lola: 12046986 markings, 65535641 edges, 66808 markings/sec, 160 secs
lola: 12401570 markings, 67482095 edges, 70917 markings/sec, 165 secs
lola: 12734475 markings, 69341162 edges, 66581 markings/sec, 170 secs
lola: 13065267 markings, 71196133 edges, 66158 markings/sec, 175 secs
lola: 13402174 markings, 73098088 edges, 67381 markings/sec, 180 secs
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: 13458515 markings, 73422277 edges
lola: ========================================
lola: subprocess 11 will run for 652 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((2 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14))) U G (X ((2 <= p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((2 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14)) U G (X ((2 <= p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))))
lola: processed formula: A ((F ((2 <= p4 + p5 + p6 + p7 + p8 + p9 + p10 + p11 + p12 + p13 + p14)) U G (X ((2 <= p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35)))))
lola: processed formula length: 215
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 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: 170 markings, 170 edges
lola: ========================================
lola: subprocess 12 will run for 815 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p41))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p41)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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 13 will run for 1086 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p37))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p37)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-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 14 will run for 1630 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p0 <= p37)))
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 244 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 15 will run for 3260 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((p39 + p40 <= p65 + p64)) U X ((p38 <= p37)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((F ((p39 + p40 <= p65 + p64)) U X ((p38 <= p37)))))
lola: processed formula: A (G ((F ((p39 + p40 <= p65 + p64)) U X ((p38 <= p37)))))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 68 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V20P20N10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 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: 583700 markings, 1756085 edges, 116740 markings/sec, 0 secs
lola: 1125446 markings, 3426944 edges, 108349 markings/sec, 5 secs
lola: 1642822 markings, 5045040 edges, 103475 markings/sec, 10 secs
lola: 2129169 markings, 6618488 edges, 97269 markings/sec, 15 secs
lola: 2605461 markings, 8147123 edges, 95258 markings/sec, 20 secs
lola: 3056084 markings, 9630587 edges, 90125 markings/sec, 25 secs
lola: 3506767 markings, 11094850 edges, 90137 markings/sec, 30 secs
lola: 3949464 markings, 12527783 edges, 88539 markings/sec, 35 secs
lola: 4383562 markings, 13945355 edges, 86820 markings/sec, 40 secs
lola: 4809259 markings, 15349483 edges, 85139 markings/sec, 45 secs
lola: 5253162 markings, 16814084 edges, 88781 markings/sec, 50 secs
lola: 5698031 markings, 18264991 edges, 88974 markings/sec, 55 secs
lola: 6118927 markings, 19685460 edges, 84179 markings/sec, 60 secs
lola: 6509626 markings, 21796887 edges, 78140 markings/sec, 65 secs
lola: 6884693 markings, 23881601 edges, 75013 markings/sec, 70 secs
lola: 7249104 markings, 25955088 edges, 72882 markings/sec, 75 secs
lola: 7579519 markings, 27851270 edges, 66083 markings/sec, 80 secs
lola: 7936064 markings, 29904863 edges, 71309 markings/sec, 85 secs
lola: 8272977 markings, 31969238 edges, 67383 markings/sec, 90 secs
lola: 8588086 markings, 33864729 edges, 63022 markings/sec, 95 secs
lola: 8896045 markings, 35746974 edges, 61592 markings/sec, 100 secs
lola: 9193848 markings, 37584488 edges, 59561 markings/sec, 105 secs
lola: 9496607 markings, 39420324 edges, 60552 markings/sec, 110 secs
lola: 9783042 markings, 41224762 edges, 57287 markings/sec, 115 secs
lola: 10079007 markings, 43012346 edges, 59193 markings/sec, 120 secs
lola: 10353147 markings, 44764616 edges, 54828 markings/sec, 125 secs
lola: 10643168 markings, 46535580 edges, 58004 markings/sec, 130 secs
lola: 10916335 markings, 48235203 edges, 54633 markings/sec, 135 secs
lola: 11201869 markings, 50003960 edges, 57107 markings/sec, 140 secs
lola: 11477382 markings, 51733365 edges, 55103 markings/sec, 145 secs
lola: 11745657 markings, 53464263 edges, 53655 markings/sec, 150 secs
lola: 12029560 markings, 55196493 edges, 56781 markings/sec, 155 secs
lola: 12293873 markings, 56848392 edges, 52863 markings/sec, 160 secs
lola: 12567213 markings, 58533724 edges, 54668 markings/sec, 165 secs
lola: 12836440 markings, 60246182 edges, 53845 markings/sec, 170 secs
lola: 13096767 markings, 61912357 edges, 52065 markings/sec, 175 secs
lola: 13394481 markings, 63534059 edges, 59543 markings/sec, 180 secs
lola: 13794086 markings, 64861448 edges, 79921 markings/sec, 185 secs
lola: 14154693 markings, 66287119 edges, 72121 markings/sec, 190 secs
lola: 14428774 markings, 68059457 edges, 54816 markings/sec, 195 secs
lola: 14693731 markings, 69753430 edges, 52991 markings/sec, 200 secs
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: 14900228 markings, 71099771 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no no no yes yes yes no no no no yes
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V20P20N10-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- 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="BridgeAndVehicles-COL-V20P20N10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P20N10.tgz
mv BridgeAndVehicles-COL-V20P20N10 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 BridgeAndVehicles-COL-V20P20N10, 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 r223-ebro-152732364700043"
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 ;