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 304K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 17K 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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 14 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 135K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is DNAwalker-PT-14ringLRLarge, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-152649744200318
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526759590733


BK_STOP 1526760678547

--------------------
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-14ringLRLarge as instance name.
Using DNAwalker as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': 106551, 'Memory': 9315.71, 'Tool': 'marcie'}, {'Time': 107924, 'Memory': 9315.71, 'Tool': 'marcie'}, {'Time': 579061, 'Memory': 3653.06, 'Tool': 'itstools'}, {'Time': 582713, 'Memory': 3651.28, 'Tool': 'itstools'}, {'Time': 1245549, 'Memory': 6552.77, 'Tool': 'lola'}, {'Time': 1245633, 'Memory': 6789.11, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 11.689697891150717x far from the best tool marcie.
CTLCardinality lola DNAwalker-PT-14ringLRLarge...

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


checking for too many tokens
===========================================================================================
DNAwalker-PT-14ringLRLarge: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ DNAwalker-PT-14ringLRLarge @ 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: 345/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 312 transitions, 33 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 197 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: NOT(NOT(E (G (((1 <= B3) OR (1 <= A5)))))) : NOT(NOT(E (G (((1 <= A20) OR (1 <= A12)))))) : (E (G (((1 <= A16) OR (A9 <= A23)))) OR (3 <= B3)) : (A (X ((A26 <= B26))) OR ((A (F ((2 <= A15))) OR ((A8 + 1 <= A15) OR (B26 <= 0))) AND (((B27 <= 0) AND (A6 <= 1)) OR E (G ((A19 <= A11)))))) : A ((((A10 <= A19) OR (A20 + 1 <= A24)) U ((A1 <= 2) AND (A1 + 1 <= A4)))) : A (G (E (F ((A8 <= A13))))) : E (X (E (G (((2 <= A25) OR (A4 <= A10)))))) : E (((A14 <= 1) U E (G ((3 <= A27))))) : E (G (NOT(A (X ((A12 <= A16)))))) : E (G ((A (G ((2 <= A19))) OR (((A1 <= A6) OR (A26 <= A7)) AND (A16 <= B26))))) : E (F (((A15 <= B26) AND ((3 <= A25) OR (3 <= A24)) AND (1 <= A7)))) : ((NOT(A (F ((3 <= A21)))) AND E (F (((A21 <= A7) AND (2 <= A27))))) AND (A (X ((A15 + 1 <= A10))) OR (E (F ((A27 <= A21))) OR A (G ((A25 <= B2)))))) : E (F (((A24 <= 2) AND (A22 <= 0)))) : ((B13 <= A3) OR A (F (((1 <= A8) AND (3 <= A13) AND (B27 <= 0))))) : A (G ((A (G ((3 <= A16))) OR E (F ((1 <= A2)))))) : A (F (A (G ((A9 <= A8)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (G (((1 <= B3) OR (1 <= A5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((B3 <= 0) AND (A5 <= 0))))
lola: processed formula length: 40
lola: 8 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (G (((1 <= A20) OR (1 <= A12))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((A20 <= 0) AND (A12 <= 0))))
lola: processed formula length: 42
lola: 8 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((1 <= A16) OR (A9 <= A23)))) OR (3 <= B3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= A16) OR (A9 <= A23))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((A16 <= 0) AND (A23 + 1 <= A9))))
lola: processed formula length: 47
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X ((A26 <= B26))) OR ((A (F ((2 <= A15))) OR ((A8 + 1 <= A15) OR (B26 <= 0))) AND (((B27 <= 0) AND (A6 <= 1)) OR E (G ((A19 <= A11))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((A26 <= B26)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((A26 <= B26)))
lola: processed formula: A (X ((A26 <= B26)))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 34 markings, 34 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= A15)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= A15)))
lola: processed formula: A (F ((2 <= A15)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 9 markings, 9 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A8 + 1 <= A15) OR (B26 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((A8 + 1 <= A15) OR (B26 <= 0))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: processed formula with 2 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((A10 <= A19) OR (A20 + 1 <= A24)) U ((A1 <= 2) AND (A1 + 1 <= A4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((A10 <= A19) OR (A20 + 1 <= A24)) U ((A1 <= 2) AND (A1 + 1 <= A4))))
lola: processed formula: A ((((A10 <= A19) OR (A20 + 1 <= A24)) U ((A1 <= 2) AND (A1 + 1 <= A4))))
lola: processed formula length: 74
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1471 markings, 1470 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((A8 <= A13)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (A8 <= A13)))))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 152591 markings, 686229 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((2 <= A25) OR (A4 <= A10))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U ((A25 <= 1) AND (A10 + 1 <= A4)))))
lola: processed formula length: 51
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 12 markings, 12 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((A14 <= 1) U E (G ((3 <= A27)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((A14 <= 1) U NOT(A(TRUE U (A27 <= 2))))
lola: processed formula length: 41
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 930183 markings, 4095349 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1729969 markings, 8015068 edges, 159957 markings/sec, 5 secs
lola: 2506294 markings, 11938314 edges, 155265 markings/sec, 10 secs
lola: 3322319 markings, 15514496 edges, 163205 markings/sec, 15 secs
lola: 3990673 markings, 19576747 edges, 133671 markings/sec, 20 secs
lola: 4528390 markings, 22980039 edges, 107543 markings/sec, 25 secs
lola: 5114051 markings, 26596387 edges, 117132 markings/sec, 30 secs
lola: 5647435 markings, 30523841 edges, 106677 markings/sec, 35 secs
lola: 6193254 markings, 34156062 edges, 109164 markings/sec, 40 secs
lola: 6771239 markings, 37836934 edges, 115597 markings/sec, 45 secs
lola: 7274016 markings, 41260399 edges, 100555 markings/sec, 50 secs
lola: 7856214 markings, 44936974 edges, 116440 markings/sec, 55 secs
lola: 8333189 markings, 48866161 edges, 95395 markings/sec, 60 secs
lola: 8768644 markings, 52344664 edges, 87091 markings/sec, 65 secs
lola: 9202533 markings, 56220117 edges, 86778 markings/sec, 70 secs
lola: 9828108 markings, 60191220 edges, 125115 markings/sec, 75 secs
lola: 10397091 markings, 63910931 edges, 113797 markings/sec, 80 secs
lola: 10888194 markings, 67659831 edges, 98221 markings/sec, 85 secs
lola: 11334719 markings, 71353701 edges, 89305 markings/sec, 90 secs
lola: 11805521 markings, 75084635 edges, 94160 markings/sec, 95 secs
lola: 12276167 markings, 78728004 edges, 94129 markings/sec, 100 secs
lola: 12705173 markings, 82348459 edges, 85801 markings/sec, 105 secs
lola: 13082327 markings, 85968245 edges, 75431 markings/sec, 110 secs
lola: 13741728 markings, 89951683 edges, 131880 markings/sec, 115 secs
lola: 14440556 markings, 93632068 edges, 139766 markings/sec, 120 secs
lola: 15088906 markings, 97008956 edges, 129670 markings/sec, 125 secs
lola: 15694333 markings, 100373548 edges, 121085 markings/sec, 130 secs
lola: 16343648 markings, 104389922 edges, 129863 markings/sec, 135 secs
lola: 16890911 markings, 107819672 edges, 109453 markings/sec, 140 secs
lola: 17472966 markings, 111608332 edges, 116411 markings/sec, 145 secs
lola: 17992097 markings, 115149735 edges, 103826 markings/sec, 150 secs
lola: 18501663 markings, 118944756 edges, 101913 markings/sec, 155 secs
lola: 19032498 markings, 122513811 edges, 106167 markings/sec, 160 secs
lola: 19726807 markings, 126035266 edges, 138862 markings/sec, 165 secs
lola: 20370504 markings, 129331199 edges, 128739 markings/sec, 170 secs
lola: 20933277 markings, 132357066 edges, 112555 markings/sec, 175 secs
lola: 21507631 markings, 136173326 edges, 114871 markings/sec, 180 secs
lola: 22024633 markings, 139909095 edges, 103400 markings/sec, 185 secs
lola: 22509467 markings, 143347589 edges, 96967 markings/sec, 190 secs
lola: 22932926 markings, 146444711 edges, 84692 markings/sec, 195 secs
lola: 23414538 markings, 149812392 edges, 96322 markings/sec, 200 secs
lola: 23998445 markings, 153515381 edges, 116781 markings/sec, 205 secs
lola: 24491113 markings, 156625290 edges, 98534 markings/sec, 210 secs
lola: 24971536 markings, 160475028 edges, 96085 markings/sec, 215 secs
lola: 25404680 markings, 164142541 edges, 86629 markings/sec, 220 secs
lola: 25774828 markings, 167206357 edges, 74030 markings/sec, 225 secs
lola: 26294786 markings, 170868196 edges, 103992 markings/sec, 230 secs
lola: 26757054 markings, 174095684 edges, 92454 markings/sec, 235 secs
lola: 27201142 markings, 177748213 edges, 88818 markings/sec, 240 secs
lola: 27592330 markings, 181239086 edges, 78238 markings/sec, 245 secs
lola: 27927176 markings, 184290015 edges, 66969 markings/sec, 250 secs
lola: 28373734 markings, 187912428 edges, 89312 markings/sec, 255 secs
lola: 28763247 markings, 191586050 edges, 77903 markings/sec, 260 secs
lola: 29084672 markings, 194846817 edges, 64285 markings/sec, 265 secs
lola: 29648900 markings, 198538181 edges, 112846 markings/sec, 270 secs
lola: 30121498 markings, 201865127 edges, 94520 markings/sec, 275 secs
lola: 30541271 markings, 204825698 edges, 83955 markings/sec, 280 secs
lola: 31016212 markings, 208611268 edges, 94988 markings/sec, 285 secs
lola: 31412186 markings, 211785027 edges, 79195 markings/sec, 290 secs
lola: 31806800 markings, 215198764 edges, 78923 markings/sec, 295 secs
lola: 32179763 markings, 218661080 edges, 74593 markings/sec, 300 secs
lola: 32595777 markings, 221471612 edges, 83203 markings/sec, 305 secs
lola: 33106685 markings, 225117515 edges, 102182 markings/sec, 310 secs
lola: 33505455 markings, 228009615 edges, 79754 markings/sec, 315 secs
lola: 33957074 markings, 231923657 edges, 90324 markings/sec, 320 secs
lola: 34310886 markings, 235137184 edges, 70762 markings/sec, 325 secs
lola: 34616921 markings, 237975324 edges, 61207 markings/sec, 330 secs
lola: 34971490 markings, 240792252 edges, 70914 markings/sec, 335 secs
lola: 35376218 markings, 244192027 edges, 80946 markings/sec, 340 secs
lola: 35752677 markings, 247777951 edges, 75292 markings/sec, 345 secs
lola: 36051202 markings, 250855702 edges, 59705 markings/sec, 350 secs
lola: 36394135 markings, 253903422 edges, 68587 markings/sec, 355 secs
lola: 36752148 markings, 257116923 edges, 71603 markings/sec, 360 secs
lola: 37116329 markings, 260979629 edges, 72836 markings/sec, 365 secs
lola: 37397814 markings, 263923954 edges, 56297 markings/sec, 370 secs
lola: 37754907 markings, 267671181 edges, 71419 markings/sec, 375 secs
lola: 38141395 markings, 271276722 edges, 77298 markings/sec, 380 secs
lola: 38685419 markings, 274976122 edges, 108805 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: E (G (NOT(A (X ((A12 <= A16))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((A16 + 1 <= A12)))))
lola: processed formula length: 40
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (G ((2 <= A19))) OR (((A1 <= A6) OR (A26 <= A7)) AND (A16 <= B26)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (E(TRUE U (A19 <= 1)) AND (((A6 + 1 <= A1) AND (A7 + 1 <= A26)) OR (B26 + 1 <= A16)))))
lola: processed formula length: 101
lola: 6 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 16 markings, 32 edges
lola: ========================================
lola: subprocess 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((A15 <= B26) AND ((3 <= A25) OR (3 <= A24)) AND (1 <= A7))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-14ringLRLarge-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-14ringLRLarge-CTLCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 418368 markings, 848091 edges, 83674 markings/sec, 0 secs
lola: sara is running 5 secs || 798054 markings, 2076388 edges, 75937 markings/sec, 5 secs
lola: sara is running 10 secs || 1173176 markings, 3220179 edges, 75024 markings/sec, 10 secs
lola: sara is running 15 secs || 1508517 markings, 4443627 edges, 67068 markings/sec, 15 secs
lola: sara is running 20 secs || 1901870 markings, 5589824 edges, 78671 markings/sec, 20 secs
lola: sara is running 25 secs || 2228295 markings, 6865042 edges, 65285 markings/sec, 25 secs
lola: sara is running 30 secs || 2543798 markings, 8039807 edges, 63101 markings/sec, 30 secs
lola: sara is running 35 secs || 2893400 markings, 9023619 edges, 69920 markings/sec, 35 secs
lola: sara is running 40 secs || 3217872 markings, 10309770 edges, 64894 markings/sec, 40 secs
lola: sara is running 45 secs || 3540860 markings, 11640564 edges, 64598 markings/sec, 45 secs
lola: sara is running 50 secs || 3902265 markings, 12677423 edges, 72281 markings/sec, 50 secs
lola: sara is running 55 secs || 4241962 markings, 13989346 edges, 67939 markings/sec, 55 secs
lola: sara is running 60 secs || 4531697 markings, 15255106 edges, 57947 markings/sec, 60 secs
lola: sara is running 65 secs || 4859857 markings, 16371494 edges, 65632 markings/sec, 65 secs
lola: sara is running 70 secs || 5238216 markings, 17327810 edges, 75672 markings/sec, 70 secs
lola: sara is running 75 secs || 5607566 markings, 18593879 edges, 73870 markings/sec, 75 secs
lola: sara is running 80 secs || 5965439 markings, 19837093 edges, 71575 markings/sec, 80 secs
lola: sara is running 85 secs || 6300014 markings, 20902003 edges, 66915 markings/sec, 85 secs
lola: sara is running 90 secs || 6656550 markings, 22133011 edges, 71307 markings/sec, 90 secs
lola: sara is running 95 secs || 7001008 markings, 23399508 edges, 68892 markings/sec, 95 secs
lola: sara is running 100 secs || 7310022 markings, 24686993 edges, 61803 markings/sec, 100 secs
lola: sara is running 105 secs || 7607064 markings, 25928911 edges, 59408 markings/sec, 105 secs
lola: sara is running 110 secs || 7944563 markings, 26937529 edges, 67500 markings/sec, 110 secs
lola: sara is running 115 secs || 8263486 markings, 28171076 edges, 63785 markings/sec, 115 secs
lola: sara is running 120 secs || 8570032 markings, 29555606 edges, 61309 markings/sec, 120 secs
lola: sara is running 125 secs || 8851249 markings, 30806128 edges, 56243 markings/sec, 125 secs
lola: sara is running 130 secs || 9131579 markings, 31957053 edges, 56066 markings/sec, 130 secs
lola: sara is running 135 secs || 9394384 markings, 33290603 edges, 52561 markings/sec, 135 secs
lola: sara is running 140 secs || 9658693 markings, 34601873 edges, 52862 markings/sec, 140 secs
lola: sara is running 145 secs || 9939867 markings, 35775841 edges, 56235 markings/sec, 145 secs
lola: sara is running 150 secs || 10211074 markings, 37027513 edges, 54241 markings/sec, 150 secs
lola: sara is running 155 secs || 10472444 markings, 38403208 edges, 52274 markings/sec, 155 secs
lola: sara is running 160 secs || 10758348 markings, 39498957 edges, 57181 markings/sec, 160 secs
lola: sara is running 165 secs || 11022976 markings, 40807134 edges, 52926 markings/sec, 165 secs
lola: sara is running 170 secs || 11292959 markings, 42004302 edges, 53997 markings/sec, 170 secs
lola: sara is running 175 secs || 11567780 markings, 43169563 edges, 54964 markings/sec, 175 secs
lola: sara is running 180 secs || 11880034 markings, 44296955 edges, 62451 markings/sec, 180 secs
lola: sara is running 185 secs || 12270366 markings, 45267954 edges, 78066 markings/sec, 185 secs
lola: sara is running 190 secs || 12615900 markings, 46515488 edges, 69107 markings/sec, 190 secs
lola: sara is running 195 secs || 12966299 markings, 47839649 edges, 70080 markings/sec, 195 secs
lola: sara is running 200 secs || 13293123 markings, 49133819 edges, 65365 markings/sec, 200 secs
lola: sara is running 205 secs || 13605317 markings, 50373780 edges, 62439 markings/sec, 205 secs
lola: sara is running 210 secs || 13960344 markings, 51533535 edges, 71005 markings/sec, 210 secs
lola: sara is running 215 secs || 14266699 markings, 52880149 edges, 61271 markings/sec, 215 secs
lola: sara is running 220 secs || 14594494 markings, 53959592 edges, 65559 markings/sec, 220 secs
lola: sara is running 225 secs || 14907594 markings, 55287285 edges, 62620 markings/sec, 225 secs
lola: sara is running 230 secs || 15204527 markings, 56587096 edges, 59387 markings/sec, 230 secs
lola: sara is running 235 secs || 15519532 markings, 57768830 edges, 63001 markings/sec, 235 secs
lola: sara is running 240 secs || 15826564 markings, 58959551 edges, 61406 markings/sec, 240 secs
lola: sara is running 245 secs || 16156562 markings, 60125567 edges, 66000 markings/sec, 245 secs
lola: sara is running 250 secs || 16446309 markings, 61334740 edges, 57949 markings/sec, 250 secs
lola: sara is running 255 secs || 16719622 markings, 62476021 edges, 54663 markings/sec, 255 secs
lola: sara is running 260 secs || 16993327 markings, 63657613 edges, 54741 markings/sec, 260 secs
lola: sara is running 265 secs || 17260670 markings, 64896734 edges, 53469 markings/sec, 265 secs
lola: sara is running 270 secs || 17558924 markings, 66052342 edges, 59651 markings/sec, 270 secs
lola: sara is running 275 secs || 17847201 markings, 67216148 edges, 57655 markings/sec, 275 secs
lola: sara is running 280 secs || 18146758 markings, 68419605 edges, 59911 markings/sec, 280 secs
lola: sara is running 285 secs || 18415928 markings, 69619093 edges, 53834 markings/sec, 285 secs
lola: sara is running 290 secs || 18701068 markings, 70773058 edges, 57028 markings/sec, 290 secs
lola: sara is running 295 secs || 19012127 markings, 71932924 edges, 62212 markings/sec, 295 secs
lola: sara is running 300 secs || 19293608 markings, 73053318 edges, 56296 markings/sec, 300 secs
lola: sara is running 305 secs || 19570882 markings, 74115543 edges, 55455 markings/sec, 305 secs
lola: sara is running 310 secs || 19824959 markings, 75422755 edges, 50815 markings/sec, 310 secs
lola: sara is running 315 secs || 20078778 markings, 76710000 edges, 50764 markings/sec, 315 secs
lola: sara is running 320 secs || 20335789 markings, 78165800 edges, 51402 markings/sec, 320 secs
lola: sara is running 325 secs || 20608349 markings, 79589768 edges, 54512 markings/sec, 325 secs
lola: sara is running 330 secs || 20896258 markings, 81013286 edges, 57582 markings/sec, 330 secs
lola: sara is running 335 secs || 21171026 markings, 82391963 edges, 54954 markings/sec, 335 secs
lola: sara is running 340 secs || 21454442 markings, 83784387 edges, 56683 markings/sec, 340 secs
lola: sara is running 345 secs || 21717181 markings, 85150220 edges, 52548 markings/sec, 345 secs
lola: sara is running 350 secs || 21970891 markings, 86711006 edges, 50742 markings/sec, 350 secs
lola: sara is running 355 secs || 22247539 markings, 88175405 edges, 55330 markings/sec, 355 secs
lola: sara is running 360 secs || 22534809 markings, 89454090 edges, 57454 markings/sec, 360 secs
lola: sara is running 365 secs || 22833437 markings, 90716799 edges, 59726 markings/sec, 365 secs
lola: sara is running 370 secs || 23146478 markings, 91992759 edges, 62608 markings/sec, 370 secs
lola: sara is running 375 secs || 23427149 markings, 93224274 edges, 56134 markings/sec, 375 secs
lola: sara is running 380 secs || 23713122 markings, 94434140 edges, 57195 markings/sec, 380 secs
lola: sara is running 385 secs || 23995571 markings, 95632859 edges, 56490 markings/sec, 385 secs
lola: sara is running 390 secs || 24290938 markings, 96876791 edges, 59073 markings/sec, 390 secs
lola: sara is running 395 secs || 24595178 markings, 98100823 edges, 60848 markings/sec, 395 secs
lola: sara is running 400 secs || 24876158 markings, 99296069 edges, 56196 markings/sec, 400 secs
lola: sara is running 405 secs || 25168493 markings, 100530894 edges, 58467 markings/sec, 405 secs
lola: sara is running 410 secs || 25455572 markings, 101681052 edges, 57416 markings/sec, 410 secs
lola: sara is running 415 secs || 25714460 markings, 103059287 edges, 51778 markings/sec, 415 secs
lola: sara is running 420 secs || 25966517 markings, 104513308 edges, 50411 markings/sec, 420 secs
lola: sara is running 425 secs || 26252199 markings, 105912399 edges, 57136 markings/sec, 425 secs
lola: sara is running 430 secs || 26512875 markings, 107333424 edges, 52135 markings/sec, 430 secs
lola: sara is running 435 secs || 26784355 markings, 108759126 edges, 54296 markings/sec, 435 secs
lola: sara is running 440 secs || 27043076 markings, 110193807 edges, 51744 markings/sec, 440 secs
lola: sara is running 445 secs || 27329074 markings, 111464713 edges, 57200 markings/sec, 445 secs
lola: sara is running 450 secs || 27619272 markings, 112715337 edges, 58040 markings/sec, 450 secs
lola: sara is running 455 secs || 27910397 markings, 113972952 edges, 58225 markings/sec, 455 secs
lola: sara is running 460 secs || 28191693 markings, 115125261 edges, 56259 markings/sec, 460 secs
lola: sara is running 465 secs || 28475382 markings, 116274357 edges, 56738 markings/sec, 465 secs
lola: sara is running 470 secs || 28773653 markings, 117436704 edges, 59654 markings/sec, 470 secs
lola: sara is running 475 secs || 29074508 markings, 118630784 edges, 60171 markings/sec, 475 secs
lola: sara is running 480 secs || 29338022 markings, 119998649 edges, 52703 markings/sec, 480 secs
lola: sara is running 485 secs || 29607701 markings, 121352351 edges, 53936 markings/sec, 485 secs
lola: sara is running 490 secs || 29862898 markings, 122728396 edges, 51039 markings/sec, 490 secs
lola: sara is running 495 secs || 30130221 markings, 124090688 edges, 53465 markings/sec, 495 secs
lola: sara is running 500 secs || 30410917 markings, 125401842 edges, 56139 markings/sec, 500 secs
lola: sara is running 505 secs || 30698170 markings, 126634457 edges, 57451 markings/sec, 505 secs
lola: sara is running 510 secs || 30985569 markings, 127862857 edges, 57480 markings/sec, 510 secs
lola: sara is running 515 secs || 31260440 markings, 129065102 edges, 54974 markings/sec, 515 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 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(A (F ((3 <= A21)))) AND E (F (((A21 <= A7) AND (2 <= A27))))) AND (A (X ((A15 + 1 <= A10))) OR (E (F ((A27 <= A21))) OR A (G ((A25 <= B2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A21 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= A21)))
lola: processed formula length: 25
lola: 6 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 12 will run for 655 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((A21 <= A7) AND (2 <= A27))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: state equation: write sara problem file to DNAwalker-PT-14ringLRLarge-CTLCardinality-12.sara
lola: ========================================
lola: subprocess 13 will run for 874 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((A15 + 1 <= A10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((A15 + 1 <= A10)))
lola: processed formula: A (X ((A15 + 1 <= A10)))
lola: processed formula length: 24
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 14 will run for 1311 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A27 <= A21)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to DNAwalker-PT-14ringLRLarge-CTLCardinality-14.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 655 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((A24 <= 2) AND (A22 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to DNAwalker-PT-14ringLRLarge-CTLCardinality-12.sara
lola: subprocess 13 will run for 874 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((B13 <= A3) OR A (F (((1 <= A8) AND (3 <= A13) AND (B27 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 13 will run for 874 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (B13 <= A3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (B13 <= A3)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1311 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= A8) AND (3 <= A13) AND (B27 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((1 <= A8) AND (3 <= A13) AND (B27 <= 0))))
lola: processed formula: A (F (((1 <= A8) AND (3 <= A13) AND (B27 <= 0))))
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 9 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1311 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((3 <= A16))) OR E (F ((1 <= A2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (E(TRUE U (A16 <= 2)) AND NOT(E(TRUE U (1 <= A2))))))
lola: processed formula length: 66
lola: 6 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 992470 markings, 3528501 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1863090 markings, 6840869 edges, 174124 markings/sec, 5 secs
lola: 2684498 markings, 9735028 edges, 164282 markings/sec, 10 secs
lola: 3443796 markings, 13253464 edges, 151860 markings/sec, 15 secs
lola: 4073590 markings, 16688709 edges, 125959 markings/sec, 20 secs
lola: 4721888 markings, 20086994 edges, 129660 markings/sec, 25 secs
lola: 5354117 markings, 23522868 edges, 126446 markings/sec, 30 secs
lola: 5912698 markings, 26901983 edges, 111716 markings/sec, 35 secs
lola: 6414504 markings, 29978642 edges, 100361 markings/sec, 40 secs
lola: 7124652 markings, 33858424 edges, 142030 markings/sec, 45 secs
lola: 7660789 markings, 36809338 edges, 107227 markings/sec, 50 secs
lola: 8170765 markings, 39948599 edges, 101995 markings/sec, 55 secs
lola: 8589073 markings, 43060209 edges, 83662 markings/sec, 60 secs
lola: 9081871 markings, 46484112 edges, 98560 markings/sec, 65 secs
lola: 9462417 markings, 49328956 edges, 76109 markings/sec, 70 secs
lola: 9959482 markings, 52808030 edges, 99413 markings/sec, 75 secs
lola: 10582280 markings, 56224283 edges, 124560 markings/sec, 80 secs
lola: 11123851 markings, 59601316 edges, 108314 markings/sec, 85 secs
lola: 11559164 markings, 62670021 edges, 87063 markings/sec, 90 secs
lola: 11981584 markings, 65721905 edges, 84484 markings/sec, 95 secs
lola: 12429750 markings, 68848455 edges, 89633 markings/sec, 100 secs
lola: 12870833 markings, 71932020 edges, 88217 markings/sec, 105 secs
lola: 13260703 markings, 74950246 edges, 77974 markings/sec, 110 secs
lola: 13623179 markings, 77949607 edges, 72495 markings/sec, 115 secs
lola: 13947401 markings, 81055625 edges, 64844 markings/sec, 120 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 13952265 markings, 81110465 edges
lola: ========================================
lola: subprocess 15 will run for 2497 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((A9 <= A8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((A9 <= A8)))))
lola: processed formula: A (F (A (G ((A9 <= A8)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 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: 16 markings, 20 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes no yes unknown yes yes unknown yes no no no no
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DNAwalker-PT-14ringLRLarge"
export BK_EXAMINATION="CTLCardinality"
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/DNAwalker-PT-14ringLRLarge.tgz
mv DNAwalker-PT-14ringLRLarge 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 DNAwalker-PT-14ringLRLarge, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r071-smll-152649744200318"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;