fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r191-qhx2-152732142600083
Last Updated
June 26, 2018

About the Execution of M4M.struct for Raft-PT-09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2685.200 641988.00 645042.00 1827.30 FFFTFFTFFF?FFFTT 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 368K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K 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.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 196K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is Raft-PT-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-qhx2-152732142600083
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1528372875160


BK_STOP 1528373517148

--------------------
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 Raft-PT-09 as instance name.
Using Raft 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': True, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 21876, 'Memory': 874.02, 'Tool': 'itstools'}, {'Time': 24976, 'Memory': 840.22, 'Tool': 'itstools'}, {'Time': 758975, 'Memory': 14396.72, 'Tool': 'lola'}, {'Time': 759178, 'Memory': 14330.46, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 34.6944139696471x far from the best tool itstools.
LTLCardinality lola Raft-PT-09...

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


checking for too many tokens
===========================================================================================
Raft-PT-09: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ Raft-PT-09 @ 3538 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1123/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 413 places, 710 transitions, 332 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 700 transition conflict sets
lola: TASK
lola: reading formula from Raft-PT-09-LTLCardinality.task
lola: A (X (((p402 <= p262) U X ((3 <= p353))))) : A (F (X (F (X ((3 <= p192)))))) : A (X (X (F (X ((3 <= p240)))))) : A (X (((2 <= p180) U F ((p168 <= p406))))) : A (F ((1 <= p208))) : A (F (X (F ((1 <= p28))))) : A (F ((G ((2 <= p372)) U X ((p291 <= p156))))) : A (F (F ((3 <= p243)))) : A ((X (F ((1 <= p48))) U ((3 <= p7) U (1 <= p43)))) : A (X (X (F ((3 <= p269))))) : A (F (((3 <= p127) U G ((p93 <= p107))))) : A (G ((1 <= p82))) : A ((2 <= p229)) : A (X (((p14 <= p341) U F ((p175 <= p21))))) : A ((G (G ((2 <= p344))) U (p37 <= p184))) : A (F ((p218 <= p80)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((p402 <= p262) U X ((3 <= p353)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((p402 <= p262) U X ((3 <= p353)))))
lola: processed formula: A (X (((p402 <= p262) U X ((3 <= p353)))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 17 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (X ((3 <= p192))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (F (X ((3 <= p192))))))
lola: processed formula: A (F (X (F (X ((3 <= p192))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 18 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (X ((3 <= p240))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (F (X ((3 <= p240))))))
lola: processed formula: A (X (X (F (X ((3 <= p240))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 17 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((2 <= p180) U F ((p168 <= p406)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((2 <= p180) U F ((p168 <= p406)))))
lola: processed formula: A (X (((2 <= p180) U F ((p168 <= p406)))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 18 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p208)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= p208)))
lola: processed formula: A (F ((1 <= p208)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 19 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F ((1 <= p28)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (F ((1 <= p28)))))
lola: processed formula: A (F (X (F ((1 <= p28)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 18 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((2 <= p372)) U X ((p291 <= p156)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((2 <= p372)) U X ((p291 <= p156)))))
lola: processed formula: A (F ((G ((2 <= p372)) U X ((p291 <= p156)))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 18 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F ((3 <= p243))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= p243)))
lola: processed formula: A (F ((3 <= p243)))
lola: processed formula length: 19
lola: 1 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 19 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((1 <= p48))) U ((3 <= p7) U (1 <= p43))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (F ((1 <= p48))) U ((3 <= p7) U (1 <= p43))))
lola: processed formula: A ((X (F ((1 <= p48))) U ((3 <= p7) U (1 <= p43))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 18 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((3 <= p269)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (F ((3 <= p269)))))
lola: processed formula: A (X (X (F ((3 <= p269)))))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 18 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((3 <= p127) U G ((p93 <= p107)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((3 <= p127) U G ((p93 <= p107)))))
lola: processed formula: A (F (((3 <= p127) U G ((p93 <= p107)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 29826 markings, 69429 edges, 5965 markings/sec, 0 secs
lola: 62099 markings, 143653 edges, 6455 markings/sec, 5 secs
lola: 94580 markings, 217770 edges, 6496 markings/sec, 10 secs
lola: 129180 markings, 297896 edges, 6920 markings/sec, 15 secs
lola: 161994 markings, 374092 edges, 6563 markings/sec, 20 secs
lola: 196234 markings, 452936 edges, 6848 markings/sec, 25 secs
lola: 228659 markings, 527219 edges, 6485 markings/sec, 30 secs
lola: 261375 markings, 602067 edges, 6543 markings/sec, 35 secs
lola: 293537 markings, 677702 edges, 6432 markings/sec, 40 secs
lola: 327806 markings, 759681 edges, 6854 markings/sec, 45 secs
lola: 361230 markings, 837328 edges, 6685 markings/sec, 50 secs
lola: 397282 markings, 922802 edges, 7210 markings/sec, 55 secs
lola: 431670 markings, 1003464 edges, 6878 markings/sec, 60 secs
lola: 466611 markings, 1085509 edges, 6988 markings/sec, 65 secs
lola: 502733 markings, 1171128 edges, 7224 markings/sec, 70 secs
lola: 538386 markings, 1256632 edges, 7131 markings/sec, 75 secs
lola: 575939 markings, 1351262 edges, 7511 markings/sec, 80 secs
lola: 613257 markings, 1438229 edges, 7464 markings/sec, 85 secs
lola: 650243 markings, 1523099 edges, 7397 markings/sec, 90 secs
lola: 687827 markings, 1614072 edges, 7517 markings/sec, 95 secs
lola: 727414 markings, 1710470 edges, 7917 markings/sec, 100 secs
lola: 766342 markings, 1801820 edges, 7786 markings/sec, 105 secs
lola: 803586 markings, 1890604 edges, 7449 markings/sec, 110 secs
lola: 847187 markings, 1988934 edges, 8720 markings/sec, 115 secs
lola: 887263 markings, 2083482 edges, 8015 markings/sec, 120 secs
lola: 924902 markings, 2177863 edges, 7528 markings/sec, 125 secs
lola: 963193 markings, 2269782 edges, 7658 markings/sec, 130 secs
lola: 1001167 markings, 2365992 edges, 7595 markings/sec, 135 secs
lola: 1039910 markings, 2460170 edges, 7749 markings/sec, 140 secs
lola: 1081806 markings, 2555335 edges, 8379 markings/sec, 145 secs
lola: 1123346 markings, 2655644 edges, 8308 markings/sec, 150 secs
lola: 1164786 markings, 2755239 edges, 8288 markings/sec, 155 secs
lola: 1206601 markings, 2854375 edges, 8363 markings/sec, 160 secs
lola: 1248210 markings, 2956189 edges, 8322 markings/sec, 165 secs
lola: 1289020 markings, 3056470 edges, 8162 markings/sec, 170 secs
lola: 1330940 markings, 3158837 edges, 8384 markings/sec, 175 secs
lola: 1372333 markings, 3258039 edges, 8279 markings/sec, 180 secs
lola: 1411730 markings, 3354185 edges, 7879 markings/sec, 185 secs
lola: 1457945 markings, 3461831 edges, 9243 markings/sec, 190 secs
lola: 1497886 markings, 3563202 edges, 7988 markings/sec, 195 secs
lola: 1539875 markings, 3667219 edges, 8398 markings/sec, 200 secs
lola: 1581303 markings, 3769710 edges, 8286 markings/sec, 205 secs
lola: 1628628 markings, 3876802 edges, 9465 markings/sec, 210 secs
lola: 1671488 markings, 3982198 edges, 8572 markings/sec, 215 secs
lola: 1714375 markings, 4091136 edges, 8577 markings/sec, 220 secs
lola: 1756972 markings, 4196794 edges, 8519 markings/sec, 225 secs
lola: 1797014 markings, 4300904 edges, 8008 markings/sec, 230 secs
lola: 1836881 markings, 4399879 edges, 7973 markings/sec, 235 secs
lola: 1883192 markings, 4507964 edges, 9262 markings/sec, 240 secs
lola: 1926154 markings, 4613651 edges, 8592 markings/sec, 245 secs
lola: 1965726 markings, 4715814 edges, 7914 markings/sec, 250 secs
lola: 2008749 markings, 4824366 edges, 8605 markings/sec, 255 secs
lola: 2049757 markings, 4930834 edges, 8202 markings/sec, 260 secs
lola: 2092118 markings, 5038580 edges, 8472 markings/sec, 265 secs
lola: 2135407 markings, 5147919 edges, 8658 markings/sec, 270 secs
lola: 2176979 markings, 5253295 edges, 8314 markings/sec, 275 secs
lola: 2223482 markings, 5365878 edges, 9301 markings/sec, 280 secs
lola: 2265668 markings, 5468068 edges, 8437 markings/sec, 285 secs
lola: 2303097 markings, 5564408 edges, 7486 markings/sec, 290 secs
lola: 2349781 markings, 5675851 edges, 9337 markings/sec, 295 secs
lola: 2391215 markings, 5781454 edges, 8287 markings/sec, 300 secs
lola: 2436619 markings, 5891612 edges, 9081 markings/sec, 305 secs
lola: 2483227 markings, 6010592 edges, 9322 markings/sec, 310 secs
lola: 2520329 markings, 6103608 edges, 7420 markings/sec, 315 secs
lola: 2564067 markings, 6208580 edges, 8748 markings/sec, 320 secs
lola: 2605377 markings, 6314170 edges, 8262 markings/sec, 325 secs
lola: 2645507 markings, 6416108 edges, 8026 markings/sec, 330 secs
lola: 2686996 markings, 6517600 edges, 8298 markings/sec, 335 secs
lola: 2724744 markings, 6617163 edges, 7550 markings/sec, 340 secs
lola: 2769183 markings, 6721462 edges, 8888 markings/sec, 345 secs
lola: 2813656 markings, 6832890 edges, 8895 markings/sec, 350 secs
lola: 2852888 markings, 6931231 edges, 7846 markings/sec, 355 secs
lola: 2889930 markings, 7027399 edges, 7408 markings/sec, 360 secs
lola: 2933882 markings, 7138271 edges, 8790 markings/sec, 365 secs
lola: 2973764 markings, 7240718 edges, 7976 markings/sec, 370 secs
lola: 3022924 markings, 7350104 edges, 9832 markings/sec, 375 secs
lola: 3061797 markings, 7449939 edges, 7775 markings/sec, 380 secs
lola: 3097669 markings, 7538019 edges, 7174 markings/sec, 385 secs
lola: 3136255 markings, 7634841 edges, 7717 markings/sec, 390 secs
lola: 3179532 markings, 7743344 edges, 8655 markings/sec, 395 secs
lola: 3226404 markings, 7855980 edges, 9374 markings/sec, 400 secs
lola: 3266207 markings, 7961794 edges, 7961 markings/sec, 405 secs
lola: 3302748 markings, 8058535 edges, 7308 markings/sec, 410 secs
lola: 3335718 markings, 8139198 edges, 6594 markings/sec, 415 secs
lola: 3363729 markings, 8203119 edges, 5602 markings/sec, 420 secs
lola: 3390355 markings, 8263551 edges, 5325 markings/sec, 425 secs
lola: 3418821 markings, 8329183 edges, 5693 markings/sec, 430 secs
lola: 3445116 markings, 8388897 edges, 5259 markings/sec, 435 secs
lola: 3471822 markings, 8449447 edges, 5341 markings/sec, 440 secs
lola: 3499948 markings, 8515149 edges, 5625 markings/sec, 445 secs
lola: 3527852 markings, 8581196 edges, 5581 markings/sec, 450 secs
lola: 3555446 markings, 8645925 edges, 5519 markings/sec, 455 secs
lola: 3581544 markings, 8705041 edges, 5220 markings/sec, 460 secs
lola: 3611261 markings, 8776655 edges, 5943 markings/sec, 465 secs
lola: 3640263 markings, 8844286 edges, 5800 markings/sec, 470 secs
lola: 3667403 markings, 8906950 edges, 5428 markings/sec, 475 secs
lola: 3697222 markings, 8975832 edges, 5964 markings/sec, 480 secs
lola: 3727713 markings, 9047155 edges, 6098 markings/sec, 485 secs
lola: 3756854 markings, 9114451 edges, 5828 markings/sec, 490 secs
lola: 3786394 markings, 9183362 edges, 5908 markings/sec, 495 secs
lola: 3816006 markings, 9253637 edges, 5922 markings/sec, 500 secs
lola: 3847561 markings, 9325175 edges, 6311 markings/sec, 505 secs
lola: 3878050 markings, 9401646 edges, 6098 markings/sec, 510 secs
lola: 3906554 markings, 9471422 edges, 5701 markings/sec, 515 secs
lola: 3935896 markings, 9541351 edges, 5868 markings/sec, 520 secs
lola: 3966265 markings, 9614604 edges, 6074 markings/sec, 525 secs
lola: 3997165 markings, 9688069 edges, 6180 markings/sec, 530 secs
lola: 4028571 markings, 9763461 edges, 6281 markings/sec, 535 secs
lola: 4061440 markings, 9838630 edges, 6574 markings/sec, 540 secs
lola: 4093030 markings, 9912416 edges, 6318 markings/sec, 545 secs
lola: 4124711 markings, 9991465 edges, 6336 markings/sec, 550 secs
lola: 4155668 markings, 10066921 edges, 6191 markings/sec, 555 secs
lola: 4190291 markings, 10146940 edges, 6925 markings/sec, 560 secs
lola: 4224426 markings, 10223971 edges, 6827 markings/sec, 565 secs
lola: 4256803 markings, 10298939 edges, 6475 markings/sec, 570 secs
lola: 4288611 markings, 10376871 edges, 6362 markings/sec, 575 secs
lola: 4322198 markings, 10457610 edges, 6717 markings/sec, 580 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p82)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 737 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p229))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p229)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-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 983 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((p14 <= p341) U F ((p175 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((p14 <= p341) U F ((p175 <= p21)))))
lola: processed formula: A (X (((p14 <= p341) U F ((p175 <= p21)))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 18 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: 10 markings, 10 edges
lola: ========================================
lola: subprocess 14 will run for 1474 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((2 <= p344))) U (p37 <= p184)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((2 <= p344))) U (p37 <= p184)))
lola: processed formula: A ((G (G ((2 <= p344))) U (p37 <= p184)))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 18 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 2949 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p218 <= p80)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p218 <= p80)))
lola: processed formula: A (F ((p218 <= p80)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 413 places; total mentions: 0
lola: closed formula file Raft-PT-09-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 19 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 no no yes no no yes no no no unknown no no no yes yes
FORMULA Raft-PT-09-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-09-LTLCardinality-15 TRUE 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="Raft-PT-09"
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/Raft-PT-09.tgz
mv Raft-PT-09 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 Raft-PT-09, 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 r191-qhx2-152732142600083"
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 ;