fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r215-smll-152732266400159
Last Updated
June 26, 2018

About the Execution of M4M.struct for DES-PT-60a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5532.770 488441.00 448886.00 2675.70 TFFFFFFT?FFFFFTF 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 276K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K 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 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K 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 13K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.8K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 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 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 110K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is DES-PT-60a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-smll-152732266400159
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527436852668


BK_STOP 1527437341109

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DES-PT-60a as instance name.
Using DES 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': None, 'Source Transition': False, 'Sink Transition': None, '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': 598619, 'Memory': 2291.98, 'Tool': 'lola'}, {'Time': 598863, 'Memory': 2308.84, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola DES-PT-60a...

Time: 3600 - MCC
----- Start make prepare stderr -----
----- Start make prepare stdout -----
===========================================================================================
DES-PT-60a: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
DES-PT-60a: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ DES-PT-60a @ 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: 665/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 354 places, 311 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 336 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-60a-LTLCardinality.task
lola: A (((2 <= p319) U ((p6 <= p301) U (1 <= p329)))) : A (G ((G ((p1 <= p218)) U G ((3 <= p264))))) : A (G (F (F ((p117 <= p348))))) : A ((F (F ((1 <= p299))) U G (F ((3 <= p162))))) : A (G (F (G (X ((p347 <= p338)))))) : A ((((1 <= p314) U (3 <= p106)) U F (F ((2 <= p104))))) : A (F (X (((3 <= p256) U (2 <= p319))))) : A (F ((p310 <= p185))) : A ((F ((1 <= p271)) U G (X ((p130 <= p207))))) : A ((G (G ((p309 <= p66))) U F (X ((2 <= p98))))) : A (G (F ((p231 <= p110)))) : A (F (G (G (F ((3 <= p311)))))) : A ((2 <= p173)) : A (F ((F ((p287 <= p112)) U (2 <= p244)))) : A (F ((F ((1 <= p74)) U F ((p247 <= p72))))) : A (((2 <= p293) U G (F ((2 <= p49)))))
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 (((2 <= p319) U ((p6 <= p301) U (1 <= p329))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= p319) U ((p6 <= p301) U (1 <= p329))))
lola: processed formula: A (((2 <= p319) U ((p6 <= p301) U (1 <= p329))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((p1 <= p218)) U G ((3 <= p264)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((G ((p1 <= p218)) U G ((3 <= p264)))))
lola: processed formula: A (G ((G ((p1 <= p218)) U G ((3 <= p264)))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 21 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: 40 markings, 40 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (F ((p117 <= p348)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F ((p117 <= p348))))
lola: processed formula: A (G (F ((p117 <= p348))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: 122 markings, 148 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((1 <= p299))) U G (F ((3 <= p162)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((1 <= p299)) U G (F ((3 <= p162)))))
lola: processed formula: A ((F ((1 <= p299)) U G (F ((3 <= p162)))))
lola: processed formula length: 43
lola: 1 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: 28 markings, 29 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (X ((p347 <= p338))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X ((p347 <= p338)))))
lola: processed formula: A (F (G (X ((p347 <= p338)))))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 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: 233 markings, 566 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p314) U (3 <= p106)) U F (F ((2 <= p104)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= p314) U (3 <= p106)) U F ((2 <= p104))))
lola: processed formula: A ((((1 <= p314) U (3 <= p106)) U F ((2 <= p104))))
lola: processed formula length: 51
lola: 1 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((3 <= p256) U (2 <= p319)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (((3 <= p256) U (2 <= p319)))))
lola: processed formula: A (F (X (((3 <= p256) U (2 <= p319)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 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: 45 markings, 45 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p310 <= p185)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p310 <= p185)))
lola: processed formula: A (F ((p310 <= p185)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((1 <= p271)) U G (X ((p130 <= p207)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((1 <= p271)) U G (X ((p130 <= p207)))))
lola: processed formula: A ((F ((1 <= p271)) U G (X ((p130 <= p207)))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: 497274 markings, 3527776 edges, 99455 markings/sec, 0 secs
lola: 944046 markings, 7097388 edges, 89354 markings/sec, 5 secs
lola: 1369960 markings, 10576948 edges, 85183 markings/sec, 10 secs
lola: 1823020 markings, 14047409 edges, 90612 markings/sec, 15 secs
lola: 2191921 markings, 17456997 edges, 73780 markings/sec, 20 secs
lola: 2600999 markings, 20980021 edges, 81816 markings/sec, 25 secs
lola: 2991883 markings, 24234847 edges, 78177 markings/sec, 30 secs
lola: 3317315 markings, 27580315 edges, 65086 markings/sec, 35 secs
lola: 3700216 markings, 31034471 edges, 76580 markings/sec, 40 secs
lola: 4057862 markings, 34476910 edges, 71529 markings/sec, 45 secs
lola: 4454867 markings, 38098308 edges, 79401 markings/sec, 50 secs
lola: 4850094 markings, 41732219 edges, 79045 markings/sec, 55 secs
lola: 5248154 markings, 45182734 edges, 79612 markings/sec, 60 secs
lola: 5649002 markings, 48728004 edges, 80170 markings/sec, 65 secs
lola: 6084310 markings, 52372805 edges, 87062 markings/sec, 70 secs
lola: 6540379 markings, 55855812 edges, 91214 markings/sec, 75 secs
lola: 6995442 markings, 59433097 edges, 91013 markings/sec, 80 secs
lola: 7442347 markings, 63004340 edges, 89381 markings/sec, 85 secs
lola: 7805629 markings, 66220783 edges, 72656 markings/sec, 90 secs
lola: 8189608 markings, 69595888 edges, 76796 markings/sec, 95 secs
lola: 8611052 markings, 72920868 edges, 84289 markings/sec, 100 secs
lola: 9027053 markings, 76195745 edges, 83200 markings/sec, 105 secs
lola: 9469397 markings, 79686405 edges, 88469 markings/sec, 110 secs
lola: 9882692 markings, 83231212 edges, 82659 markings/sec, 115 secs
lola: 10265911 markings, 86708058 edges, 76644 markings/sec, 120 secs
lola: 10645120 markings, 90094068 edges, 75842 markings/sec, 125 secs
lola: 11024532 markings, 93487454 edges, 75882 markings/sec, 130 secs
lola: 11378475 markings, 96779465 edges, 70789 markings/sec, 135 secs
lola: 11699303 markings, 100225114 edges, 64166 markings/sec, 140 secs
lola: 12071803 markings, 103570848 edges, 74500 markings/sec, 145 secs
lola: 12411195 markings, 106869709 edges, 67878 markings/sec, 150 secs
lola: 12698534 markings, 110187853 edges, 57468 markings/sec, 155 secs
lola: 13042596 markings, 113570445 edges, 68812 markings/sec, 160 secs
lola: 13347525 markings, 116921983 edges, 60986 markings/sec, 165 secs
lola: 13703909 markings, 120483869 edges, 71277 markings/sec, 170 secs
lola: 14056940 markings, 124071793 edges, 70606 markings/sec, 175 secs
lola: 14422396 markings, 127584919 edges, 73091 markings/sec, 180 secs
lola: 14766089 markings, 130961121 edges, 68739 markings/sec, 185 secs
lola: 15111547 markings, 134453432 edges, 69092 markings/sec, 190 secs
lola: 15521722 markings, 138025448 edges, 82035 markings/sec, 195 secs
lola: 15896544 markings, 141367390 edges, 74964 markings/sec, 200 secs
lola: 16294409 markings, 144840245 edges, 79573 markings/sec, 205 secs
lola: 16676060 markings, 148355432 edges, 76330 markings/sec, 210 secs
lola: 17018400 markings, 151586693 edges, 68468 markings/sec, 215 secs
lola: 17350485 markings, 154806008 edges, 66417 markings/sec, 220 secs
lola: 17691164 markings, 158140710 edges, 68136 markings/sec, 225 secs
lola: 18063427 markings, 161347135 edges, 74453 markings/sec, 230 secs
lola: 18426077 markings, 164588669 edges, 72530 markings/sec, 235 secs
lola: 18813901 markings, 167985401 edges, 77565 markings/sec, 240 secs
lola: 19205778 markings, 171621556 edges, 78375 markings/sec, 245 secs
lola: 19574751 markings, 175197369 edges, 73795 markings/sec, 250 secs
lola: 19942378 markings, 178647492 edges, 73525 markings/sec, 255 secs
lola: 20312215 markings, 182068023 edges, 73967 markings/sec, 260 secs
lola: 20648176 markings, 185511017 edges, 67192 markings/sec, 265 secs
lola: 20949467 markings, 188951960 edges, 60258 markings/sec, 270 secs
lola: 21298479 markings, 192414784 edges, 69802 markings/sec, 275 secs
lola: 21644121 markings, 195814219 edges, 69128 markings/sec, 280 secs
lola: 21927669 markings, 199161635 edges, 56710 markings/sec, 285 secs
lola: 22226259 markings, 202630161 edges, 59718 markings/sec, 290 secs
lola: 22548079 markings, 205993911 edges, 64364 markings/sec, 295 secs
lola: 22888111 markings, 209499717 edges, 68006 markings/sec, 300 secs
lola: 23218779 markings, 213084069 edges, 66134 markings/sec, 305 secs
lola: 23549503 markings, 216635565 edges, 66145 markings/sec, 310 secs
lola: 23903007 markings, 220385965 edges, 70701 markings/sec, 315 secs
lola: 24234247 markings, 223868752 edges, 66248 markings/sec, 320 secs
lola: 24581294 markings, 227341832 edges, 69409 markings/sec, 325 secs
lola: 24930283 markings, 230901215 edges, 69798 markings/sec, 330 secs
lola: 25248778 markings, 234531521 edges, 63699 markings/sec, 335 secs
lola: 25594995 markings, 238265522 edges, 69243 markings/sec, 340 secs
lola: 25989152 markings, 241810176 edges, 78831 markings/sec, 345 secs
lola: 26360322 markings, 245268440 edges, 74234 markings/sec, 350 secs
lola: 26755799 markings, 248835269 edges, 79095 markings/sec, 355 secs
lola: 27090447 markings, 252424910 edges, 66930 markings/sec, 360 secs
lola: 27422178 markings, 256058635 edges, 66346 markings/sec, 365 secs
lola: 27745909 markings, 259374793 edges, 64746 markings/sec, 370 secs
lola: 28076474 markings, 262647895 edges, 66113 markings/sec, 375 secs
lola: 28394965 markings, 265955152 edges, 63698 markings/sec, 380 secs
lola: 28700201 markings, 269470128 edges, 61047 markings/sec, 385 secs
lola: 29069341 markings, 272790017 edges, 73828 markings/sec, 390 secs
lola: 29416986 markings, 276063388 edges, 69529 markings/sec, 395 secs
lola: 29799508 markings, 279423676 edges, 76504 markings/sec, 400 secs
lola: 30115913 markings, 282951618 edges, 63281 markings/sec, 405 secs
lola: 30457486 markings, 286464909 edges, 68315 markings/sec, 410 secs
lola: 30813030 markings, 290009932 edges, 71109 markings/sec, 415 secs
lola: 31121496 markings, 293570338 edges, 61693 markings/sec, 420 secs
lola: 31474631 markings, 296920931 edges, 70627 markings/sec, 425 secs
lola: 31763339 markings, 300335492 edges, 57742 markings/sec, 430 secs
lola: 32106517 markings, 303740315 edges, 68636 markings/sec, 435 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((p309 <= p66))) U F (X ((2 <= p98)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((p309 <= p66))) U F (X ((2 <= p98)))))
lola: processed formula: A ((G (G ((p309 <= p66))) U F (X ((2 <= p98)))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 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: 45 markings, 45 edges
lola: ========================================
lola: subprocess 10 will run for 516 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p231 <= p110))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F ((p231 <= p110))))
lola: processed formula: A (G (F ((p231 <= p110))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: 723 markings, 877 edges
lola: ========================================
lola: subprocess 11 will run for 619 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (F ((3 <= p311))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (G (F ((3 <= p311))))))
lola: processed formula: A (F (G (G (F ((3 <= p311))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 12 will run for 774 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p173))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p173)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-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 1032 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((p287 <= p112)) U (2 <= p244))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((p287 <= p112)) U (2 <= p244))))
lola: processed formula: A (F ((F ((p287 <= p112)) U (2 <= p244))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: 44 markings, 44 edges
lola: ========================================
lola: subprocess 14 will run for 1548 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((1 <= p74)) U F ((p247 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((1 <= p74)) U F ((p247 <= p72)))))
lola: processed formula: A (F ((F ((1 <= p74)) U F ((p247 <= p72)))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: 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 15 will run for 3097 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p293) U G (F ((2 <= p49)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= p293) U G (F ((2 <= p49)))))
lola: processed formula: A (((2 <= p293) U G (F ((2 <= p49)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 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: 26 markings, 26 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no no yes unknown no no no no no yes no
FORMULA DES-PT-60a-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-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="DES-PT-60a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60a.tgz
mv DES-PT-60a execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is DES-PT-60a, 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 r215-smll-152732266400159"
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 ;