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.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 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 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 26K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is AutoFlight-PT-01b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r022-qhx1-152646247200059
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526888071176


BK_STOP 1526888336844

--------------------
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 AutoFlight-PT-01b as instance name.
Using AutoFlight as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, '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': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 18440, 'Memory': 2351.3, 'Tool': 'marcie'}, {'Time': 19265, 'Memory': 2351.31, 'Tool': 'marcie'}, {'Time': 48450, 'Memory': 1053.04, 'Tool': 'gspn'}, {'Time': 48522, 'Memory': 1080.89, 'Tool': 'gspn'}, {'Time': 82305, 'Memory': 745.89, 'Tool': 'lola'}, {'Time': 82578, 'Memory': 762.17, 'Tool': 'lola'}, {'Time': 553276, 'Memory': 3856.27, 'Tool': 'itstools'}, {'Time': 706514, 'Memory': 3876.12, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 4.4633947939262475x far from the best tool marcie.
CTLCardinality lola AutoFlight-PT-01b...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
AutoFlight-PT-01b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
AutoFlight-PT-01b: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ AutoFlight-PT-01b @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 226/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 114 places, 112 transitions, 104 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 131 transition conflict sets
lola: TASK
lola: reading formula from AutoFlight-PT-01b-CTLCardinality.task
lola: E ((((2 <= p54) OR ((p5 <= p69) AND (1 <= p24))) U E (F ((3 <= p86))))) : (E (G (E (F ((1 <= p90))))) AND E (((p82 <= p36) U ((p27 <= p33) OR (p75 <= p92))))) : ((A (((p26 <= p44) U (p111 <= p65))) OR (((p79 <= p73) AND (3 <= p2) AND (p99 <= p46)) OR (1 <= p54))) AND (A (X ((p2 <= 2))) AND E (((p14 <= p49) U (3 <= p8))))) : E (F (NOT(A (X ((p8 <= p99)))))) : E ((((p21 <= p60) OR (3 <= p16) OR (p26 + 1 <= p73)) U ((3 <= p93) AND (p80 <= p14) AND (p20 <= p9) AND (p22 <= p109)))) : A (F (((p55 <= p68) AND E (X ((1 <= p14)))))) : E (G (E (G ((p84 <= 1))))) : A (G ((E (F ((p8 <= p98))) AND E (F ((3 <= p61)))))) : E ((E (X ((p27 <= p83))) U (p35 + 1 <= p67))) : A ((A (X ((p61 <= p93))) U A (G ((3 <= p66))))) : A (G (A (F ((p20 <= 1))))) : NOT(A (F (A (G ((p83 <= p11)))))) : (A (F ((1 <= p20))) OR A ((((p90 <= p25) AND (2 <= p83)) U ((1 <= p104) OR (3 <= p84))))) : A (F ((2 <= p70))) : ((A (G ((p74 <= p106))) AND (A (F ((1 <= p19))) OR A (X ((2 <= p102))))) AND (A (F (((p52 <= p93) AND (1 <= p7)))) OR E (((2 <= p52) U (1 <= p113))))) : NOT((NOT(A (F ((1 <= p62)))) AND (p94 <= 2)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((2 <= p54) OR ((p5 <= p69) AND (1 <= p24))) U E (F ((3 <= p86)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((2 <= p54) OR ((p5 <= p69) AND (1 <= p24))) U E(TRUE U (3 <= p86)))
lola: processed formula length: 71
lola: 2 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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: 638025 markings, 2937040 edges, 2704960232538243072 markings/sec, 0 secs
lola: 1169376 markings, 5774859 edges, 106270 markings/sec, 5 secs
lola: 1634193 markings, 8297096 edges, 92963 markings/sec, 10 secs
lola: 2092392 markings, 10859641 edges, 91640 markings/sec, 15 secs
lola: 2499008 markings, 13304353 edges, 81323 markings/sec, 20 secs
lola: 2899949 markings, 15724219 edges, 80188 markings/sec, 25 secs
lola: 3278946 markings, 18159209 edges, 75799 markings/sec, 30 secs
lola: 3660225 markings, 20614583 edges, 76256 markings/sec, 35 secs
lola: 4026558 markings, 23025119 edges, 73267 markings/sec, 40 secs
lola: 4374900 markings, 25479470 edges, 69668 markings/sec, 45 secs
lola: 4747137 markings, 27964808 edges, 74447 markings/sec, 50 secs
lola: 5099326 markings, 30498677 edges, 70438 markings/sec, 55 secs
lola: 5443848 markings, 33045340 edges, 68904 markings/sec, 60 secs
lola: 5932673 markings, 35861744 edges, 97765 markings/sec, 65 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5976454 markings, 36142787 edges
lola: ========================================
lola: subprocess 1 will run for 231 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((1 <= p90))))) AND E (((p82 <= p36) U ((p27 <= p33) OR (p75 <= p92)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 231 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((1 <= p90)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (1 <= p90)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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: 72 markings, 209 edges
lola: ========================================
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p82 <= p36) U ((p27 <= p33) OR (p75 <= p92))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p82 <= p36) U ((p27 <= p33) OR (p75 <= p92)))
lola: processed formula length: 49
lola: 1 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((p26 <= p44) U (p111 <= p65))) OR (((p79 <= p73) AND (3 <= p2) AND (p99 <= p46)) OR (1 <= p54))) AND (A (X ((p2 <= 2))) AND E (((p14 <= p49) U (3 <= p8)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 247 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p26 <= p44) U (p111 <= p65)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p26 <= p44) U (p111 <= p65)))
lola: processed formula: A (((p26 <= p44) U (p111 <= p65)))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 266 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p2 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p2 <= 2)))
lola: processed formula: A (X ((p2 <= 2)))
lola: processed formula length: 17
lola: 0 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 22 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p14 <= p49) U (3 <= p8)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p14 <= p49) U (3 <= p8))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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: 659987 markings, 3198889 edges, 3224907736441421824 markings/sec, 0 secs
lola: 1203927 markings, 6213791 edges, 108788 markings/sec, 5 secs
lola: 1683932 markings, 9130663 edges, 96001 markings/sec, 10 secs
lola: 2126672 markings, 12041077 edges, 88548 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2163655 markings, 12196158 edges
lola: SUBRESULT
lola: lola: ========================================result: no

lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 265 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(A (X ((p8 <= p99))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((p99 + 1 <= p8)))
lola: processed formula length: 29
lola: 5 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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: 44 markings, 43 edges
lola: ========================================
lola: subprocess 4 will run for 287 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p21 <= p60) OR (3 <= p16) OR (p26 + 1 <= p73)) U ((3 <= p93) AND (p80 <= p14) AND (p20 <= p9) AND (p22 <= p109))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p21 <= p60) OR (3 <= p16) OR (p26 + 1 <= p73)) U ((3 <= p93) AND (p80 <= p14) AND (p20 <= p9) AND (p22 <= p109)))
lola: processed formula length: 119
lola: 1 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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: 720919 markings, 3281730 edges, 3192803921055711232 markings/sec, 0 secs
lola: 1336794 markings, 6417654 edges, 123175 markings/sec, 5 secs
lola: 1907864 markings, 9310462 edges, 114214 markings/sec, 10 secs
lola: 2420596 markings, 12095135 edges, 102546 markings/sec, 15 secs
lola: 2903328 markings, 14953622 edges, 96546 markings/sec, 20 secs
lola: 3316572 markings, 17532529 edges, 82649 markings/sec, 25 secs
lola: 3712510 markings, 19988532 edges, 79188 markings/sec, 30 secs
lola: 4245248 markings, 22875637 edges, 106548 markings/sec, 35 secs
lola: 4647653 markings, 25546577 edges, 80481 markings/sec, 40 secs
lola: 5046648 markings, 28193606 edges, 79799 markings/sec, 45 secs
lola: 5492326 markings, 30765563 edges, 89136 markings/sec, 50 secs
lola: 5926573 markings, 33295624 edges, 86849 markings/sec, 55 secs
lola: 6337477 markings, 35890481 edges, 82181 markings/sec, 60 secs
lola: 6749193 markings, 38252365 edges, 82343 markings/sec, 65 secs
lola: 7159711 markings, 40666861 edges, 82104 markings/sec, 70 secs
lola: 7569222 markings, 43044033 edges, 81902 markings/sec, 75 secs
lola: 7968019 markings, 45960594 edges, 79759 markings/sec, 80 secs
lola: 8333620 markings, 48663769 edges, 73120 markings/sec, 85 secs
lola: 8690332 markings, 51246758 edges, 71342 markings/sec, 90 secs
lola: 9023098 markings, 53758562 edges, 66553 markings/sec, 95 secs
lola: 9347497 markings, 56089978 edges, 64880 markings/sec, 100 secs
lola: 9655530 markings, 58441869 edges, 61607 markings/sec, 105 secs
lola: 10031650 markings, 60544436 edges, 75224 markings/sec, 110 secs
lola: 10378773 markings, 62573694 edges, 69425 markings/sec, 115 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 10548400 markings, 63538977 edges
lola: ========================================
lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p55 <= p68) AND E (X ((1 <= p14))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((p55 <= p68) AND EX((1 <= p14))))
lola: processed formula length: 43
lola: 2 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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: 60 markings, 59 edges
lola: ========================================
lola: subprocess 6 will run for 332 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G ((p84 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (2 <= p84))))
lola: processed formula length: 35
lola: 4 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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: 97 markings, 291 edges
lola: ========================================
lola: subprocess 7 will run for 369 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((p8 <= p98))) AND E (F ((3 <= p61))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 369 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p8 <= p98)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (p8 <= p98)))))
lola: processed formula length: 41
lola: 3 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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: 22530 markings, 79192 edges
lola: ========================================
lola: subprocess 8 will run for 415 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((3 <= p61)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (3 <= p61)))))
lola: processed formula length: 40
lola: 3 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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: 59919 markings, 184670 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 415 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((p27 <= p83))) U (p35 + 1 <= p67)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX((p27 <= p83)) U (p35 + 1 <= p67))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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: 788 markings, 1939 edges
lola: ========================================
lola: subprocess 9 will run for 475 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (X ((p61 <= p93))) U A (G ((3 <= p66)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(AX((p61 <= p93)) U NOT(E(TRUE U (p66 <= 2))))
lola: processed formula length: 47
lola: 4 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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 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: 60 markings, 119 edges
lola: ========================================
lola: subprocess 10 will run for 554 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p20 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (p20 <= 1)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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: 18550 markings, 65568 edges
lola: ========================================
lola: subprocess 11 will run for 665 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (G ((p83 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p11 + 1 <= p83)))))
lola: processed formula length: 46
lola: 7 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 24 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: 112 markings, 303 edges
lola: ========================================
lola: subprocess 12 will run for 831 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((1 <= p20))) OR A ((((p90 <= p25) AND (2 <= p83)) U ((1 <= p104) OR (3 <= p84)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 831 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p20)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= p20)))
lola: processed formula: A (F ((1 <= p20)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 23 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: 61 markings, 61 edges
lola: ========================================
lola: subprocess 13 will run for 1108 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p90 <= p25) AND (2 <= p83)) U ((1 <= p104) OR (3 <= p84))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p90 <= p25) AND (2 <= p83)) U ((1 <= p104) OR (3 <= p84))))
lola: processed formula: A ((((p90 <= p25) AND (2 <= p83)) U ((1 <= p104) OR (3 <= p84))))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 22 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: 59 markings, 59 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 1108 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p70)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p70)))
lola: processed formula: A (F ((2 <= p70)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 23 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: 60 markings, 60 edges
lola: ========================================
lola: subprocess 14 will run for 1662 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G ((p74 <= p106))) AND (A (F ((1 <= p19))) OR A (X ((2 <= p102))))) AND (A (F (((p52 <= p93) AND (1 <= p7)))) OR E (((2 <= p52) U (1 <= p113)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1662 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p74 <= p106)))
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 16 bytes per marking, with 24 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: The predicate is not invariant.
lola: 29 markings, 28 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((NOT(A (F ((1 <= p62)))) AND (p94 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p62)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= p62)))
lola: processed formula: A (F ((1 <= p62)))
lola: processed formula length: 18
lola: 8 rewrites
lola: formula mentions 0 of 114 places; total mentions: 0
lola: closed formula file AutoFlight-PT-01b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 23 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: 171 markings, 198 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes no no yes no yes no yes yes no no no unknown
FORMULA AutoFlight-PT-01b-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-01b-CTLCardinality-15 CANNOT_COMPUTE 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="AutoFlight-PT-01b"
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/AutoFlight-PT-01b.tgz
mv AutoFlight-PT-01b 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 AutoFlight-PT-01b, 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 r022-qhx1-152646247200059"
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 ;