fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r238-blw3-152732478300139
Last Updated
June 26, 2018

About the Execution of M4M.full for EnergyBus-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
546.120 573258.00 537579.00 435.80 F?FTTTFFFTFFFFFF 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 3.3M
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.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:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.2M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is EnergyBus-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r238-blw3-152732478300139
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1528028493092


BK_STOP 1528029066350

--------------------
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 EnergyBus-PT-none as instance name.
Using EnergyBus 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': 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': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 78511, 'Memory': 1973.82, 'Tool': 'itstools'}, {'Time': 79033, 'Memory': 1959.55, 'Tool': 'itstools'}, {'Time': 721196, 'Memory': 7601.84, 'Tool': 'lola'}, {'Time': 721403, 'Memory': 7730.54, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 9.185922991682695x far from the best tool itstools.
LTLCardinality lola EnergyBus-PT-none...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
EnergyBus-PT-none: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
EnergyBus-PT-none: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ EnergyBus-PT-none @ 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: 4587/65536 symbol table entries, 981 collisions
lola: preprocessing...
lola: finding significant places
lola: 157 places, 4430 transitions, 134 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1049 transition conflict sets
lola: TASK
lola: reading formula from EnergyBus-PT-none-LTLCardinality.task
lola: A (X ((2 <= p15))) : A (G ((p144 <= p19))) : A (F ((F ((1 <= p73)) U F ((2 <= p2))))) : A (F ((G ((2 <= p22)) U F ((p28 <= p21))))) : A ((F (G ((p49 <= p84))) U ((p95 <= p46) U (p149 <= p59)))) : A (F (X (((p105 <= p46) U (p34 <= p49))))) : A (G (G ((2 <= p35)))) : A (F (F (G ((p131 <= p125))))) : A (G (F (((3 <= p107) U (2 <= p10))))) : A (F (F (((p63 <= p12) U (p97 <= p27))))) : A (F ((G ((p127 <= p81)) U G ((p88 <= p62))))) : A ((3 <= p110)) : A ((2 <= p101)) : A ((1 <= p101)) : A (X (F (G ((2 <= p111))))) : A (X (F (X ((2 <= p18)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= p15)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((2 <= p15)))
lola: processed formula: A (X ((2 <= p15)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p144 <= p19)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 26 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: 4716 markings, 7041 edges, 943 markings/sec, 0 secs
lola: 8633 markings, 13556 edges, 783 markings/sec, 5 secs
lola: 11786 markings, 19152 edges, 631 markings/sec, 10 secs
lola: 15707 markings, 25488 edges, 784 markings/sec, 15 secs
lola: 19296 markings, 31546 edges, 718 markings/sec, 20 secs
lola: 22584 markings, 37412 edges, 658 markings/sec, 25 secs
lola: 26261 markings, 43701 edges, 735 markings/sec, 30 secs
lola: 29241 markings, 49450 edges, 596 markings/sec, 35 secs
lola: 32678 markings, 55839 edges, 687 markings/sec, 40 secs
lola: 35386 markings, 61666 edges, 542 markings/sec, 45 secs
lola: 37587 markings, 66639 edges, 440 markings/sec, 50 secs
lola: 39956 markings, 71861 edges, 474 markings/sec, 55 secs
lola: 43428 markings, 77877 edges, 694 markings/sec, 60 secs
lola: 46491 markings, 83468 edges, 613 markings/sec, 65 secs
lola: 49354 markings, 89100 edges, 573 markings/sec, 70 secs
lola: 51953 markings, 94455 edges, 520 markings/sec, 75 secs
lola: 55183 markings, 100642 edges, 646 markings/sec, 80 secs
lola: 58108 markings, 106612 edges, 585 markings/sec, 85 secs
lola: 61266 markings, 112701 edges, 632 markings/sec, 90 secs
lola: 63351 markings, 118109 edges, 417 markings/sec, 95 secs
lola: 65825 markings, 123259 edges, 495 markings/sec, 100 secs
lola: 68393 markings, 128858 edges, 514 markings/sec, 105 secs
lola: 70817 markings, 133985 edges, 485 markings/sec, 110 secs
lola: 73743 markings, 139347 edges, 585 markings/sec, 115 secs
lola: 76891 markings, 145063 edges, 630 markings/sec, 120 secs
lola: 80057 markings, 151080 edges, 633 markings/sec, 125 secs
lola: 82807 markings, 156825 edges, 550 markings/sec, 130 secs
lola: 85511 markings, 162865 edges, 541 markings/sec, 135 secs
lola: 88110 markings, 168382 edges, 520 markings/sec, 140 secs
lola: 90991 markings, 174489 edges, 576 markings/sec, 145 secs
lola: 93982 markings, 180413 edges, 598 markings/sec, 150 secs
lola: 98297 markings, 187511 edges, 863 markings/sec, 155 secs
lola: 102067 markings, 193729 edges, 754 markings/sec, 160 secs
lola: 106223 markings, 200335 edges, 831 markings/sec, 165 secs
lola: 109561 markings, 206032 edges, 668 markings/sec, 170 secs
lola: 112945 markings, 212236 edges, 677 markings/sec, 175 secs
lola: 116197 markings, 218414 edges, 650 markings/sec, 180 secs
lola: 119082 markings, 224056 edges, 577 markings/sec, 185 secs
lola: 121227 markings, 229191 edges, 429 markings/sec, 190 secs
lola: 124533 markings, 235136 edges, 661 markings/sec, 195 secs
lola: 127721 markings, 241136 edges, 638 markings/sec, 200 secs
lola: 130776 markings, 246362 edges, 611 markings/sec, 205 secs
lola: 133345 markings, 251276 edges, 514 markings/sec, 210 secs
lola: 136462 markings, 257420 edges, 623 markings/sec, 215 secs
lola: 139061 markings, 262573 edges, 520 markings/sec, 220 secs
lola: 141737 markings, 268029 edges, 535 markings/sec, 225 secs
lola: 145457 markings, 274700 edges, 744 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((1 <= p73)) U F ((2 <= p2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((1 <= p73)) U F ((2 <= p2)))))
lola: processed formula: A (F ((F ((1 <= p73)) U F ((2 <= p2)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 25 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, 16 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((2 <= p22)) U F ((p28 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((2 <= p22)) U F ((p28 <= p21)))))
lola: processed formula: A (F ((G ((2 <= p22)) U F ((p28 <= p21)))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 25 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 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((p49 <= p84))) U ((p95 <= p46) U (p149 <= p59))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (G ((p49 <= p84))) U ((p95 <= p46) U (p149 <= p59))))
lola: processed formula: A ((F (G ((p49 <= p84))) U ((p95 <= p46) U (p149 <= p59))))
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 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: 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 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((p105 <= p46) U (p34 <= p49)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (((p105 <= p46) U (p34 <= p49)))))
lola: processed formula: A (F (X (((p105 <= p46) U (p34 <= p49)))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G ((2 <= p35))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G ((2 <= p35))))
lola: processed formula: A (G (G ((2 <= p35))))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G ((p131 <= p125)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((p131 <= p125))))
lola: processed formula: A (F (G ((p131 <= p125))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 14205 markings, 28231 edges, 2841 markings/sec, 0 secs
lola: 28179 markings, 55961 edges, 2795 markings/sec, 5 secs
lola: 42643 markings, 84671 edges, 2893 markings/sec, 10 secs
lola: 58093 markings, 115344 edges, 3090 markings/sec, 15 secs
lola: 74386 markings, 147561 edges, 3259 markings/sec, 20 secs
lola: 89353 markings, 177354 edges, 2993 markings/sec, 25 secs
lola: 104495 markings, 207105 edges, 3028 markings/sec, 30 secs
lola: 124172 markings, 245962 edges, 3935 markings/sec, 35 secs
lola: 143681 markings, 283996 edges, 3902 markings/sec, 40 secs
lola: 162085 markings, 320491 edges, 3681 markings/sec, 45 secs
lola: 179454 markings, 354762 edges, 3474 markings/sec, 50 secs
lola: 200450 markings, 396922 edges, 4199 markings/sec, 55 secs
lola: 220054 markings, 435724 edges, 3921 markings/sec, 60 secs
lola: 240785 markings, 476899 edges, 4146 markings/sec, 65 secs
lola: 256820 markings, 508711 edges, 3207 markings/sec, 70 secs
lola: 272084 markings, 539068 edges, 3053 markings/sec, 75 secs
lola: 292715 markings, 580797 edges, 4126 markings/sec, 80 secs
lola: 310322 markings, 615690 edges, 3521 markings/sec, 85 secs
lola: 327878 markings, 650652 edges, 3511 markings/sec, 90 secs
lola: 350874 markings, 696496 edges, 4599 markings/sec, 95 secs
lola: 369505 markings, 733845 edges, 3726 markings/sec, 100 secs
lola: 393738 markings, 782445 edges, 4847 markings/sec, 105 secs
lola: 412119 markings, 818974 edges, 3676 markings/sec, 110 secs
lola: 433928 markings, 862498 edges, 4362 markings/sec, 115 secs
lola: 456689 markings, 908362 edges, 4552 markings/sec, 120 secs
lola: 477409 markings, 950278 edges, 4144 markings/sec, 125 secs
lola: 496515 markings, 988717 edges, 3821 markings/sec, 130 secs
lola: 513636 markings, 1022632 edges, 3424 markings/sec, 135 secs
lola: 531349 markings, 1057764 edges, 3543 markings/sec, 140 secs
lola: 547530 markings, 1090159 edges, 3236 markings/sec, 145 secs
lola: 566804 markings, 1128826 edges, 3855 markings/sec, 150 secs
lola: 584209 markings, 1163837 edges, 3481 markings/sec, 155 secs
lola: 599137 markings, 1193737 edges, 2986 markings/sec, 160 secs
lola: 604946 markings, 1205471 edges, 1162 markings/sec, 165 secs
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: 607285 markings, 1210355 edges
lola: ========================================
lola: subprocess 8 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((3 <= p107) U (2 <= p10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (((3 <= p107) U (2 <= p10)))))
lola: processed formula: A (G (F (((3 <= p107) U (2 <= p10)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 9 will run for 447 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((p63 <= p12) U (p97 <= p27)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p63 <= p12) U (p97 <= p27))))
lola: processed formula: A (F (((p63 <= p12) U (p97 <= p27))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 25 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 10 will run for 521 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((p127 <= p81)) U G ((p88 <= p62)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((p127 <= p81)) U G ((p88 <= p62)))))
lola: processed formula: A (F ((G ((p127 <= p81)) U G ((p88 <= p62)))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 4022 markings, 8735 edges, 804 markings/sec, 0 secs
lola: 7704 markings, 17070 edges, 736 markings/sec, 5 secs
lola: 15291 markings, 32204 edges, 1517 markings/sec, 10 secs
lola: 18740 markings, 40308 edges, 690 markings/sec, 15 secs
lola: 22644 markings, 49127 edges, 781 markings/sec, 20 secs
lola: 27132 markings, 58517 edges, 898 markings/sec, 25 secs
lola: 33201 markings, 71127 edges, 1214 markings/sec, 30 secs
lola: 36610 markings, 78930 edges, 682 markings/sec, 35 secs
lola: 41539 markings, 89132 edges, 986 markings/sec, 40 secs
lola: 45833 markings, 98248 edges, 859 markings/sec, 45 secs
lola: 52069 markings, 111139 edges, 1247 markings/sec, 50 secs
lola: 57633 markings, 122940 edges, 1113 markings/sec, 55 secs
lola: 63911 markings, 136201 edges, 1256 markings/sec, 60 secs
lola: 69056 markings, 146990 edges, 1029 markings/sec, 65 secs
lola: 74111 markings, 157844 edges, 1011 markings/sec, 70 secs
lola: 77364 markings, 165561 edges, 651 markings/sec, 75 secs
lola: 83912 markings, 179342 edges, 1310 markings/sec, 80 secs
lola: 90187 markings, 192605 edges, 1255 markings/sec, 85 secs
lola: 96158 markings, 205712 edges, 1194 markings/sec, 90 secs
lola: 102371 markings, 218711 edges, 1243 markings/sec, 95 secs
lola: 108220 markings, 230437 edges, 1170 markings/sec, 100 secs
lola: 113122 markings, 241321 edges, 980 markings/sec, 105 secs
lola: 117373 markings, 250591 edges, 850 markings/sec, 110 secs
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: 123657 markings, 263668 edges
lola: ========================================
lola: subprocess 11 will run for 602 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p110))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p110)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-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 752 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p101))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p101)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-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 13 will run for 1003 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p101))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p101)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-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 14 will run for 1505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G ((2 <= p111)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G ((2 <= p111)))))
lola: processed formula: A (X (F (G ((2 <= p111)))))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: 7 markings, 8 edges
lola: ========================================
lola: subprocess 15 will run for 3010 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X ((2 <= p18)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (X ((2 <= p18)))))
lola: processed formula: A (X (F (X ((2 <= p18)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 157 places; total mentions: 0
lola: closed formula file EnergyBus-PT-none-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 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: 6 markings, 6 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no yes yes yes no no no yes no no no no no no
FORMULA EnergyBus-PT-none-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA EnergyBus-PT-none-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EnergyBus-PT-none"
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/EnergyBus-PT-none.tgz
mv EnergyBus-PT-none 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 EnergyBus-PT-none, 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 r238-blw3-152732478300139"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;