About the Execution of M4M.struct for AirplaneLD-COL-0010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
426.790 | 54980.00 | 26286.00 | 1690.50 | FTTTTFFTFFFTFTTT | normal |
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 200K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K 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.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K 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 9.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 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 16K 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:49 equiv_pt
-rw-r--r-- 1 mcc users 5 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 40K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is AirplaneLD-COL-0010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-qhx2-152646141400010
=====================================================================
--------------------
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 AirplaneLD-COL-0010-CTLCardinality-00
FORMULA_NAME AirplaneLD-COL-0010-CTLCardinality-01
FORMULA_NAME AirplaneLD-COL-0010-CTLCardinality-02
FORMULA_NAME AirplaneLD-COL-0010-CTLCardinality-03
FORMULA_NAME AirplaneLD-COL-0010-CTLCardinality-04
FORMULA_NAME AirplaneLD-COL-0010-CTLCardinality-05
FORMULA_NAME AirplaneLD-COL-0010-CTLCardinality-06
FORMULA_NAME AirplaneLD-COL-0010-CTLCardinality-07
FORMULA_NAME AirplaneLD-COL-0010-CTLCardinality-08
FORMULA_NAME AirplaneLD-COL-0010-CTLCardinality-09
FORMULA_NAME AirplaneLD-COL-0010-CTLCardinality-10
FORMULA_NAME AirplaneLD-COL-0010-CTLCardinality-11
FORMULA_NAME AirplaneLD-COL-0010-CTLCardinality-12
FORMULA_NAME AirplaneLD-COL-0010-CTLCardinality-13
FORMULA_NAME AirplaneLD-COL-0010-CTLCardinality-14
FORMULA_NAME AirplaneLD-COL-0010-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526734394870
BK_STOP 1526734449850
--------------------
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 AirplaneLD-COL-0010 as instance name.
Using AirplaneLD 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': True, 'Nested Units': False, 'Safe': None, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 200, 'Memory': 101.53, 'Tool': 'gspn'}, {'Time': 1028, 'Memory': 117.46, 'Tool': 'lola'}, {'Time': 1557, 'Memory': 124, 'Tool': 'lola'}, {'Time': 1981, 'Memory': 170.12, 'Tool': 'gspn'}, {'Time': 2825, 'Memory': 2229.07, 'Tool': 'marcie'}, {'Time': 3257, 'Memory': 2229.22, 'Tool': 'marcie'}, {'Time': 3692, 'Memory': 250.79, 'Tool': 'itstools'}, {'Time': 3822, 'Memory': 252.41, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 5.14x far from the best tool gspn.
CTLCardinality lola AirplaneLD-COL-0010...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
AirplaneLD-COL-0010: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
AirplaneLD-COL-0010: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ AirplaneLD-COL-0010 @ 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: 177/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 89 places, 88 transitions, 54 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 75 transition conflict sets
lola: TASK
lola: reading formula from AirplaneLD-COL-0010-CTLCardinality.task
lola: NOT(A (G (((p77 + 1 <= p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p9 + p8 + p7 + p6 + p5 + p4 + p3 + p2) OR (p0 + 1 <= p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33))))) : A ((((p53 + 1 <= p34) OR (p75 + p76 + 1 <= p0)) U E (G ((p54 <= p23 + p22))))) : A (F ((A (G ((2 <= p23 + p22))) AND ((p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 <= p34) AND (3 <= p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88))))) : NOT(((A (G ((p0 <= p50 + p51))) OR (1 <= p47)) AND (((1 <= p54) AND (3 <= p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p9 + p8 + p7 + p6 + p5 + p4 + p3 + p2) AND (p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 <= p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33)) OR A (G ((p54 <= p75 + p76)))))) : (A (G (E (X (TRUE)))) OR (E (((p75 + p76 <= p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88) U (1 <= p52))) AND NOT(A (G (TRUE))))) : NOT(A ((((p48 + p49 <= p34) OR (p1 <= p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88)) U ((p77 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45) AND (p50 + p51 <= p52))))) : A (X (E (G ((p34 + 1 <= p47))))) : E (G (A (F ((p48 + p49 <= 1))))) : E (G (((p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 <= p77) OR (p75 + p76 <= p47)))) : E (F ((((3 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55) OR ((3 <= p0) AND (2 <= p53))) AND ((1 <= p54) OR (p53 + 1 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45))))) : E (G (E (G (((1 <= p53) OR (3 <= p52)))))) : A (G (((p54 + 1 <= p35) OR (p47 + 1 <= p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88) OR (1 <= p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88)))) : (NOT(A (G (((p47 <= p34) OR (p48 + p49 <= p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88))))) OR ((1 <= p75 + p76) OR (p77 <= p0))) : NOT(E (F (((p52 <= p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33) AND (2 <= p1) AND ((p78 <= p23 + p22) OR (p52 <= p35)))))) : E (F (A (X (((1 <= p54) AND (p47 <= p54)))))) : E (G (NOT(A (G ((2 <= p78))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (((p77 + 1 <= p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p9 + p8 + p7 + p6 + p5 + p4 + p3 + p2) OR (p0 + 1 <= p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to AirplaneLD-COL-0010-CTLCardinality.sara
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p53 + 1 <= p34) OR (p75 + p76 + 1 <= p0)) U E (G ((p54 <= p23 + p22)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((p53 + 1 <= p34) OR (p75 + p76 + 1 <= p0)) U NOT(A(TRUE U (p23 + p22 + 1 <= p54))))
lola: processed formula length: 87
lola: 3 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 11 markings, 11 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((2 <= p23 + p22))) AND ((p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 <= p34) AND (3 <= p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((A (G ((2 <= p23 + p22))) AND ((p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 <= p34) AND (3 <= p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88)))))
lola: processed formula: A (F ((A (G ((2 <= p23 + p22))) AND ((p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45 <= p34) AND (3 <= p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88)))))
lola: processed formula length: 176
lola: 0 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 220 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
sara: try reading problem file AirplaneLD-COL-0010-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
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: 41407 markings, 101532 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((A (G ((p0 <= p50 + p51))) OR (1 <= p47)) AND (((1 <= p54) AND (3 <= p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p9 + p8 + p7 + p6 + p5 + p4 + p3 + p2) AND (p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 <= p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33)) OR A (G ((p54 <= p75 + p76))))))
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: E (F ((p50 + p51 + 1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to AirplaneLD-COL-0010-CTLCardinality-3.sara
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p47 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p47 <= 0)
lola: processed formula length: 10
lola: 11 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-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: ((p54 <= 0) OR (p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p9 + p8 + p7 + p6 + p5 + p4 + p3 + p2 <= 2) OR (p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + 1 <= p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p54 <= 0) OR (p21 + p20 + p19 + p18 + p17 + p16 + p15 + p14 + p13 + p12 + p11 + p10 + p9 + p8 + p7 + p6 + p5 + p4 + p3 + p2 <= 2) OR (p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + 1 <= p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88))
lola: processed formula length: 262
sara: lola: try reading problem file AirplaneLD-COL-0010-CTLCardinality-3.sara.
11 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-CTLCardinality.task
lola: processed formula with 3 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: ========================================
sara: place or transition ordering is non-deterministic
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p75 + p76 + 1 <= p54)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: 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 reachable.
lola: 7 markings, 6 edges
lola: state equation: write sara problem file to AirplaneLD-COL-0010-CTLCardinality-6.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (E (X (TRUE)))) OR (E (((p75 + p76 <= p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88) U (1 <= p52))) AND NOT(A (G (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 11 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-CTLCardinality.task
lola: processed formula with 0 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A ((((p48 + p49 <= p34) OR (p1 <= p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88)) U ((p77 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45) AND (p50 + p51 <= p52)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(((p48 + p49 <= p34) OR (p1 <= p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88)) U ((p77 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45) AND (p50 + p51 <= p52))))
lola: processed formula length: 192
lola: 7 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 29797 markings, 53044 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((p34 + 1 <= p47)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (p47 <= p34))))
lola: processed formula length: 31
lola: 3 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 3465 markings, 8028 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((p48 + p49 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (p48 + p49 <= 1)))))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: 11 markings, 21 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 <= p77) OR (p75 + p76 <= p47))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p77 + 1 <= p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88) AND (p47 + 1 <= p75 + p76))))
lola: processed formula length: 114
lola: 2 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 43463 markings, 150192 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55) OR ((3 <= p0) AND (2 <= p53))) AND ((1 <= p54) OR (p53 + 1 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43 + p44 + p45)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to AirplaneLD-COL-0010-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file AirplaneLD-COL-0010-CTLCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (E (G (((1 <= p53) OR (3 <= p52))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U ((p53 <= 0) AND (p52 <= 2)))))
lola: processed formula length: 52
lola: 4 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 43439 markings, 52585 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p54 + 1 <= p35) OR (p47 + 1 <= p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88) OR (1 <= p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88))))
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 216 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to AirplaneLD-COL-0010-CTLCardinality-11.sara
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (G (((p47 <= p34) OR (p48 + p49 <= p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88))))) OR ((1 <= p75 + p76) OR (p77 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p34 + 1 <= p47) AND (p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 + 1 <= p48 + p49))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AirplaneLD-COL-0010-CTLCardinality-12.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 9 markings, 8 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= p75 + p76) OR (p77 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p75 + p76) OR (p77 <= p0))
lola: processed formula length: 34
lola: 3 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
sara: try reading problem file AirplaneLD-COL-0010-CTLCardinality-12.sara.
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: ...considering subproblem: NOT(E (F (((p52 <= p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33) AND (2 <= p1) AND ((p78 <= p23 + p22) OR (p52 <= p35))))))
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 216 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p54) AND (p47 <= p54))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(((1 <= p54) AND (p47 <= p54))))
lola: processed formula length: 43
lola: 2 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: 8 markings, 7 edges
lola: ========================================
lola: subprocess 15 will run for 3538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (G ((2 <= p78))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p78 <= 1)))))
lola: processed formula length: 40
lola: 5 rewrites
lola: formula mentions 0 of 89 places; total mentions: 0
lola: closed formula file AirplaneLD-COL-0010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 216 bytes per marking, with 0 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: 11 markings, 21 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes yes no no yes no no no yes no yes yes yes
FORMULA AirplaneLD-COL-0010-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AirplaneLD-COL-0010-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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="AirplaneLD-COL-0010"
export BK_EXAMINATION="CTLCardinality"
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/AirplaneLD-COL-0010.tgz
mv AirplaneLD-COL-0010 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 AirplaneLD-COL-0010, 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 r011-qhx2-152646141400010"
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 '
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 ;