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 196K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 38K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is LamportFastMutEx-COL-2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666477900059
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527290380856


BK_STOP 1527290424823

--------------------
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 LamportFastMutEx-COL-2 as instance name.
Using LamportFastMutEx as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, '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': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': False, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 122, 'Memory': 112.51, 'Tool': 'lola'}, {'Time': 185, 'Memory': 111.07, 'Tool': 'lola'}, {'Time': 334, 'Memory': 101.29, 'Tool': 'gspn'}, {'Time': 2207, 'Memory': 167.32, 'Tool': 'gspn'}, {'Time': 3546, 'Memory': 2229.43, 'Tool': 'marcie'}, {'Time': 3866, 'Memory': 2228.95, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola LamportFastMutEx-COL-2...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
LamportFastMutEx-COL-2: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
LamportFastMutEx-COL-2: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ LamportFastMutEx-COL-2 @ 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: 165/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 69 places, 96 transitions, 52 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 137 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-COL-2-CTLCardinality.task
lola: A (F ((1 <= p48 + p49 + p50))) : (NOT(NOT(A (F ((p27 + p28 + p29 <= p9 + p11 + p13 + p14 + p12 + p10))))) OR (p62 + p61 + p60 + 1 <= p24 + p25 + p26)) : (p21 + p22 + p23 + 1 <= p9 + p11 + p13 + p14 + p12 + p10) : ((3 <= p27 + p28 + p29) AND (E (G ((p45 + p46 + p47 <= 1))) OR E (F (((p0 + p1 + p2 <= p30 + p31 + p32) OR (p24 + p25 + p26 <= p18 + p19 + p20)))))) : ((3 <= p18 + p19 + p20) OR (((2 <= p30 + p31 + p32) OR E (X ((3 <= p62 + p61 + p60)))) OR (p27 + p28 + p29 <= p33 + p34 + p35))) : (2 <= p62 + p61 + p60) : NOT(E (F (A (X ((p9 + p11 + p13 + p14 + p12 + p10 <= p21 + p22 + p23)))))) : A (F ((p62 + p61 + p60 <= p18 + p19 + p20))) : ((1 <= p24 + p25 + p26) AND (p48 + p49 + p50 <= p65 + p64 + p63)) : NOT(((((p27 + p28 + p29 + 1 <= p66 + p67 + p68) OR ((1 <= p30 + p31 + p32) AND (p48 + p49 + p50 <= p33 + p34 + p35))) AND E (X ((p6 + p7 + p8 <= p0 + p1 + p2)))) AND E (G ((3 <= p9 + p11 + p13 + p14 + p12 + p10))))) : E (G (E (F (((p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p51 <= p24 + p25 + p26) OR (p3 + p4 + p5 <= p65 + p64 + p63)))))) : (A ((((p0 + p1 + p2 <= p27 + p28 + p29) OR (p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p51 <= p33 + p34 + p35)) U ((p21 + p22 + p23 <= p30 + p31 + p32) AND (p62 + p61 + p60 <= p3 + p4 + p5)))) AND A (F (A (G ((3 <= p45 + p46 + p47)))))) : A (F (((p33 + p34 + p35 <= p66 + p67 + p68) AND ((p15 + p16 + p17 <= p62 + p61 + p60) OR (1 <= p9 + p11 + p13 + p14 + p12 + p10) OR (1 <= p33 + p34 + p35) OR (2 <= p24 + p25 + p26))))) : (A (G ((p0 + p1 + p2 + 1 <= p9 + p11 + p13 + p14 + p12 + p10))) AND E (X (((p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 <= p62 + p61 + p60) OR (3 <= p27 + p28 + p29) OR ((p66 + p67 + p68 <= p9 + p11 + p13 + p14 + p12 + p10) AND (p15 + p16 + p17 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p51)))))) : (3 <= p18 + p19 + p20) : NOT(E (F ((p9 + p11 + p13 + p14 + p12 + p10 <= p48 + p49 + p50))))
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 ((1 <= p48 + p49 + p50)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= p48 + p49 + p50)))
lola: processed formula: A (F ((1 <= p48 + p49 + p50)))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 11 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(NOT(A (F ((p27 + p28 + p29 <= p9 + p11 + p13 + p14 + p12 + p10))))) OR (p62 + p61 + p60 + 1 <= p24 + p25 + p26))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p27 + p28 + p29 <= p9 + p11 + p13 + p14 + p12 + p10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p27 + p28 + p29 <= p9 + p11 + p13 + p14 + p12 + p10)))
lola: processed formula: A (F ((p27 + p28 + p29 <= p9 + p11 + p13 + p14 + p12 + p10)))
lola: processed formula length: 61
lola: 6 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 11 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p21 + p22 + p23 + 1 <= p9 + p11 + p13 + p14 + p12 + p10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p21 + p22 + p23 + 1 <= p9 + p11 + p13 + p14 + p12 + p10)
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.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: ((3 <= p27 + p28 + p29) AND (E (G ((p45 + p46 + p47 <= 1))) OR E (F (((p0 + p1 + p2 <= p30 + p31 + p32) OR (p24 + p25 + p26 <= p18 + p19 + p20))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p27 + p28 + p29)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p27 + p28 + p29)
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p18 + p19 + p20) OR (((2 <= p30 + p31 + p32) OR E (X ((3 <= p62 + p61 + p60)))) OR (p27 + p28 + p29 <= p33 + p34 + p35)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p18 + p19 + p20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p18 + p19 + p20)
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p30 + p31 + p32)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p30 + p31 + p32)
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((3 <= p62 + p61 + p60)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((3 <= p62 + p61 + p60))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p27 + p28 + p29 <= p33 + p34 + p35)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p27 + p28 + p29 <= p33 + p34 + p35)
lola: processed formula length: 36
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p62 + p61 + p60)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p62 + p61 + p60)
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (X ((p9 + p11 + p13 + p14 + p12 + p10 <= p21 + p22 + p23))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((p21 + p22 + p23 + 1 <= p9 + p11 + p13 + p14 + p12 + p10)))))
lola: processed formula length: 81
lola: 7 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 380 markings, 716 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p62 + p61 + p60 <= p18 + p19 + p20)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p62 + p61 + p60 <= p18 + p19 + p20)))
lola: processed formula: A (F ((p62 + p61 + p60 <= p18 + p19 + p20)))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 11 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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= p24 + p25 + p26) AND (p48 + p49 + p50 <= p65 + p64 + p63))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p24 + p25 + p26) AND (p48 + p49 + p50 <= p65 + p64 + p63))
lola: processed formula length: 65
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: processed formula with 2 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((((p27 + p28 + p29 + 1 <= p66 + p67 + p68) OR ((1 <= p30 + p31 + p32) AND (p48 + p49 + p50 <= p33 + p34 + p35))) AND E (X ((p6 + p7 + p8 <= p0 + p1 + p2)))) AND E (G ((3 <= p9 + p11 + p13 + p14 + p12 + p10)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p66 + p67 + p68 <= p27 + p28 + p29) AND ((p30 + p31 + p32 <= 0) OR (p33 + p34 + p35 + 1 <= p48 + p49 + p50)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p66 + p67 + p68 <= p27 + p28 + p29) AND ((p30 + p31 + p32 <= 0) OR (p33 + p34 + p35 + 1 <= p48 + p49 + p50)))
lola: processed formula length: 112
lola: 10 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p0 + p1 + p2 + 1 <= p6 + p7 + p8)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p0 + p1 + p2 + 1 <= p6 + p7 + p8)))
lola: processed formula: A (X ((p0 + p1 + p2 + 1 <= p6 + p7 + p8)))
lola: processed formula length: 42
lola: 10 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 10 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: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p51 <= p24 + p25 + p26) OR (p3 + p4 + p5 <= p65 + p64 + p63))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U ((p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p51 <= p24 + p25 + p26) OR (p3 + p4 + p5 <= p65 + p64 + p63))))))
lola: processed formula length: 142
lola: 2 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 20 markings, 40 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((p0 + p1 + p2 <= p27 + p28 + p29) OR (p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p51 <= p33 + p34 + p35)) U ((p21 + p22 + p23 <= p30 + p31 + p32) AND (p62 + p61 + p60 <= p3 + p4 + p5)))) AND A (F (A (G ((3 <= p45 + p46 + p47))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p0 + p1 + p2 <= p27 + p28 + p29) OR (p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p51 <= p33 + p34 + p35)) U ((p21 + p22 + p23 <= p30 + p31 + p32) AND (p62 + p61 + p60 <= p3 + p4 + p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p0 + p1 + p2 <= p27 + p28 + p29) OR (p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p51 <= p33 + p34 + p35)) U ((p21 + p22 + p23 <= p30 + p31 + p32) AND (p62 + p61 + p60 <= p3 + p4 + p5))))
lola: processed formula: A ((((p0 + p1 + p2 <= p27 + p28 + p29) OR (p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p51 <= p33 + p34 + p35)) U ((p21 + p22 + p23 <= p30 + p31 + p32) AND (p62 + p61 + p60 <= p3 + p4 + p5))))
lola: processed formula length: 197
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 10 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 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((3 <= p45 + p46 + p47)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((3 <= p45 + p46 + p47)))))
lola: processed formula: A (F (A (G ((3 <= p45 + p46 + p47)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 10 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: 21 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p33 + p34 + p35 <= p66 + p67 + p68) AND ((p15 + p16 + p17 <= p62 + p61 + p60) OR (1 <= p9 + p11 + p13 + p14 + p12 + p10) OR (1 <= p33 + p34 + p35) OR (2 <= p24 + p25 + p26)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p33 + p34 + p35 <= p66 + p67 + p68) AND ((p15 + p16 + p17 <= p62 + p61 + p60) OR (1 <= p9 + p11 + p13 + p14 + p12 + p10) OR (1 <= p33 + p34 + p35) OR (2 <= p24 + p25 + p26)))))
lola: processed formula: A (F (((p33 + p34 + p35 <= p66 + p67 + p68) AND ((p15 + p16 + p17 <= p62 + p61 + p60) OR (1 <= p9 + p11 + p13 + p14 + p12 + p10) OR (1 <= p33 + p34 + p35) OR (2 <= p24 + p25 + p26)))))
lola: processed formula length: 187
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 11 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 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((p0 + p1 + p2 + 1 <= p9 + p11 + p13 + p14 + p12 + p10))) AND E (X (((p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 <= p62 + p61 + p60) OR (3 <= p27 + p28 + p29) OR ((p66 + p67 + p68 <= p9 + p11 + p13 + p14 + p12 + p10) AND (p15 + p16 + p17 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p51))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p0 + p1 + p2 + 1 <= p9 + p11 + p13 + p14 + p12 + p10)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 372 markings, 677 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 <= p62 + p61 + p60) OR (3 <= p27 + p28 + p29) OR ((p66 + p67 + p68 <= p9 + p11 + p13 + p14 + p12 + p10) AND (p15 + p16 + p17 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p51)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 <= p62 + p61 + p60) OR (3 <= p27 + p28 + p29) OR ((p66 + p67 + p68 <= p9 + p11 + p13 + p14 + p12 + p10) AND (p15 + p16 + p17 <= p52 + p53 + p54 + p55 + p56 + p57 + p58 + p59 + p51))))
lola: processed formula length: 242
lola: 1 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p18 + p19 + p20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p18 + p19 + p20)
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 69 places; total mentions: 0
lola: closed formula file LamportFastMutEx-COL-2-CTLCardinality.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 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((p9 + p11 + p13 + p14 + p12 + p10 <= p48 + p49 + p50))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to LamportFastMutEx-COL-2-CTLCardinality-15.sara
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: state equation: calling and running sara
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes no yes yes no yes yes no yes yes no no
sara: try reading problem file LamportFastMutEx-COL-2-CTLCardinality-15.sara.
sara: place or transition ordering is non-deterministic

FORMULA LamportFastMutEx-COL-2-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-2-CTLCardinality-15 FALSE 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="LamportFastMutEx-COL-2"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-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/LamportFastMutEx-COL-2.tgz
mv LamportFastMutEx-COL-2 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-full"
echo " Input is LamportFastMutEx-COL-2, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r118-csrt-152666477900059"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;