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 192K
-rw-r--r-- 1 mcc users 3.6K 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.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.5K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 31K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PhilosophersDyn-COL-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-csrt-152732584200239
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527458482722


BK_STOP 1527458526595

--------------------
content from stderr:

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PhilosophersDyn-COL-03 as instance name.
Using PhilosophersDyn 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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': None, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 173, 'Memory': 105.48, 'Tool': 'lola'}, {'Time': 183, 'Memory': 106.27, 'Tool': 'lola'}, {'Time': 4587, 'Memory': 353.61, 'Tool': 'itstools'}, {'Time': 5626, 'Memory': 351.05, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PhilosophersDyn-COL-03...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
PhilosophersDyn-COL-03: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PhilosophersDyn-COL-03: translating COL formula LTLCardinality into LoLA format
===========================================================================================
----- Start make result stderr -----
translating formula complete
----- Start make result stdout -----
LTLCardinality @ PhilosophersDyn-COL-03 @ 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: 114/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 30 places, 84 transitions, 19 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 145 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-COL-03-LTLCardinality.task
lola: A (F (F (X (F ((2 <= p27 + p28 + p29)))))) : A ((((1 <= p0 + p1 + p2) U (3 <= p0 + p1 + p2)) U G ((p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15 <= p6 + p7 + p8)))) : A ((X (X ((1 <= p19 + p20 + p18))) U ((p27 + p28 + p29 <= p6 + p7 + p8) U (p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15 <= p3 + p4 + p5)))) : A (F (F (G (G ((3 <= p27 + p28 + p29)))))) : A ((((3 <= p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15) U (3 <= p21 + p22 + p23)) U G (G ((p6 + p7 + p8 <= p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15))))) : A (X (F (X (X ((3 <= p6 + p7 + p8)))))) : A (X (X (X (G ((1 <= p3 + p4 + p5)))))) : A ((p6 + p7 + p8 <= p0 + p1 + p2)) : A (((p21 + p22 + p23 <= p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15) U ((3 <= p3 + p4 + p5) U (2 <= p19 + p20 + p18)))) : A (X (G (X ((p19 + p20 + p18 <= p21 + p22 + p23))))) : A ((p3 + p4 + p5 <= p26 + p25 + p24)) : A (((p3 + p4 + p5 <= p27 + p28 + p29) U X (X ((3 <= p21 + p22 + p23))))) : A ((F (X ((1 <= p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15))) U F (F ((3 <= p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15))))) : A ((p6 + p7 + p8 <= p27 + p28 + p29)) : A (G (F (((p27 + p28 + p29 <= p0 + p1 + p2) U (3 <= p0 + p1 + p2))))) : A (X ((1 <= p19 + p20 + p18)))
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 (F (F (X (F ((2 <= p27 + p28 + p29))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (F ((2 <= p27 + p28 + p29)))))
lola: processed formula: A (F (X (F ((2 <= p27 + p28 + p29)))))
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p0 + p1 + p2) U (3 <= p0 + p1 + p2)) U G ((p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15 <= p6 + p7 + p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= p0 + p1 + p2) U (3 <= p0 + p1 + p2)) U G ((p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15 <= p6 + p7 + p8))))
lola: processed formula: A ((((1 <= p0 + p1 + p2) U (3 <= p0 + p1 + p2)) U G ((p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15 <= p6 + p7 + p8))))
lola: processed formula length: 124
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((1 <= p19 + p20 + p18))) U ((p27 + p28 + p29 <= p6 + p7 + p8) U (p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15 <= p3 + p4 + p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (X ((1 <= p19 + p20 + p18))) U ((p27 + p28 + p29 <= p6 + p7 + p8) U (p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15 <= p3 + p4 + p5))))
lola: processed formula: A ((X (X ((1 <= p19 + p20 + p18))) U ((p27 + p28 + p29 <= p6 + p7 + p8) U (p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15 <= p3 + p4 + p5))))
lola: processed formula length: 145
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (G ((3 <= p27 + p28 + p29))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (G ((3 <= p27 + p28 + p29)))))
lola: processed formula: A (F (G (G ((3 <= p27 + p28 + p29)))))
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 7 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15) U (3 <= p21 + p22 + p23)) U G (G ((p6 + p7 + p8 <= p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((3 <= p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15) U (3 <= p21 + p22 + p23)) U G (G ((p6 + p7 + p8 <= p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15)))))
lola: processed formula: A ((((3 <= p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15) U (3 <= p21 + p22 + p23)) U G (G ((p6 + p7 + p8 <= p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15)))))
lola: processed formula length: 169
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: 967 markings, 3660 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X (X ((3 <= p6 + p7 + p8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (X (X ((3 <= p6 + p7 + p8))))))
lola: processed formula: A (X (F (X (X ((3 <= p6 + p7 + p8))))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((1 <= p3 + p4 + p5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (X (G ((1 <= p3 + p4 + p5))))))
lola: processed formula: A (X (X (X (G ((1 <= p3 + p4 + p5))))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p6 + p7 + p8 <= p0 + p1 + p2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p6 + p7 + p8 <= p0 + p1 + p2)
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p21 + p22 + p23 <= p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15) U ((3 <= p3 + p4 + p5) U (2 <= p19 + p20 + p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p21 + p22 + p23 <= p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15) U ((3 <= p3 + p4 + p5) U (2 <= p19 + p20 + p18))))
lola: processed formula: A (((p21 + p22 + p23 <= p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15) U ((3 <= p3 + p4 + p5) U (2 <= p19 + p20 + p18))))
lola: processed formula length: 126
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X ((p19 + p20 + p18 <= p21 + p22 + p23)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (X ((p19 + p20 + p18 <= p21 + p22 + p23)))))
lola: processed formula: A (X (G (X ((p19 + p20 + p18 <= p21 + p22 + p23)))))
lola: processed formula length: 52
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p3 + p4 + p5 <= p26 + p25 + p24))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p3 + p4 + p5 <= p26 + p25 + p24)
lola: processed formula length: 33
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-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 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p3 + p4 + p5 <= p27 + p28 + p29) U X (X ((3 <= p21 + p22 + p23)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p3 + p4 + p5 <= p27 + p28 + p29) U X (X ((3 <= p21 + p22 + p23)))))
lola: processed formula: A (((p3 + p4 + p5 <= p27 + p28 + p29) U X (X ((3 <= p21 + p22 + p23)))))
lola: processed formula length: 72
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((1 <= p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15))) U F (F ((3 <= p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((1 <= p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15))) U F ((3 <= p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15))))
lola: processed formula: A ((F (X ((1 <= p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15))) U F ((3 <= p9 + p10 + p11 + p12 + p13 + p14 + p17 + p16 + p15))))
lola: processed formula length: 135
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 bytes per marking, with 31 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p6 + p7 + p8 <= p27 + p28 + p29))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p6 + p7 + p8 <= p27 + p28 + p29)
lola: processed formula length: 33
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-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 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((p27 + p28 + p29 <= p0 + p1 + p2) U (3 <= p0 + p1 + p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (((p27 + p28 + p29 <= p0 + p1 + p2) U (3 <= p0 + p1 + p2)))))
lola: processed formula: A (G (F (((p27 + p28 + p29 <= p0 + p1 + p2) U (3 <= p0 + p1 + p2)))))
lola: processed formula length: 69
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= p19 + p20 + p18)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((1 <= p19 + p20 + p18)))
lola: processed formula: A (X ((1 <= p19 + p20 + p18)))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file PhilosophersDyn-COL-03-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 80 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: 4 markings, 6 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes no no yes yes no yes no no yes no yes
FORMULA PhilosophersDyn-COL-03-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhilosophersDyn-COL-03-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 stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhilosophersDyn-COL-03"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is PhilosophersDyn-COL-03, 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 r258-csrt-152732584200239"
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 ;