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 208K
-rw-r--r-- 1 mcc users 3.6K 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.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.0K 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.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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 46K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is NeighborGrid-PT-d3n3m1t11, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666478200220
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527291369734


BK_STOP 1527292253155

--------------------
content from stderr:

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using NeighborGrid-PT-d3n3m1t11 as instance name.
Using NeighborGrid 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': True, 'Simple Free Choice': True, 'Extended Free Choice': True, 'State Machine': True, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 12547, 'Memory': 352.62, 'Tool': 'itstools'}, {'Time': 32263, 'Memory': 7708.19, 'Tool': 'marcie'}, {'Time': 92437, 'Memory': 1186.07, 'Tool': 'gspn'}, {'Time': 1151150, 'Memory': 15134.2, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 91.74703116282777x far from the best tool itstools.
CTLCardinality lola NeighborGrid-PT-d3n3m1t11...

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


checking for too many tokens
===========================================================================================
NeighborGrid-PT-d3n3m1t11: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ NeighborGrid-PT-d3n3m1t11 @ 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: 189/65536 symbol table entries, 8 collisions
lola: preprocessing...
lola: finding significant places
lola: 27 places, 162 transitions, 26 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 27 transition conflict sets
lola: TASK
lola: reading formula from NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: A (G (((p_2_1_1 <= p_0_0_1) OR (1 <= p_1_0_1) OR (p_2_0_2 <= 1) OR (2 <= p_0_1_1)))) : E (((((2 <= p_0_2_2) OR (p_2_0_2 <= p_0_2_1)) AND (p_0_1_2 <= p_2_2_1)) U A (X ((3 <= p_1_2_2))))) : E (X (A (G (((p_2_1_0 <= p_2_1_2) OR (3 <= p_1_0_1)))))) : E (X (A (G ((p_0_1_1 + 1 <= p_1_1_2))))) : A (X (A (F (((1 <= p_0_0_2) AND (p_1_0_0 <= p_2_2_2)))))) : A (G (E (F ((p_2_2_1 <= 0))))) : (((p_0_2_1 <= p_0_1_1) OR (p_2_2_1 <= p_2_1_2) OR (p_0_2_2 <= p_0_2_1) OR ((2 <= p_1_1_0) AND (1 <= p_0_0_1) AND ((1 <= p_0_1_2) OR (p_2_0_0 <= p_1_1_1))) OR (p_0_1_1 <= p_0_0_1)) AND E (X (A (X ((1 <= p_0_0_0)))))) : E (((((3 <= p_1_0_1) OR (1 <= p_2_2_1)) AND ((3 <= p_1_1_0) OR (p_1_2_1 <= p_0_2_1))) U E (X ((3 <= p_0_0_2))))) : (E (X (A (X ((2 <= p_0_1_1))))) OR A (F ((2 <= p_0_2_2)))) : E (F (A (X (((1 <= p_2_1_2) AND (p_1_1_2 <= p_2_2_0)))))) : (E (G ((1 <= p_0_0_0))) AND A (G (E (F ((1 <= p_0_1_2)))))) : ((A (((1 <= p_1_0_0) U (2 <= p_2_0_0))) OR E (X (((1 <= p_0_2_1))))) AND E (F (E (G ((2 <= p_2_1_0)))))) : NOT(A (G (A (F ((1 <= p_1_2_1)))))) : (A (X (E (X ((1 <= p_2_2_0))))) AND (p_0_2_2 <= p_0_0_0)) : E (F (A (X ((p_0_2_0 + 1 <= p_2_0_1))))) : (((1 <= p_0_1_2) AND E (F ((p_0_2_2 + 1 <= p_2_1_2)))) AND E (F (E (G ((2 <= p_1_1_2))))))
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 (G (((p_2_1_1 <= p_0_0_1) OR (1 <= p_1_0_1) OR (p_2_0_2 <= 1) OR (2 <= p_0_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((((2 <= p_0_2_2) OR (p_2_0_2 <= p_0_2_1)) AND (p_0_1_2 <= p_2_2_1)) U A (X ((3 <= p_1_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((((2 <= p_0_2_2) OR (p_2_0_2 <= p_0_2_1)) AND (p_0_1_2 <= p_2_2_1)) U AX((3 <= p_1_2_2)))
lola: processed formula length: 92
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: 2471 markings, 4228 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (((p_2_1_0 <= p_2_1_2) OR (3 <= p_1_0_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U ((p_2_1_2 + 1 <= p_2_1_0) AND (p_1_0_1 <= 2)))))
lola: processed formula length: 64
lola: 3 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 13296 markings, 20597 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((p_0_1_1 + 1 <= p_1_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (p_1_1_2 <= p_0_1_1))))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 238 markings, 238 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((1 <= p_0_0_2) AND (p_1_0_0 <= p_2_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U ((1 <= p_0_0_2) AND (p_1_0_0 <= p_2_2_2))))
lola: processed formula length: 55
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((p_2_2_1 <= 0)))))
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 (p_2_2_1 <= 0)))))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: 851287 markings, 3639371 edges, 3689330178019819520 markings/sec, 0 secs
lola: 1569143 markings, 6901147 edges, 143571 markings/sec, 5 secs
lola: 2234140 markings, 9989357 edges, 132999 markings/sec, 10 secs
lola: 2867280 markings, 12972001 edges, 126628 markings/sec, 15 secs
lola: 3474311 markings, 15882604 edges, 121406 markings/sec, 20 secs
lola: 4122720 markings, 18914441 edges, 129682 markings/sec, 25 secs
lola: 4767483 markings, 21934681 edges, 128953 markings/sec, 30 secs
lola: 5346886 markings, 24736064 edges, 115881 markings/sec, 35 secs
lola: 5957449 markings, 27674324 edges, 122113 markings/sec, 40 secs
lola: 6519007 markings, 30414023 edges, 112312 markings/sec, 45 secs
lola: 7077131 markings, 33135764 edges, 111625 markings/sec, 50 secs
lola: 7669499 markings, 35999361 edges, 118474 markings/sec, 55 secs
lola: 8218227 markings, 38697975 edges, 109746 markings/sec, 60 secs
lola: 8761419 markings, 41354698 edges, 108638 markings/sec, 65 secs
lola: 9308984 markings, 44050914 edges, 109513 markings/sec, 70 secs
lola: 9836299 markings, 46677672 edges, 105463 markings/sec, 75 secs
lola: 10387452 markings, 49391423 edges, 110231 markings/sec, 80 secs
lola: 10938360 markings, 52096440 edges, 110182 markings/sec, 85 secs
lola: 11517143 markings, 54916639 edges, 115757 markings/sec, 90 secs
lola: 12037241 markings, 57488652 edges, 104020 markings/sec, 95 secs
lola: 12543643 markings, 60035919 edges, 101280 markings/sec, 100 secs
lola: 13095962 markings, 62762597 edges, 110464 markings/sec, 105 secs
lola: 13613491 markings, 65368133 edges, 103506 markings/sec, 110 secs
lola: 14139327 markings, 68005658 edges, 105167 markings/sec, 115 secs
lola: 14655084 markings, 70603909 edges, 103151 markings/sec, 120 secs
lola: 15189659 markings, 73280565 edges, 106915 markings/sec, 125 secs
lola: 15724862 markings, 75963222 edges, 107041 markings/sec, 130 secs
lola: 16253050 markings, 78596146 edges, 105638 markings/sec, 135 secs
lola: 16776089 markings, 81232485 edges, 104608 markings/sec, 140 secs
lola: 17312571 markings, 83940518 edges, 107296 markings/sec, 145 secs
lola: 17843574 markings, 86594912 edges, 106201 markings/sec, 150 secs
lola: 18362208 markings, 89216166 edges, 103727 markings/sec, 155 secs
lola: 18855492 markings, 91734748 edges, 98657 markings/sec, 160 secs
lola: 19360570 markings, 94294482 edges, 101016 markings/sec, 165 secs
lola: 19868126 markings, 96887571 edges, 101511 markings/sec, 170 secs
lola: 20394785 markings, 99556094 edges, 105332 markings/sec, 175 secs
lola: 20911876 markings, 102185152 edges, 103418 markings/sec, 180 secs
lola: 21428294 markings, 104806492 edges, 103284 markings/sec, 185 secs
lola: 21957891 markings, 107489612 edges, 105919 markings/sec, 190 secs
lola: 22492732 markings, 110161462 edges, 106968 markings/sec, 195 secs
lola: 23027534 markings, 112847547 edges, 106960 markings/sec, 200 secs
lola: 23510467 markings, 115348766 edges, 96587 markings/sec, 205 secs
lola: 24001071 markings, 117886830 edges, 98121 markings/sec, 210 secs
lola: 24503192 markings, 120458231 edges, 100424 markings/sec, 215 secs
lola: 24993946 markings, 123006330 edges, 98151 markings/sec, 220 secs
lola: 25499325 markings, 125599196 edges, 101076 markings/sec, 225 secs
lola: 25981075 markings, 128084841 edges, 96350 markings/sec, 230 secs
lola: 26547394 markings, 130873260 edges, 113264 markings/sec, 235 secs
lola: 27045268 markings, 133439317 edges, 99575 markings/sec, 240 secs
lola: 27584027 markings, 136148199 edges, 107752 markings/sec, 245 secs
lola: 28077836 markings, 138703030 edges, 98762 markings/sec, 250 secs
lola: 28558966 markings, 141203132 edges, 96226 markings/sec, 255 secs
lola: 29050221 markings, 143707833 edges, 98251 markings/sec, 260 secs
lola: 29565950 markings, 146297875 edges, 103146 markings/sec, 265 secs
lola: 30089326 markings, 148971774 edges, 104675 markings/sec, 270 secs
lola: 30586727 markings, 151527524 edges, 99480 markings/sec, 275 secs
lola: 31081209 markings, 154082529 edges, 98896 markings/sec, 280 secs
lola: 31620113 markings, 156797554 edges, 107781 markings/sec, 285 secs
lola: 32084211 markings, 159215219 edges, 92820 markings/sec, 290 secs
lola: 32596955 markings, 161826477 edges, 102549 markings/sec, 295 secs
lola: 33108288 markings, 164461763 edges, 102267 markings/sec, 300 secs
lola: 33619867 markings, 167078353 edges, 102316 markings/sec, 305 secs
lola: 34130014 markings, 169730168 edges, 102029 markings/sec, 310 secs
lola: 34632208 markings, 172311963 edges, 100439 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p_0_2_1 <= p_0_1_1) OR (p_2_2_1 <= p_2_1_2) OR (p_0_2_2 <= p_0_2_1) OR ((2 <= p_1_1_0) AND (1 <= p_0_0_1) AND ((1 <= p_0_1_2) OR (p_2_0_0 <= p_1_1_1))) OR (p_0_1_1 <= p_0_0_1)) AND E (X (A (X ((1 <= p_0_0_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p_0_2_1 <= p_0_1_1) OR (p_2_2_1 <= p_2_1_2) OR (p_0_2_2 <= p_0_2_1) OR ((2 <= p_1_1_0) AND (1 <= p_0_0_1) AND ((1 <= p_0_1_2) OR (p_2_0_0 <= p_1_1_1))) OR (p_0_1_1 <= p_0_0_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p_0_2_1 <= p_0_1_1) OR (p_2_2_1 <= p_2_1_2) OR (p_0_2_2 <= p_0_2_1) OR ((2 <= p_1_1_0) AND (1 <= p_0_0_1) AND ((1 <= p_0_1_2) OR (p_2_0_0 <= p_1_1_1))) OR (p_0_1_1 <= p_0_0_1))
lola: processed formula length: 183
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: processed formula with 8 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 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (X ((1 <= p_0_0_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX((1 <= p_0_0_0)))
lola: processed formula length: 22
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((((3 <= p_1_0_1) OR (1 <= p_2_2_1)) AND ((3 <= p_1_1_0) OR (p_1_2_1 <= p_0_2_1))) U E (X ((3 <= p_0_0_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((((3 <= p_1_0_1) OR (1 <= p_2_2_1)) AND ((3 <= p_1_1_0) OR (p_1_2_1 <= p_0_2_1))) U EX((3 <= p_0_0_2)))
lola: processed formula length: 107
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: 572918 markings, 1244478 edges, 114571 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 572918 markings, 1244478 edges
lola: ========================================
lola: subprocess 8 will run for 401 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (A (X ((2 <= p_0_1_1))))) OR A (F ((2 <= p_0_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 401 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (X ((2 <= p_0_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX((2 <= p_0_1_1)))
lola: processed formula length: 22
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p_0_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p_0_2_2)))
lola: processed formula: A (F ((2 <= p_0_2_2)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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: 23 markings, 23 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((1 <= p_2_1_2) AND (p_1_1_2 <= p_2_2_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(((1 <= p_2_1_2) AND (p_1_1_2 <= p_2_2_0))))
lola: processed formula length: 55
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: 106 markings, 143 edges
lola: ========================================
lola: subprocess 10 will run for 535 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((1 <= p_0_0_0))) AND A (G (E (F ((1 <= p_0_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 535 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p_0_0_0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p_0_0_0 <= 0)))
lola: processed formula length: 29
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: 25 markings, 25 edges
lola: ========================================
lola: subprocess 11 will run for 642 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((1 <= p_0_1_2)))))
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 (1 <= p_0_1_2)))))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: 819849 markings, 3757613 edges, 3689330178019819520 markings/sec, 0 secs
lola: 1531972 markings, 7135182 edges, 142425 markings/sec, 5 secs
lola: 2187170 markings, 10329464 edges, 131040 markings/sec, 10 secs
lola: 2813734 markings, 13426695 edges, 125313 markings/sec, 15 secs
lola: 3413679 markings, 16418127 edges, 119989 markings/sec, 20 secs
lola: 4076034 markings, 19575990 edges, 132471 markings/sec, 25 secs
lola: 4741270 markings, 22746573 edges, 133047 markings/sec, 30 secs
lola: 5315552 markings, 25649844 edges, 114856 markings/sec, 35 secs
lola: 5948924 markings, 28723254 edges, 126674 markings/sec, 40 secs
lola: 6520378 markings, 31601459 edges, 114291 markings/sec, 45 secs
lola: 7084993 markings, 34457494 edges, 112923 markings/sec, 50 secs
lola: 7684344 markings, 37428577 edges, 119870 markings/sec, 55 secs
lola: 8231130 markings, 40213452 edges, 109357 markings/sec, 60 secs
lola: 8776604 markings, 42991566 edges, 109095 markings/sec, 65 secs
lola: 9343639 markings, 45840954 edges, 113407 markings/sec, 70 secs
lola: 9890257 markings, 48642920 edges, 109324 markings/sec, 75 secs
lola: 10462659 markings, 51504883 edges, 114480 markings/sec, 80 secs
lola: 11011682 markings, 54269618 edges, 109805 markings/sec, 85 secs
lola: 11593523 markings, 57141697 edges, 116368 markings/sec, 90 secs
lola: 12111621 markings, 59821079 edges, 103620 markings/sec, 95 secs
lola: 12621694 markings, 62478218 edges, 102015 markings/sec, 100 secs
lola: 13190585 markings, 65324531 edges, 113778 markings/sec, 105 secs
lola: 13703332 markings, 67977810 edges, 102549 markings/sec, 110 secs
lola: 14220856 markings, 70640015 edges, 103505 markings/sec, 115 secs
lola: 14735501 markings, 73308888 edges, 102929 markings/sec, 120 secs
lola: 15278971 markings, 76068294 edges, 108694 markings/sec, 125 secs
lola: 15816606 markings, 78813667 edges, 107527 markings/sec, 130 secs
lola: 16342501 markings, 81508884 edges, 105179 markings/sec, 135 secs
lola: 16876989 markings, 84236567 edges, 106898 markings/sec, 140 secs
lola: 17438723 markings, 87050846 edges, 112347 markings/sec, 145 secs
lola: 17989649 markings, 89839291 edges, 110185 markings/sec, 150 secs
lola: 18506889 markings, 92503444 edges, 103448 markings/sec, 155 secs
lola: 19016202 markings, 95146477 edges, 101863 markings/sec, 160 secs
lola: 19530790 markings, 97803186 edges, 102918 markings/sec, 165 secs
lola: 20051711 markings, 100474391 edges, 104184 markings/sec, 170 secs
lola: 20563912 markings, 103131806 edges, 102440 markings/sec, 175 secs
lola: 21116493 markings, 105921542 edges, 110516 markings/sec, 180 secs
lola: 21611063 markings, 108510671 edges, 98914 markings/sec, 185 secs
lola: 22119209 markings, 111137761 edges, 101629 markings/sec, 190 secs
lola: 22669429 markings, 113889404 edges, 110044 markings/sec, 195 secs
lola: 23172819 markings, 116482191 edges, 100678 markings/sec, 200 secs
lola: 23649818 markings, 119014210 edges, 95400 markings/sec, 205 secs
lola: 24140158 markings, 121570716 edges, 98068 markings/sec, 210 secs
lola: 24631472 markings, 124143369 edges, 98263 markings/sec, 215 secs
lola: 25125628 markings, 126731916 edges, 98831 markings/sec, 220 secs
lola: 25632150 markings, 129340154 edges, 101304 markings/sec, 225 secs
lola: 26117602 markings, 131882580 edges, 97090 markings/sec, 230 secs
lola: 26669570 markings, 134660941 edges, 110394 markings/sec, 235 secs
lola: 27170688 markings, 137269657 edges, 100224 markings/sec, 240 secs
lola: 27706760 markings, 139996697 edges, 107214 markings/sec, 245 secs
lola: 28198697 markings, 142574246 edges, 98387 markings/sec, 250 secs
lola: 28675731 markings, 145098860 edges, 95407 markings/sec, 255 secs
lola: 29171508 markings, 147701719 edges, 99155 markings/sec, 260 secs
lola: 29713022 markings, 150449180 edges, 108303 markings/sec, 265 secs
lola: 30233161 markings, 153137116 edges, 104028 markings/sec, 270 secs
lola: 30757584 markings, 155841202 edges, 104885 markings/sec, 275 secs
lola: 31315298 markings, 158646500 edges, 111543 markings/sec, 280 secs
lola: 31815062 markings, 161249461 edges, 99953 markings/sec, 285 secs
lola: 32298203 markings, 163791411 edges, 96628 markings/sec, 290 secs
lola: 32849877 markings, 166573471 edges, 110335 markings/sec, 295 secs
lola: 33348896 markings, 169197554 edges, 99804 markings/sec, 300 secs
lola: 33905088 markings, 172030804 edges, 111238 markings/sec, 305 secs
lola: 34452681 markings, 174833774 edges, 109519 markings/sec, 310 secs
lola: 35015609 markings, 177705997 edges, 112586 markings/sec, 315 secs
lola: 35532691 markings, 180365536 edges, 103416 markings/sec, 320 secs
lola: 36008954 markings, 182885701 edges, 95253 markings/sec, 325 secs
lola: 36591359 markings, 185766862 edges, 116481 markings/sec, 330 secs
lola: 37066259 markings, 188246323 edges, 94980 markings/sec, 335 secs
lola: 37554815 markings, 190807631 edges, 97711 markings/sec, 340 secs
lola: 38079848 markings, 193482353 edges, 105007 markings/sec, 345 secs
lola: 38565412 markings, 196007905 edges, 97113 markings/sec, 350 secs
lola: 39045535 markings, 198526002 edges, 96025 markings/sec, 355 secs
lola: 39506791 markings, 200968421 edges, 92251 markings/sec, 360 secs
lola: 39985946 markings, 203477611 edges, 95831 markings/sec, 365 secs
lola: 40452743 markings, 205961499 edges, 93359 markings/sec, 370 secs
lola: 40963599 markings, 208599327 edges, 102171 markings/sec, 375 secs
lola: 41461008 markings, 211181588 edges, 99482 markings/sec, 380 secs
lola: 41914149 markings, 213608499 edges, 90628 markings/sec, 385 secs
lola: 42415235 markings, 216195488 edges, 100217 markings/sec, 390 secs
lola: 42858676 markings, 218584631 edges, 88688 markings/sec, 395 secs
lola: 43315396 markings, 221016306 edges, 91344 markings/sec, 400 secs
lola: 43861658 markings, 223751222 edges, 109252 markings/sec, 405 secs
lola: 44368909 markings, 226359148 edges, 101450 markings/sec, 410 secs
lola: 44813083 markings, 228725573 edges, 88835 markings/sec, 415 secs
lola: 45293646 markings, 231215452 edges, 96113 markings/sec, 420 secs
lola: 45804668 markings, 233844468 edges, 102204 markings/sec, 425 secs
lola: 46327931 markings, 236506440 edges, 104653 markings/sec, 430 secs
lola: 46795691 markings, 238959288 edges, 93552 markings/sec, 435 secs
lola: 47191943 markings, 240968573 edges, 79250 markings/sec, 440 secs
lola: 47194956 markings, 240984842 edges, 603 markings/sec, 445 secs
lola: 47198431 markings, 241004641 edges, 695 markings/sec, 450 secs
lola: 47199030 markings, 241007841 edges, 120 markings/sec, 455 secs
lola: 47199509 markings, 241010495 edges, 96 markings/sec, 460 secs
lola: 47199513 markings, 241010523 edges, 1 markings/sec, 465 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 11 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((1 <= p_1_0_0) U (2 <= p_2_0_0))) OR E (X (((1 <= p_0_2_1))))) AND E (F (E (G ((2 <= p_2_1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p_1_0_0) U (2 <= p_2_0_0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((1 <= p_1_0_0) U (2 <= p_2_0_0)))
lola: processed formula: A (((1 <= p_1_0_0) U (2 <= p_2_0_0)))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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: 21 markings, 21 edges
lola: ========================================
lola: subprocess 12 will run for 675 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((1 <= p_0_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((1 <= p_0_2_1)))
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 900 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((2 <= p_2_1_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (p_2_1_0 <= 1))))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: 86478 markings, 269465 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 675 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (A (F ((1 <= p_1_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (1 <= p_1_2_1))))
lola: processed formula length: 39
lola: 8 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: 27 markings, 55 edges
lola: ========================================
lola: subprocess 13 will run for 900 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (E (X ((1 <= p_2_2_0))))) AND (p_0_2_2 <= p_0_0_0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 900 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (X ((1 <= p_2_2_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(EX((1 <= p_2_2_0)))
lola: processed formula length: 22
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p_0_2_2 <= p_0_0_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_0_2_2 <= p_0_0_0)
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.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: ========================================
SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((p_0_2_0 + 1 <= p_2_0_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((p_0_2_0 + 1 <= p_2_0_1)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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, 11 edges
lola: ========================================
lola: subprocess 15 will run for 2701 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((1 <= p_0_1_2) AND E (F ((p_0_2_2 + 1 <= p_2_1_2)))) AND E (F (E (G ((2 <= p_1_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2701 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= p_0_1_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p_0_1_2)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((2 <= p_1_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (p_1_1_2 <= 1))))
lola: processed formula length: 39
lola: 4 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d3n3m1t11-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 104 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: 23 markings, 46 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no unknown yes yes no yes unknown yes yes yes yes unknown
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d3n3m1t11-CTLCardinality-15 CANNOT_COMPUTE 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="NeighborGrid-PT-d3n3m1t11"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
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/NeighborGrid-PT-d3n3m1t11.tgz
mv NeighborGrid-PT-d3n3m1t11 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-full"
echo " Input is NeighborGrid-PT-d3n3m1t11, 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 r118-csrt-152666478200220"
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 ;