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

About the Execution of M4M.struct for DLCround-PT-08a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
461.890 341222.00 301200.00 1836.70 TFFF?TFFFFFFTTFF 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 644K
-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.3K 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 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K 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 8.9K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K 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 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 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.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 479K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is DLCround-PT-08a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-smll-152732266400183
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527445445768


BK_STOP 1527445786990

--------------------
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 DLCround-PT-08a as instance name.
Using DLCround 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': 9659, 'Memory': 542.6, 'Tool': 'itstools'}, {'Time': 890016, 'Memory': 9690.71, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 92.14370017600166x far from the best tool itstools.
LTLCardinality lola DLCround-PT-08a...

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


checking for too many tokens
===========================================================================================
DLCround-PT-08a: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ DLCround-PT-08a @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2170/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 263 places, 1907 transitions, 106 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1668 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-08a-LTLCardinality.task
lola: A (X ((p244 <= p232))) : A (X (G (G ((2 <= p191))))) : A ((2 <= p132)) : A (X (G (((2 <= p221) U (p235 <= p44))))) : A (G (F (F ((1 <= p182))))) : A ((p189 <= p0)) : A (G ((p64 <= p108))) : A (X ((G ((p214 <= p77)) U X ((p203 <= p33))))) : A ((2 <= p3)) : A ((((p212 <= p67) U (p36 <= p121)) U ((3 <= p52) U (3 <= p246)))) : A (F (X (((3 <= p46) U (2 <= p142))))) : A ((((1 <= p128) U (3 <= p155)) U ((2 <= p188) U (2 <= p47)))) : A ((p160 <= p166)) : A (F (X (((p173 <= p235) U (p7 <= p123))))) : A ((G (G ((3 <= p111))) U (1 <= p35))) : A ((G (F ((2 <= p235))) U X (F ((2 <= p133)))))
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 ((p244 <= p232)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p244 <= p232)))
lola: processed formula: A (X ((p244 <= p232)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 20 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G ((2 <= p191)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (G ((2 <= p191)))))
lola: processed formula: A (X (G (G ((2 <= p191)))))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 20 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p132))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p132)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (((2 <= p221) U (p235 <= p44)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (((2 <= p221) U (p235 <= p44)))))
lola: processed formula: A (X (G (((2 <= p221) U (p235 <= p44)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 19 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (F ((1 <= p182)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F ((1 <= p182))))
lola: processed formula: A (G (F ((1 <= p182))))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1126 markings, 16097 edges, 225 markings/sec, 0 secs
lola: 2203 markings, 30165 edges, 215 markings/sec, 5 secs
lola: 3418 markings, 45989 edges, 243 markings/sec, 10 secs
lola: 4479 markings, 60743 edges, 212 markings/sec, 15 secs
lola: 5779 markings, 77018 edges, 260 markings/sec, 20 secs
lola: 7187 markings, 95324 edges, 282 markings/sec, 25 secs
lola: 8396 markings, 111445 edges, 242 markings/sec, 30 secs
lola: 9533 markings, 127854 edges, 227 markings/sec, 35 secs
lola: 10812 markings, 144373 edges, 256 markings/sec, 40 secs
lola: 12084 markings, 162477 edges, 254 markings/sec, 45 secs
lola: 12959 markings, 176488 edges, 175 markings/sec, 50 secs
lola: 13997 markings, 192198 edges, 208 markings/sec, 55 secs
lola: 15245 markings, 208237 edges, 250 markings/sec, 60 secs
lola: 16048 markings, 219081 edges, 161 markings/sec, 65 secs
lola: 17061 markings, 231435 edges, 203 markings/sec, 70 secs
lola: 18539 markings, 250067 edges, 296 markings/sec, 75 secs
lola: 19493 markings, 263289 edges, 191 markings/sec, 80 secs
lola: 20710 markings, 279419 edges, 243 markings/sec, 85 secs
lola: 21626 markings, 291697 edges, 183 markings/sec, 90 secs
lola: 22859 markings, 308104 edges, 247 markings/sec, 95 secs
lola: 23903 markings, 321898 edges, 209 markings/sec, 100 secs
lola: 25263 markings, 338827 edges, 272 markings/sec, 105 secs
lola: 26388 markings, 354503 edges, 225 markings/sec, 110 secs
lola: 27267 markings, 367468 edges, 176 markings/sec, 115 secs
lola: 28505 markings, 384987 edges, 248 markings/sec, 120 secs
lola: 29612 markings, 400851 edges, 221 markings/sec, 125 secs
lola: 30732 markings, 416786 edges, 224 markings/sec, 130 secs
lola: 32095 markings, 434673 edges, 273 markings/sec, 135 secs
lola: 33317 markings, 449949 edges, 244 markings/sec, 140 secs
lola: 34621 markings, 467771 edges, 261 markings/sec, 145 secs
lola: 35737 markings, 483789 edges, 223 markings/sec, 150 secs
lola: 36986 markings, 499271 edges, 250 markings/sec, 155 secs
lola: 37972 markings, 513657 edges, 197 markings/sec, 160 secs
lola: 38764 markings, 526042 edges, 158 markings/sec, 165 secs
lola: 39889 markings, 541933 edges, 225 markings/sec, 170 secs
lola: 41107 markings, 558019 edges, 244 markings/sec, 175 secs
lola: 42266 markings, 574202 edges, 232 markings/sec, 180 secs
lola: 43630 markings, 591674 edges, 273 markings/sec, 185 secs
lola: 44755 markings, 607913 edges, 225 markings/sec, 190 secs
lola: 46107 markings, 626228 edges, 270 markings/sec, 195 secs
lola: 47418 markings, 642420 edges, 262 markings/sec, 200 secs
lola: 48425 markings, 656397 edges, 201 markings/sec, 205 secs
lola: 49661 markings, 673306 edges, 247 markings/sec, 210 secs
lola: 50837 markings, 689102 edges, 235 markings/sec, 215 secs
lola: 51857 markings, 703645 edges, 204 markings/sec, 220 secs
lola: 53245 markings, 723418 edges, 278 markings/sec, 225 secs
lola: 54760 markings, 744192 edges, 303 markings/sec, 230 secs
lola: 56476 markings, 765952 edges, 343 markings/sec, 235 secs
lola: 58074 markings, 786780 edges, 320 markings/sec, 240 secs
lola: 59241 markings, 802222 edges, 233 markings/sec, 245 secs
lola: 60924 markings, 824313 edges, 337 markings/sec, 250 secs
lola: 62210 markings, 842196 edges, 257 markings/sec, 255 secs
lola: 63267 markings, 856708 edges, 211 markings/sec, 260 secs
lola: 64463 markings, 873845 edges, 239 markings/sec, 265 secs
lola: 65638 markings, 890636 edges, 235 markings/sec, 270 secs
lola: 66793 markings, 906439 edges, 231 markings/sec, 275 secs
lola: 67858 markings, 920623 edges, 213 markings/sec, 280 secs
lola: 68977 markings, 936349 edges, 224 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p189 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p189 <= p0)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-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 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p64 <= p108)))
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 16 bytes per marking, with 22 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: 13 markings, 27 edges
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((p214 <= p77)) U X ((p203 <= p33)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((G ((p214 <= p77)) U X ((p203 <= p33)))))
lola: processed formula: A (X ((G ((p214 <= p77)) U X ((p203 <= p33)))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 19 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p3)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-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 9 will run for 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p212 <= p67) U (p36 <= p121)) U ((3 <= p52) U (3 <= p246))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p212 <= p67) U (p36 <= p121)) U ((3 <= p52) U (3 <= p246))))
lola: processed formula: A ((((p212 <= p67) U (p36 <= p121)) U ((3 <= p52) U (3 <= p246))))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((3 <= p46) U (2 <= p142)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (((3 <= p46) U (2 <= p142)))))
lola: processed formula: A (F (X (((3 <= p46) U (2 <= p142)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 20 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 11 will run for 649 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p128) U (3 <= p155)) U ((2 <= p188) U (2 <= p47))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((1 <= p128) U (3 <= p155)) U ((2 <= p188) U (2 <= p47))))
lola: processed formula: A ((((1 <= p128) U (3 <= p155)) U ((2 <= p188) U (2 <= p47))))
lola: processed formula length: 62
lola: 0 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 12 will run for 811 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p160 <= p166))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p160 <= p166)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-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 13 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((p173 <= p235) U (p7 <= p123)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (((p173 <= p235) U (p7 <= p123)))))
lola: processed formula: A (F (X (((p173 <= p235) U (p7 <= p123)))))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 20 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 14 will run for 1622 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((3 <= p111))) U (1 <= p35)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((3 <= p111))) U (1 <= p35)))
lola: processed formula: A ((G (G ((3 <= p111))) U (1 <= p35)))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 20 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, 3 edges
lola: ========================================
lola: subprocess 15 will run for 3245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((2 <= p235))) U X (F ((2 <= p133)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (F ((2 <= p235))) U X (F ((2 <= p133)))))
lola: processed formula: A ((G (F ((2 <= p235))) U X (F ((2 <= p133)))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 19 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: 5 markings, 5 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no unknown yes no no no no no no yes yes no no
FORMULA DLCround-PT-08a-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished 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="DLCround-PT-08a"
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/DLCround-PT-08a.tgz
mv DLCround-PT-08a 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 DLCround-PT-08a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r215-smll-152732266400183"
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 ;