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 224K
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.7K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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 4.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K 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 4.0K 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 37K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is BridgeAndVehicles-COL-V04P05N02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r227-ebro-152732380800033
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527796729791


BK_STOP 1527796774359

--------------------
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-V04P05N02 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': 166, 'Memory': 111, 'Tool': 'lola'}, {'Time': 234, 'Memory': 111.71, 'Tool': 'lola'}, {'Time': 6946, 'Memory': 470.91, 'Tool': 'itstools'}, {'Time': 7245, 'Memory': 452.57, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola BridgeAndVehicles-COL-V04P05N02...

Time: 3600 - MCC
----- Start make prepare stderr -----
----- Start make prepare stdout -----
===========================================================================================
BridgeAndVehicles-COL-V04P05N02: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-COL-V04P05N02: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ BridgeAndVehicles-COL-V04P05N02 @ 3540 seconds
----- Start make result stderr -----
----- 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: 80/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 28 places, 52 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 85 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V04P05N02-LTLCardinality.task
lola: A (X (G (G ((p25 <= p5 + p6 + p7))))) : A ((F (X ((1 <= p22))) U G (F ((2 <= p8))))) : A ((p9 <= p0)) : A ((p9 <= p2)) : A ((X ((p2 <= p3 + p4)) U G (G ((p3 + p4 <= p10 + p11 + p12 + p13 + p14))))) : A (G (X (((1 <= p25) U (1 <= p1))))) : A (F ((G ((p5 + p6 + p7 <= p24 + p23)) U X ((3 <= p24 + p23))))) : A (G ((X ((3 <= p8)) U (2 <= p5 + p6 + p7)))) : A (X (F (G (G ((2 <= p9)))))) : A ((p16 + p17 + p18 + p19 + p20 <= p24 + p23)) : A (X ((p21 <= p25))) : A ((1 <= p3 + p4)) : A (F (X ((p10 + p11 + p12 + p13 + p14 <= p26 + p27)))) : A ((F ((1 <= p1)) U G (F ((3 <= p25))))) : A (X (X (X (G ((1 <= p26 + p27)))))) : A ((G (X ((p10 + p11 + p12 + p13 + p14 <= p3 + p4))) U (3 <= p0)))
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 (G ((p25 <= p5 + p6 + p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (G ((p25 <= p5 + p6 + p7)))))
lola: processed formula: A (X (G (G ((p25 <= p5 + p6 + p7)))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((1 <= p22))) U G (F ((2 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((1 <= p22))) U G (F ((2 <= p8)))))
lola: processed formula: A ((F (X ((1 <= p22))) U G (F ((2 <= p8)))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 62 markings, 62 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p9 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p9 <= p0)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p9 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p9 <= p2)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((p2 <= p3 + p4)) U G (G ((p3 + p4 <= p10 + p11 + p12 + p13 + p14)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X ((p2 <= p3 + p4)) U G (G ((p3 + p4 <= p10 + p11 + p12 + p13 + p14)))))
lola: processed formula: A ((X ((p2 <= p3 + p4)) U G (G ((p3 + p4 <= p10 + p11 + p12 + p13 + p14)))))
lola: processed formula length: 76
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 8541 markings, 24778 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (((1 <= p25) U (1 <= p1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (((1 <= p25) U (1 <= p1)))))
lola: processed formula: A (G (X (((1 <= p25) U (1 <= p1)))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((p5 + p6 + p7 <= p24 + p23)) U X ((3 <= p24 + p23)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((p5 + p6 + p7 <= p24 + p23)) U X ((3 <= p24 + p23)))))
lola: processed formula: A (F ((G ((p5 + p6 + p7 <= p24 + p23)) U X ((3 <= p24 + p23)))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((X ((3 <= p8)) U (2 <= p5 + p6 + p7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((X ((3 <= p8)) U (2 <= p5 + p6 + p7))))
lola: processed formula: A (G ((X ((3 <= p8)) U (2 <= p5 + p6 + p7))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 81 markings, 81 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G (G ((2 <= p9))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G (G ((2 <= p9))))))
lola: processed formula: A (X (F (G (G ((2 <= p9))))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 52 markings, 53 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p16 + p17 + p18 + p19 + p20 <= p24 + p23))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p16 + p17 + p18 + p19 + p20 <= p24 + p23)
lola: processed formula length: 42
lola: 1 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p21 <= p25)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p21 <= p25)))
lola: processed formula: A (X ((p21 <= p25)))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p3 + p4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p3 + p4)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((p10 + p11 + p12 + p13 + p14 <= p26 + p27))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X ((p10 + p11 + p12 + p13 + p14 <= p26 + p27))))
lola: processed formula: A (F (X ((p10 + p11 + p12 + p13 + p14 <= p26 + p27))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 232 markings, 512 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((1 <= p1)) U G (F ((3 <= p25)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((1 <= p1)) U G (F ((3 <= p25)))))
lola: processed formula: A ((F ((1 <= p1)) U G (F ((3 <= p25)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 6989 markings, 29329 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((1 <= p26 + p27))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (X (G ((1 <= p26 + p27))))))
lola: processed formula: A (X (X (X (G ((1 <= p26 + p27))))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((p10 + p11 + p12 + p13 + p14 <= p3 + p4))) U (3 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (X ((p10 + p11 + p12 + p13 + p14 <= p3 + p4))) U (3 <= p0)))
lola: processed formula: A ((G (X ((p10 + p11 + p12 + p13 + p14 <= p3 + p4))) U (3 <= p0)))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 1 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes yes no no no no no no yes yes yes no yes
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-LTLCardinality-15 TRUE 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="BridgeAndVehicles-COL-V04P05N02"
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/BridgeAndVehicles-COL-V04P05N02.tgz
mv BridgeAndVehicles-COL-V04P05N02 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 BridgeAndVehicles-COL-V04P05N02, 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 r227-ebro-152732380800033"
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 ;