fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r250-blw7-152732552300053
Last Updated
June 26, 2018

About the Execution of M4M.full for FlexibleBarrier-PT-16a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1053.270 315457.00 285125.00 159.50 FTF?TFTFTFTFFTFT 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 376K
-rw-r--r-- 1 mcc users 3.3K 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.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K 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 7.6K 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 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 214K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is FlexibleBarrier-PT-16a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r250-blw7-152732552300053
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1528010450090


BK_STOP 1528010765547

--------------------
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 FlexibleBarrier-PT-16a as instance name.
Using FlexibleBarrier 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': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 4307, 'Memory': 323.27, 'Tool': 'itstools'}, {'Time': 272212, 'Memory': 546.88, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 63.20222892964941x far from the best tool itstools.
LTLCardinality lola FlexibleBarrier-PT-16a...

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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-16a: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ FlexibleBarrier-PT-16a @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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: 919/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 195 places, 724 transitions, 177 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 532 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-16a-LTLCardinality.task
lola: A (G (F (F ((2 <= p90))))) : A ((p99 <= p173)) : A (X (G (F (X ((p46 <= p50)))))) : A (G (((p43 <= p118) U (p163 <= p82)))) : A (F (X ((p154 <= p30)))) : A ((((p182 <= p188) U (1 <= p74)) U X (F ((3 <= p106))))) : A ((((p13 <= p75) U (p101 <= p131)) U (p20 <= p149))) : A ((((p95 <= p14) U (p30 <= p112)) U G (F ((1 <= p63))))) : A (X (F (F (F ((p41 <= p155)))))) : A (F (X (G (F ((1 <= p46)))))) : A (F (X (((1 <= p95) U (p100 <= p110))))) : A (X ((2 <= p85))) : A (G ((F ((p20 <= p72)) U (2 <= p4)))) : A ((p193 <= p187)) : A (X (G ((1 <= p47)))) : A (F ((F ((p17 <= p62)) U (p111 <= p174))))
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 (G (F (F ((2 <= p90)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F ((2 <= p90))))
lola: processed formula: A (G (F ((2 <= p90))))
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 13 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p99 <= p173))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p99 <= p173)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (F (X ((p46 <= p50))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F (X ((p46 <= p50))))))
lola: processed formula: A (X (G (F (X ((p46 <= p50))))))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 13 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: 302 markings, 2526 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p43 <= p118) U (p163 <= p82))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (((p43 <= p118) U (p163 <= p82))))
lola: processed formula: A (G (((p43 <= p118) U (p163 <= p82))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 13 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 38475 markings, 311570 edges, 7695 markings/sec, 0 secs
lola: 51161 markings, 416930 edges, 2537 markings/sec, 5 secs
lola: 87328 markings, 700261 edges, 7233 markings/sec, 10 secs
lola: 105188 markings, 841683 edges, 3572 markings/sec, 15 secs
lola: 119271 markings, 951067 edges, 2817 markings/sec, 20 secs
lola: 131576 markings, 1040385 edges, 2461 markings/sec, 25 secs
lola: 144541 markings, 1134935 edges, 2593 markings/sec, 30 secs
lola: 160787 markings, 1250349 edges, 3249 markings/sec, 35 secs
lola: 200645 markings, 1546597 edges, 7972 markings/sec, 40 secs
lola: 219677 markings, 1687107 edges, 3806 markings/sec, 45 secs
lola: 234835 markings, 1801278 edges, 3032 markings/sec, 50 secs
lola: 251984 markings, 1926444 edges, 3430 markings/sec, 55 secs
lola: 302874 markings, 2317719 edges, 10178 markings/sec, 60 secs
lola: 328621 markings, 2508644 edges, 5149 markings/sec, 65 secs
lola: 364230 markings, 2774319 edges, 7122 markings/sec, 70 secs
lola: 396459 markings, 3010483 edges, 6446 markings/sec, 75 secs
lola: 425364 markings, 3224323 edges, 5781 markings/sec, 80 secs
lola: 442295 markings, 3342356 edges, 3386 markings/sec, 85 secs
lola: 484898 markings, 3655693 edges, 8521 markings/sec, 90 secs
lola: 511692 markings, 3844140 edges, 5359 markings/sec, 95 secs
lola: 525713 markings, 3948871 edges, 2804 markings/sec, 100 secs
lola: 552321 markings, 4138002 edges, 5322 markings/sec, 105 secs
lola: 589813 markings, 4408063 edges, 7498 markings/sec, 110 secs
lola: 602880 markings, 4502755 edges, 2613 markings/sec, 115 secs
lola: 629832 markings, 4699395 edges, 5390 markings/sec, 120 secs
lola: 654617 markings, 4873117 edges, 4957 markings/sec, 125 secs
lola: 688252 markings, 5110926 edges, 6727 markings/sec, 130 secs
lola: 701916 markings, 5203229 edges, 2733 markings/sec, 135 secs
lola: 729210 markings, 5390819 edges, 5459 markings/sec, 140 secs
lola: 748089 markings, 5530186 edges, 3776 markings/sec, 145 secs
lola: 769618 markings, 5679926 edges, 4306 markings/sec, 150 secs
lola: 800699 markings, 5910024 edges, 6216 markings/sec, 155 secs
lola: 827737 markings, 6095136 edges, 5408 markings/sec, 160 secs
lola: 846413 markings, 6222450 edges, 3735 markings/sec, 165 secs
lola: 893069 markings, 6555483 edges, 9331 markings/sec, 170 secs
lola: 928967 markings, 6813573 edges, 7180 markings/sec, 175 secs
lola: 938182 markings, 6883860 edges, 1843 markings/sec, 180 secs
lola: 946950 markings, 6945972 edges, 1754 markings/sec, 185 secs
lola: 956939 markings, 7015100 edges, 1998 markings/sec, 190 secs
lola: 967522 markings, 7089740 edges, 2117 markings/sec, 195 secs
lola: 978524 markings, 7167701 edges, 2200 markings/sec, 200 secs
lola: 990571 markings, 7250370 edges, 2409 markings/sec, 205 secs
lola: 1005172 markings, 7344655 edges, 2920 markings/sec, 210 secs
lola: 1038864 markings, 7579560 edges, 6738 markings/sec, 215 secs
lola: 1066017 markings, 7768849 edges, 5431 markings/sec, 220 secs
lola: 1098497 markings, 7990827 edges, 6496 markings/sec, 225 secs
lola: 1116438 markings, 8111384 edges, 3588 markings/sec, 230 secs
lola: 1162348 markings, 8434573 edges, 9182 markings/sec, 235 secs
lola: 1176744 markings, 8533071 edges, 2879 markings/sec, 240 secs
lola: 1206550 markings, 8743575 edges, 5961 markings/sec, 245 secs
lola: 1224662 markings, 8870346 edges, 3622 markings/sec, 250 secs
lola: 1250602 markings, 9046547 edges, 5188 markings/sec, 255 secs
lola: 1269651 markings, 9174857 edges, 3810 markings/sec, 260 secs
lola: 1320526 markings, 9539658 edges, 10175 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((p154 <= p30))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X ((p154 <= p30))))
lola: processed formula: A (F (X ((p154 <= p30))))
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 13 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 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p182 <= p188) U (1 <= p74)) U X (F ((3 <= p106)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p182 <= p188) U (1 <= p74)) U X (F ((3 <= p106)))))
lola: processed formula: A ((((p182 <= p188) U (1 <= p74)) U X (F ((3 <= p106)))))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 12 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p13 <= p75) U (p101 <= p131)) U (p20 <= p149)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p13 <= p75) U (p101 <= p131)) U (p20 <= p149)))
lola: processed formula: A ((((p13 <= p75) U (p101 <= p131)) U (p20 <= p149)))
lola: processed formula length: 53
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 13 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 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p95 <= p14) U (p30 <= p112)) U G (F ((1 <= p63)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p95 <= p14) U (p30 <= p112)) U G (F ((1 <= p63)))))
lola: processed formula: A ((((p95 <= p14) U (p30 <= p112)) U G (F ((1 <= p63)))))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 12 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: 8 markings, 9 edges
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (F ((p41 <= p155))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((p41 <= p155))))
lola: processed formula: A (X (F ((p41 <= p155))))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 13 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 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (G (F ((1 <= p46))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (G (F ((1 <= p46))))))
lola: processed formula: A (F (X (G (F ((1 <= p46))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 13 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 10 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((1 <= p95) U (p100 <= p110)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (((1 <= p95) U (p100 <= p110)))))
lola: processed formula: A (F (X (((1 <= p95) U (p100 <= p110)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 13 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 11 will run for 653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= p85)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((2 <= p85)))
lola: processed formula: A (X ((2 <= p85)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 13 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 12 will run for 817 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((p20 <= p72)) U (2 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((F ((p20 <= p72)) U (2 <= p4))))
lola: processed formula: A (G ((F ((p20 <= p72)) U (2 <= p4))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 13 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 13 will run for 1089 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p193 <= p187))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p193 <= p187)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-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 1634 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((1 <= p47))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G ((1 <= p47))))
lola: processed formula: A (X (G ((1 <= p47))))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 13 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 15 will run for 3268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((p17 <= p62)) U (p111 <= p174))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((p17 <= p62)) U (p111 <= p174))))
lola: processed formula: A (F ((F ((p17 <= p62)) U (p111 <= p174))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-16a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 bytes per marking, with 14 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: RESULT
lola:
SUMMARY: no yes no unknown yes no yes no yes no yes no no yes no yes
----- Kill lola and sara stderr -----
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-16a-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- 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="FlexibleBarrier-PT-16a"
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/FlexibleBarrier-PT-16a.tgz
mv FlexibleBarrier-PT-16a 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 FlexibleBarrier-PT-16a, 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 r250-blw7-152732552300053"
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 ;