About the Execution of M4M.full for DNAwalker-PT-17redondantChoiceL
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1597.630 | 439372.00 | 399510.00 | 1875.80 | FFFTFFF?FTFFFTFF | 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 380K
-rw-r--r-- 1 mcc users 3.6K 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.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.9K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 122 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 360 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K 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.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 19 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 211K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is DNAwalker-PT-17redondantChoiceL, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r214-smll-152732265300259
=====================================================================
--------------------
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 DNAwalker-PT-17redondantChoiceL-LTLCardinality-00
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-01
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-02
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-03
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-04
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-05
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-06
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-07
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-08
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-09
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-10
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-11
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-12
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-13
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-14
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527449531098
BK_STOP 1527449970470
--------------------
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 DNAwalker-PT-17redondantChoiceL as instance name.
Using DNAwalker as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': None, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 869408, 'Memory': 15951.41, 'Tool': 'lola'}, {'Time': 874481, 'Memory': 15947.69, 'Tool': 'lola'}, {'Time': 3507858, 'Memory': 11484.22, 'Tool': 'itstools'}, {'Time': 3508080, 'Memory': 11521.44, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola DNAwalker-PT-17redondantChoiceL...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
DNAwalker-PT-17redondantChoiceL: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
DNAwalker-PT-17redondantChoiceL: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ DNAwalker-PT-17redondantChoiceL @ 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: 533/65536 symbol table entries, 8 collisions
lola: preprocessing...
lola: finding significant places
lola: 43 places, 490 transitions, 43 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 284 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: A (X (X ((A24 <= A26)))) : A (F ((3 <= A31))) : A (F (G (X ((1 <= A11))))) : A (((A23 <= B21) U F (F ((B18 <= A28))))) : A (X ((3 <= A12))) : A (X (((B9 <= A5) U X ((3 <= A5))))) : A (X (X (F (F ((A6 <= A26)))))) : A (G (G (((A24 <= A11) U (B18 <= A31))))) : A (F (G ((A19 <= B19)))) : A ((1 <= A14)) : A (G (F (X (X ((1 <= A8)))))) : A ((1 <= A21)) : A (G (X (((3 <= A27) U (2 <= A8))))) : A ((A8 <= A12)) : A ((X ((A20 <= A29)) U X (G ((A32 <= A22))))) : A (F (G ((1 <= A7))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((A24 <= A26))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X ((A24 <= A26))))
lola: processed formula: A (X (X ((A24 <= A26))))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 24 markings, 24 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= A31)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= A31)))
lola: processed formula: A (F ((3 <= A31)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 31 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X ((1 <= A11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X ((1 <= A11)))))
lola: processed formula: A (F (G (X ((1 <= A11)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 69 markings, 96 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((A23 <= B21) U F (F ((B18 <= A28)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((A23 <= B21) U F ((B18 <= A28))))
lola: processed formula: A (((A23 <= B21) U F ((B18 <= A28))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 31 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= A12)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((3 <= A12)))
lola: processed formula: A (X ((3 <= A12)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 15 markings, 15 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((B9 <= A5) U X ((3 <= A5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((B9 <= A5) U X ((3 <= A5)))))
lola: processed formula: A (X (((B9 <= A5) U X ((3 <= A5)))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 15 markings, 15 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (F ((A6 <= A26))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (F ((A6 <= A26)))))
lola: processed formula: A (X (X (F ((A6 <= A26)))))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (((A24 <= A11) U (B18 <= A31)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (((A24 <= A11) U (B18 <= A31)))))
lola: processed formula: A (G (G (((A24 <= A11) U (B18 <= A31)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 114970 markings, 284730 edges, 22994 markings/sec, 0 secs
lola: 239107 markings, 592715 edges, 24827 markings/sec, 5 secs
lola: 358604 markings, 909425 edges, 23899 markings/sec, 10 secs
lola: 472029 markings, 1239996 edges, 22685 markings/sec, 15 secs
lola: 576200 markings, 1557910 edges, 20834 markings/sec, 20 secs
lola: 680726 markings, 1877000 edges, 20905 markings/sec, 25 secs
lola: 781472 markings, 2189934 edges, 20149 markings/sec, 30 secs
lola: 888745 markings, 2496619 edges, 21455 markings/sec, 35 secs
lola: 997089 markings, 2800837 edges, 21669 markings/sec, 40 secs
lola: 1086788 markings, 3125054 edges, 17940 markings/sec, 45 secs
lola: 1168486 markings, 3413271 edges, 16340 markings/sec, 50 secs
lola: 1253074 markings, 3709209 edges, 16918 markings/sec, 55 secs
lola: 1338614 markings, 4011828 edges, 17108 markings/sec, 60 secs
lola: 1423445 markings, 4323233 edges, 16966 markings/sec, 65 secs
lola: 1506597 markings, 4651563 edges, 16630 markings/sec, 70 secs
lola: 1600112 markings, 4994319 edges, 18703 markings/sec, 75 secs
lola: 1681991 markings, 5317688 edges, 16376 markings/sec, 80 secs
lola: 1768021 markings, 5652217 edges, 17206 markings/sec, 85 secs
lola: 1849737 markings, 5968734 edges, 16343 markings/sec, 90 secs
lola: 1930552 markings, 6296344 edges, 16163 markings/sec, 95 secs
lola: 2009637 markings, 6607937 edges, 15817 markings/sec, 100 secs
lola: 2086965 markings, 6930866 edges, 15466 markings/sec, 105 secs
lola: 2175626 markings, 7259140 edges, 17732 markings/sec, 110 secs
lola: 2289768 markings, 7580858 edges, 22828 markings/sec, 115 secs
lola: 2396588 markings, 7918993 edges, 21364 markings/sec, 120 secs
lola: 2495917 markings, 8251166 edges, 19866 markings/sec, 125 secs
lola: 2592531 markings, 8588113 edges, 19323 markings/sec, 130 secs
lola: 2690762 markings, 8917910 edges, 19646 markings/sec, 135 secs
lola: 2793354 markings, 9240598 edges, 20518 markings/sec, 140 secs
lola: 2893620 markings, 9558691 edges, 20053 markings/sec, 145 secs
lola: 2992456 markings, 9875326 edges, 19767 markings/sec, 150 secs
lola: 3084610 markings, 10197707 edges, 18431 markings/sec, 155 secs
lola: 3174327 markings, 10518749 edges, 17943 markings/sec, 160 secs
lola: 3261082 markings, 10847500 edges, 17351 markings/sec, 165 secs
lola: 3342461 markings, 11210394 edges, 16276 markings/sec, 170 secs
lola: 3421895 markings, 11511613 edges, 15887 markings/sec, 175 secs
lola: 3500782 markings, 11822529 edges, 15777 markings/sec, 180 secs
lola: 3581096 markings, 12170901 edges, 16063 markings/sec, 185 secs
lola: 3664021 markings, 12497726 edges, 16585 markings/sec, 190 secs
lola: 3749325 markings, 12819158 edges, 17061 markings/sec, 195 secs
lola: 3832265 markings, 13139449 edges, 16588 markings/sec, 200 secs
lola: 3915769 markings, 13459185 edges, 16701 markings/sec, 205 secs
lola: 3996731 markings, 13783689 edges, 16192 markings/sec, 210 secs
lola: 4082603 markings, 14107315 edges, 17174 markings/sec, 215 secs
lola: 4165424 markings, 14431892 edges, 16564 markings/sec, 220 secs
lola: 4247722 markings, 14758676 edges, 16460 markings/sec, 225 secs
lola: 4328616 markings, 15109543 edges, 16179 markings/sec, 230 secs
lola: 4413041 markings, 15431801 edges, 16885 markings/sec, 235 secs
lola: 4491159 markings, 15747252 edges, 15624 markings/sec, 240 secs
lola: 4580111 markings, 16089961 edges, 17790 markings/sec, 245 secs
lola: 4657370 markings, 16402423 edges, 15452 markings/sec, 250 secs
lola: 4735328 markings, 16718475 edges, 15592 markings/sec, 255 secs
lola: 4817090 markings, 17034487 edges, 16352 markings/sec, 260 secs
lola: 4893973 markings, 17351234 edges, 15377 markings/sec, 265 secs
lola: 4970683 markings, 17663589 edges, 15342 markings/sec, 270 secs
lola: 5044484 markings, 17970759 edges, 14760 markings/sec, 275 secs
lola: 5128555 markings, 18293665 edges, 16814 markings/sec, 280 secs
lola: 5211434 markings, 18607417 edges, 16576 markings/sec, 285 secs
lola: 5291825 markings, 18912498 edges, 16078 markings/sec, 290 secs
lola: 5374122 markings, 19224466 edges, 16459 markings/sec, 295 secs
lola: 5453775 markings, 19528872 edges, 15931 markings/sec, 300 secs
lola: 5534601 markings, 19850024 edges, 16165 markings/sec, 305 secs
lola: 5615222 markings, 20148499 edges, 16124 markings/sec, 310 secs
lola: 5695884 markings, 20463301 edges, 16132 markings/sec, 315 secs
lola: 5776141 markings, 20766985 edges, 16051 markings/sec, 320 secs
lola: 5851661 markings, 21065171 edges, 15104 markings/sec, 325 secs
lola: 5937126 markings, 21391055 edges, 17093 markings/sec, 330 secs
lola: 6021264 markings, 21699314 edges, 16828 markings/sec, 335 secs
lola: 6103637 markings, 22007075 edges, 16475 markings/sec, 340 secs
lola: 6192866 markings, 22301926 edges, 17846 markings/sec, 345 secs
lola: 6274560 markings, 22644914 edges, 16339 markings/sec, 350 secs
lola: 6358126 markings, 22998760 edges, 16713 markings/sec, 355 secs
lola: 6439200 markings, 23355515 edges, 16215 markings/sec, 360 secs
lola: 6520400 markings, 23718632 edges, 16240 markings/sec, 365 secs
lola: 6602001 markings, 24088115 edges, 16320 markings/sec, 370 secs
lola: 6682162 markings, 24453020 edges, 16032 markings/sec, 375 secs
lola: 6762698 markings, 24800852 edges, 16107 markings/sec, 380 secs
lola: 6843647 markings, 25109719 edges, 16190 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((A19 <= B19))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((A19 <= B19))))
lola: processed formula: A (F (G ((A19 <= B19))))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 16 markings, 17 edges
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= A14))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= A14)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (X (X ((1 <= A8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (X (X ((1 <= A8))))))
lola: processed formula: A (G (F (X (X ((1 <= A8))))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 47 markings, 47 edges
lola: ========================================
lola: subprocess 11 will run for 629 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= A21))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= A21)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 786 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (((3 <= A27) U (2 <= A8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (((3 <= A27) U (2 <= A8)))))
lola: processed formula: A (G (X (((3 <= A27) U (2 <= A8)))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 15 markings, 15 edges
lola: ========================================
lola: subprocess 13 will run for 1049 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A8 <= A12))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (A8 <= A12)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((A20 <= A29)) U X (G ((A32 <= A22)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((A20 <= A29) U G ((A32 <= A22)))))
lola: processed formula: A (X (((A20 <= A29) U G ((A32 <= A22)))))
lola: processed formula length: 41
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 16 markings, 17 edges
lola: ========================================
lola: subprocess 15 will run for 3147 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= A7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((1 <= A7))))
lola: processed formula: A (F (G ((1 <= A7))))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17 markings, 18 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no no unknown no yes no no no yes no no
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-15 FALSE 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="DNAwalker-PT-17redondantChoiceL"
export BK_EXAMINATION="LTLCardinality"
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/DNAwalker-PT-17redondantChoiceL.tgz
mv DNAwalker-PT-17redondantChoiceL 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 DNAwalker-PT-17redondantChoiceL, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r214-smll-152732265300259"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;