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 372K
-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.7K 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.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 122 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 360 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 19 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 211K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is DNAwalker-PT-16redondantChoiceR, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-smll-152732261800257
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527417377691


BK_STOP 1527417816366

--------------------
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 DNAwalker-PT-16redondantChoiceR as instance name.
Using DNAwalker 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': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': None, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 511605, 'Memory': 8972.4, 'Tool': 'lola'}, {'Time': 511685, 'Memory': 8865.62, 'Tool': 'lola'}, {'Time': 3507686, 'Memory': 13878.25, 'Tool': 'itstools'}, {'Time': 3507970, 'Memory': 13883.47, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola DNAwalker-PT-16redondantChoiceR...

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


checking for too many tokens
===========================================================================================
DNAwalker-PT-16redondantChoiceR: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ DNAwalker-PT-16redondantChoiceR @ 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: 533/65536 symbol table entries, 8 collisions
lola: preprocessing...
lola: finding significant places
lola: 43 places, 490 transitions, 43 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 284 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: A ((A7 <= A15)) : A (F ((2 <= B29))) : A (G ((A25 <= A15))) : A (X (G (((1 <= A14) U (A9 <= B30))))) : A (G ((3 <= A33))) : A ((X ((1 <= A7)) U (A5 <= A15))) : A ((A6 <= A22)) : A (F (G (((3 <= B5) U (1 <= A33))))) : A (G (F (((A31 <= A22) U (1 <= A2))))) : A ((X (G ((3 <= A29))) U (1 <= A3))) : A (((A27 <= B16) U ((3 <= A12) U (1 <= A15)))) : A (X (X ((3 <= B6)))) : A ((B30 <= B28)) : A (F (X (((B13 <= A15) U (3 <= A15))))) : A (X (((1 <= A30) U G ((2 <= A1))))) : A (F ((2 <= A11)))
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 ((A7 <= A15))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (A7 <= A15)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= B29)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= B29)))
lola: processed formula: A (F ((2 <= B29)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 31 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: 20 markings, 20 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A25 <= A15)))
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 172 bytes per marking, with 0 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (((1 <= A14) U (A9 <= B30)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (((1 <= A14) U (A9 <= B30)))))
lola: processed formula: A (X (G (((1 <= A14) U (A9 <= B30)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 29 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= A33)))
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 172 bytes per marking, with 0 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((1 <= A7)) U (A5 <= A15)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X ((1 <= A7)) U (A5 <= A15)))
lola: processed formula: A ((X ((1 <= A7)) U (A5 <= A15)))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 30 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A6 <= A22))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (A6 <= A22)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (((3 <= B5) U (1 <= A33)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (((3 <= B5) U (1 <= A33)))))
lola: processed formula: A (F (G (((3 <= B5) U (1 <= A33)))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 98158 markings, 312231 edges, 19632 markings/sec, 0 secs
lola: 189757 markings, 650975 edges, 18320 markings/sec, 5 secs
lola: 276066 markings, 1018268 edges, 17262 markings/sec, 10 secs
lola: 365567 markings, 1426437 edges, 17900 markings/sec, 15 secs
lola: 456693 markings, 1768282 edges, 18225 markings/sec, 20 secs
lola: 543593 markings, 2131505 edges, 17380 markings/sec, 25 secs
lola: 632047 markings, 2490232 edges, 17691 markings/sec, 30 secs
lola: 717399 markings, 2867660 edges, 17070 markings/sec, 35 secs
lola: 809637 markings, 3279360 edges, 18448 markings/sec, 40 secs
lola: 901436 markings, 3656464 edges, 18360 markings/sec, 45 secs
lola: 985265 markings, 4019918 edges, 16766 markings/sec, 50 secs
lola: 1072023 markings, 4387999 edges, 17352 markings/sec, 55 secs
lola: 1162545 markings, 4779460 edges, 18104 markings/sec, 60 secs
lola: 1252793 markings, 5188875 edges, 18050 markings/sec, 65 secs
lola: 1342514 markings, 5612576 edges, 17944 markings/sec, 70 secs
lola: 1427168 markings, 5985631 edges, 16931 markings/sec, 75 secs
lola: 1511699 markings, 6394479 edges, 16906 markings/sec, 80 secs
lola: 1591791 markings, 6836754 edges, 16018 markings/sec, 85 secs
lola: 1670920 markings, 7273362 edges, 15826 markings/sec, 90 secs
lola: 1753955 markings, 7713664 edges, 16607 markings/sec, 95 secs
lola: 1841207 markings, 8173057 edges, 17450 markings/sec, 100 secs
lola: 1928484 markings, 8658394 edges, 17455 markings/sec, 105 secs
lola: 2012416 markings, 9108493 edges, 16786 markings/sec, 110 secs
lola: 2099344 markings, 9549364 edges, 17386 markings/sec, 115 secs
lola: 2181748 markings, 9950777 edges, 16481 markings/sec, 120 secs
lola: 2260326 markings, 10340729 edges, 15716 markings/sec, 125 secs
lola: 2342044 markings, 10753677 edges, 16344 markings/sec, 130 secs
lola: 2423937 markings, 11196614 edges, 16379 markings/sec, 135 secs
lola: 2516687 markings, 11666695 edges, 18550 markings/sec, 140 secs
lola: 2608437 markings, 12018552 edges, 18350 markings/sec, 145 secs
lola: 2701002 markings, 12411794 edges, 18513 markings/sec, 150 secs
lola: 2794238 markings, 12804267 edges, 18647 markings/sec, 155 secs
lola: 2879695 markings, 13172030 edges, 17091 markings/sec, 160 secs
lola: 2961720 markings, 13575702 edges, 16405 markings/sec, 165 secs
lola: 3052651 markings, 14017069 edges, 18186 markings/sec, 170 secs
lola: 3138303 markings, 14412754 edges, 17130 markings/sec, 175 secs
lola: 3220724 markings, 14846617 edges, 16484 markings/sec, 180 secs
lola: 3302378 markings, 15292124 edges, 16331 markings/sec, 185 secs
lola: 3383794 markings, 15722128 edges, 16283 markings/sec, 190 secs
lola: 3464808 markings, 16129464 edges, 16203 markings/sec, 195 secs
lola: 3545966 markings, 16597308 edges, 16232 markings/sec, 200 secs
lola: 3629825 markings, 17126632 edges, 16772 markings/sec, 205 secs
lola: 3716693 markings, 17593817 edges, 17374 markings/sec, 210 secs
lola: 3807083 markings, 17997391 edges, 18078 markings/sec, 215 secs
lola: 3894295 markings, 18389549 edges, 17442 markings/sec, 220 secs
lola: 3979141 markings, 18809471 edges, 16969 markings/sec, 225 secs
lola: 4057528 markings, 19204166 edges, 15677 markings/sec, 230 secs
lola: 4139682 markings, 19647278 edges, 16431 markings/sec, 235 secs
lola: 4220864 markings, 20138601 edges, 16236 markings/sec, 240 secs
lola: 4305894 markings, 20632436 edges, 17006 markings/sec, 245 secs
lola: 4392871 markings, 21037151 edges, 17395 markings/sec, 250 secs
lola: 4479801 markings, 21464886 edges, 17386 markings/sec, 255 secs
lola: 4558693 markings, 21886451 edges, 15778 markings/sec, 260 secs
lola: 4639907 markings, 22316465 edges, 16243 markings/sec, 265 secs
lola: 4713380 markings, 22737743 edges, 14695 markings/sec, 270 secs
lola: 4793905 markings, 23184772 edges, 16105 markings/sec, 275 secs
lola: 4872070 markings, 23701409 edges, 15633 markings/sec, 280 secs
lola: 4952686 markings, 24228875 edges, 16123 markings/sec, 285 secs
lola: 5044928 markings, 24614429 edges, 18448 markings/sec, 290 secs
lola: 5133932 markings, 24990772 edges, 17801 markings/sec, 295 secs
lola: 5218557 markings, 25392346 edges, 16925 markings/sec, 300 secs
lola: 5309926 markings, 25793913 edges, 18274 markings/sec, 305 secs
lola: 5398035 markings, 26171578 edges, 17622 markings/sec, 310 secs
lola: 5489329 markings, 26559738 edges, 18259 markings/sec, 315 secs
lola: 5575871 markings, 26956034 edges, 17308 markings/sec, 320 secs
lola: 5664594 markings, 27335874 edges, 17745 markings/sec, 325 secs
lola: 5748455 markings, 27725703 edges, 16772 markings/sec, 330 secs
lola: 5833323 markings, 28130703 edges, 16974 markings/sec, 335 secs
lola: 5920708 markings, 28529534 edges, 17477 markings/sec, 340 secs
lola: 6004243 markings, 28918856 edges, 16707 markings/sec, 345 secs
lola: 6084385 markings, 29320200 edges, 16028 markings/sec, 350 secs
lola: 6168907 markings, 29747735 edges, 16904 markings/sec, 355 secs
lola: 6250287 markings, 30205901 edges, 16276 markings/sec, 360 secs
lola: 6334090 markings, 30647752 edges, 16761 markings/sec, 365 secs
lola: 6411120 markings, 31102334 edges, 15406 markings/sec, 370 secs
lola: 6494784 markings, 31545112 edges, 16733 markings/sec, 375 secs
lola: 6577193 markings, 31998512 edges, 16482 markings/sec, 380 secs
lola: 6663516 markings, 32419186 edges, 17265 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((A31 <= A22) U (1 <= A2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (((A31 <= A22) U (1 <= A2)))))
lola: processed formula: A (G (F (((A31 <= A22) U (1 <= A2)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 30 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: 25 markings, 26 edges
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((3 <= A29))) U (1 <= A3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (G ((3 <= A29))) U (1 <= A3)))
lola: processed formula: A ((X (G ((3 <= A29))) U (1 <= A3)))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 30 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 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((A27 <= B16) U ((3 <= A12) U (1 <= A15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((A27 <= B16) U ((3 <= A12) U (1 <= A15))))
lola: processed formula: A (((A27 <= B16) U ((3 <= A12) U (1 <= A15))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 30 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: 17 markings, 17 edges
lola: ========================================
lola: subprocess 11 will run for 629 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((3 <= B6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X ((3 <= B6))))
lola: processed formula: A (X (X ((3 <= B6))))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 29 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 12 will run for 786 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((B30 <= B28))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (B30 <= B28)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-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 1048 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (((B13 <= A15) U (3 <= A15)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (((B13 <= A15) U (3 <= A15)))))
lola: processed formula: A (F (X (((B13 <= A15) U (3 <= A15)))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 30 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 14 will run for 1573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= A30) U G ((2 <= A1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((1 <= A30) U G ((2 <= A1)))))
lola: processed formula: A (X (((1 <= A30) U G ((2 <= A1)))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 29 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 15 will run for 3146 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= A11)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= A11)))
lola: processed formula: A (F ((2 <= A11)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 31 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: 17 markings, 17 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes yes unknown no yes no no yes no no no
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DNAwalker-PT-16redondantChoiceR"
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/DNAwalker-PT-16redondantChoiceR.tgz
mv DNAwalker-PT-16redondantChoiceR 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 DNAwalker-PT-16redondantChoiceR, 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-152732261800257"
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 ;