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

About the Execution of Irma.struct for RwMutex-PT-r2000w0010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15888.800 235353.00 101180.00 1966.60 TFTFFFTFTFTF?FFF 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 4.1M
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K 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 11 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.9M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is RwMutex-PT-r2000w0010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-smll-152732262200513
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527458935150


BK_STOP 1527459170503

--------------------
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 RwMutex-PT-r2000w0010 as instance name.
Using RwMutex 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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 79186, 'Memory': 15671.19, 'Tool': 'lola'}, {'Time': 170062, 'Memory': 15945.26, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola RwMutex-PT-r2000w0010...

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


checking for too many tokens
===========================================================================================
RwMutex-PT-r2000w0010: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ RwMutex-PT-r2000w0010 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 10040/65536 symbol table entries, 2691 collisions
lola: preprocessing...
lola: finding significant places
lola: 6020 places, 4020 transitions, 2010 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4011 transition conflict sets
lola: TASK
lola: reading formula from RwMutex-PT-r2000w0010-LTLCardinality.task
lola: A ((((p5285 <= p5430) U (p5996 <= p5031)) U F (F ((p2264 <= p1807))))) : A (F ((F ((p1156 <= p1575)) U G ((2 <= p964))))) : A ((p3062 <= p1464)) : A ((((p2758 <= p5992) U (p3147 <= p5318)) U ((p3676 <= p4553) U (p1014 <= p3816)))) : A (G (G (F (G ((p3829 <= p303)))))) : A (F ((p5825 <= p3349))) : A ((G (X ((p3208 <= p5655))) U (p2892 <= p5293))) : A (G (G ((p4582 <= p741)))) : A ((p4833 <= p5213)) : A ((((p3677 <= p993) U (p3782 <= p5297)) U G (F ((2 <= p5889))))) : A (F ((p2181 <= p5587))) : A ((p72 <= p2353)) : A (X (X (G ((p1564 <= p892))))) : A ((2 <= p4479)) : A ((F (F ((p482 <= p2635))) U F (G ((2 <= p5561))))) : A ((3 <= p1370))
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 ((((p5285 <= p5430) U (p5996 <= p5031)) U F (F ((p2264 <= p1807)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p5285 <= p5430) U (p5996 <= p5031)) U F ((p2264 <= p1807))))
lola: processed formula: A ((((p5285 <= p5430) U (p5996 <= p5031)) U F ((p2264 <= p1807))))
lola: processed formula length: 66
lola: 1 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 5 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((p1156 <= p1575)) U G ((2 <= p964)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((p1156 <= p1575)) U G ((2 <= p964)))))
lola: processed formula: A (F ((F ((p1156 <= p1575)) U G ((2 <= p964)))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 4 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: 3 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p3062 <= p1464))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p3062 <= p1464)
lola: processed formula length: 16
lola: 1 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p2758 <= p5992) U (p3147 <= p5318)) U ((p3676 <= p4553) U (p1014 <= p3816))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p2758 <= p5992) U (p3147 <= p5318)) U ((p3676 <= p4553) U (p1014 <= p3816))))
lola: processed formula: A ((((p2758 <= p5992) U (p3147 <= p5318)) U ((p3676 <= p4553) U (p1014 <= p3816))))
lola: processed formula length: 83
lola: 0 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 3 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (G ((p3829 <= p303))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((p3829 <= p303))))
lola: processed formula: A (F (G ((p3829 <= p303))))
lola: processed formula length: 27
lola: 2 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 4 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: 1588 markings, 3173 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p5825 <= p3349)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p5825 <= p3349)))
lola: processed formula: A (F ((p5825 <= p3349)))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 5 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((p3208 <= p5655))) U (p2892 <= p5293)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (X ((p3208 <= p5655))) U (p2892 <= p5293)))
lola: processed formula: A ((G (X ((p3208 <= p5655))) U (p2892 <= p5293)))
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 3 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G ((p4582 <= p741))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G ((p4582 <= p741))))
lola: processed formula: A (G (G ((p4582 <= p741))))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 4 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: 66 markings, 128 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p4833 <= p5213))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p4833 <= p5213)
lola: processed formula length: 16
lola: 1 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p3677 <= p993) U (p3782 <= p5297)) U G (F ((2 <= p5889)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p3677 <= p993) U (p3782 <= p5297)) U G (F ((2 <= p5889)))))
lola: processed formula: A ((((p3677 <= p993) U (p3782 <= p5297)) U G (F ((2 <= p5889)))))
lola: processed formula length: 65
lola: 0 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 3 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, 5 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p2181 <= p5587)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p2181 <= p5587)))
lola: processed formula: A (F ((p2181 <= p5587)))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 5 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 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p72 <= p2353))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p72 <= p2353)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-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 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((p1564 <= p892)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (G ((p1564 <= p892)))))
lola: processed formula: A (X (X (G ((p1564 <= p892)))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 124700 markings, 577289 edges, 24940 markings/sec, 0 secs
lola: 234004 markings, 1145919 edges, 21861 markings/sec, 5 secs
lola: 351507 markings, 1752836 edges, 23501 markings/sec, 10 secs
lola: 467731 markings, 2352529 edges, 23245 markings/sec, 15 secs
lola: 576221 markings, 2962102 edges, 21698 markings/sec, 20 secs
lola: 684108 markings, 3569747 edges, 21577 markings/sec, 25 secs
lola: 798119 markings, 4171256 edges, 22802 markings/sec, 30 secs
lola: 906851 markings, 4774718 edges, 21746 markings/sec, 35 secs
lola: 1014324 markings, 5379893 edges, 21495 markings/sec, 40 secs
lola: 1125414 markings, 5976519 edges, 22218 markings/sec, 45 secs
lola: 1236547 markings, 6575639 edges, 22227 markings/sec, 50 secs
lola: 1343878 markings, 7183883 edges, 21466 markings/sec, 55 secs
lola: 1450404 markings, 7789524 edges, 21305 markings/sec, 60 secs
lola: 1555007 markings, 8394063 edges, 20921 markings/sec, 65 secs
lola: 1653511 markings, 9012702 edges, 19701 markings/sec, 70 secs
lola: 1754330 markings, 9628048 edges, 20164 markings/sec, 75 secs
lola: 1859565 markings, 10231042 edges, 21047 markings/sec, 80 secs
lola: 1960024 markings, 10833198 edges, 20092 markings/sec, 85 secs
lola: 1960153 markings, 10833962 edges, 26 markings/sec, 90 secs
lola: 1960286 markings, 10834727 edges, 27 markings/sec, 95 secs
lola: 1960421 markings, 10835558 edges, 27 markings/sec, 100 secs
lola: 1960495 markings, 10836036 edges, 15 markings/sec, 105 secs
lola: 1960548 markings, 10836351 edges, 11 markings/sec, 110 secs
lola: 1960551 markings, 10836377 edges, 1 markings/sec, 115 secs
lola: 1960557 markings, 10836403 edges, 1 markings/sec, 120 secs
lola: 1960561 markings, 10836429 edges, 1 markings/sec, 125 secs
lola: 1960566 markings, 10836457 edges, 1 markings/sec, 130 secs
lola: 1960570 markings, 10836482 edges, 1 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1117 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p4479))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p4479)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-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 1675 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((p482 <= p2635))) U F (G ((2 <= p5561)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((p482 <= p2635)) U F (G ((2 <= p5561)))))
lola: processed formula: A ((F ((p482 <= p2635)) U F (G ((2 <= p5561)))))
lola: processed formula length: 48
lola: 1 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 4 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: 3 markings, 4 edges
lola: ========================================
lola: subprocess 15 will run for 3351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p1370))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p1370)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-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: RESULT
lola:
SUMMARY: yes no yes no no no yes no yes no yes no unknown no no no
lola: ========================================
FORMULA RwMutex-PT-r2000w0010-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-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="RwMutex-PT-r2000w0010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-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/RwMutex-PT-r2000w0010.tgz
mv RwMutex-PT-r2000w0010 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 irma4mcc-structural"
echo " Input is RwMutex-PT-r2000w0010, 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 r211-smll-152732262200513"
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 ;