Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.................
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 3.8K 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 3.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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 8.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 469K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is NeighborGrid-PT-d4n3m2c23, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469200228
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527021846886

info: Time: 3600 - MCC
===========================================================================================
prep: translating NeighborGrid-PT-d4n3m2c23 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating NeighborGrid-PT-d4n3m2c23 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ NeighborGrid-PT-d4n3m2c23 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1713/65536 symbol table entries, 509 collisions
lola: preprocessing...
lola: Size of bit vector: 2592
lola: finding significant places
lola: 81 places, 1632 transitions, 80 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 81 transition conflict sets
lola: TASK
lola: reading formula from NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: ((A (G (A (X (FIREABLE(ti_1_1_0_1v_1_2_1_2))))) AND NOT(E (G (FIREABLE(ti_0_2_2_2v_1_2_2_1))))) AND E (G (((FIREABLE(ti_1_2_0_0v_1_2_1_1) AND FIREABLE(to_2_1_1_1v_2_2_2_0) AND (FIREABLE(to_1_0_1_1v_2_0_2_1) OR FIREABLE(ti_2_1_1_0v_2_2_0_0))) OR FIREABLE(ti_0_0_1_1v_1_0_2_2))))) : E (G (E (F (A (X (FIREABLE(ti_1_1_0_0v_1_2_1_1))))))) : A (F (A (G (((FIREABLE(ti_1_2_2_0v_2_1_1_0) OR FIREABLE(ti_0_2_1_0v_0_2_2_1)) AND FIREABLE(to_2_0_0_2v_2_0_1_1)))))) : E (G (NOT((A (G (FIREABLE(ti_0_1_0_2v_1_2_0_1))) AND A (G (FIREABLE(to_1_0_0_0v_1_0_1_1))))))) : (FIREABLE(to_2_0_2_1v_2_1_1_0) AND ((FIREABLE(to_1_2_2_0v_2_2_2_1) AND (A (F (FIREABLE(ti_1_1_0_0v_2_1_0_1))) OR A (G (FIREABLE(ti_0_0_1_0v_0_1_1_1))))) AND (E (F (FIREABLE(ti_1_2_0_0v_2_1_0_0))) AND E (G ((FIREABLE(to_1_2_0_0v_2_1_1_0) AND FIREABLE(ti_2_1_2_0v_2_2_1_1))))))) : A (F (((FIREABLE(ti_0_0_0_1v_1_0_1_0) OR FIREABLE(to_0_1_1_2v_1_0_1_1) OR (FIREABLE(to_0_0_0_1v_0_0_1_0) AND FIREABLE(to_0_1_1_0v_1_2_1_1)) OR (NOT FIREABLE(ti_2_1_0_0v_2_2_1_1) AND FIREABLE(to_0_2_2_0v_1_2_2_1))) AND (A (G (FIREABLE(ti_1_2_1_2v_2_2_2_1))) AND (NOT FIREABLE(ti_0_0_1_1v_0_0_2_2) OR NOT FIREABLE(to_0_0_2_1v_0_1_1_0)))))) : ((NOT(E (F (NOT FIREABLE(to_0_1_0_0v_1_1_1_1)))) AND (E (X ((FIREABLE(ti_1_1_1_1v_1_1_2_2) OR FIREABLE(ti_1_0_1_0v_2_0_2_0)))) AND E (F (NOT FIREABLE(ti_1_0_2_2v_2_1_1_2))))) AND FIREABLE(ti_0_1_2_2v_1_0_2_2)) : NOT(NOT(E (X (E (G (FIREABLE(to_0_2_1_0v_1_2_2_1))))))) : E (G (E (X (FIREABLE(to_1_1_1_1v_2_0_2_1))))) : NOT(A (F ((E (G (FIREABLE(to_1_2_2_2v_2_1_2_2))) AND FIREABLE(ti_0_1_2_0v_1_0_1_0))))) : E (G (E (X (FIREABLE(to_0_1_0_1v_1_2_1_1))))) : A (F ((NOT FIREABLE(ti_0_1_1_2v_0_2_2_2) AND NOT FIREABLE(to_0_1_1_1v_0_2_2_0) AND (NOT FIREABLE(ti_0_0_1_2v_1_1_1_2) OR NOT FIREABLE(ti_0_0_1_2v_1_0_0_2)) AND (FIREABLE(ti_1_0_1_2v_1_1_2_1) OR FIREABLE(to_1_1_0_0v_1_2_0_1))))) : A (G ((E (X ((FIREABLE(to_0_0_1_2v_1_1_1_2) AND FIREABLE(to_0_1_0_2v_1_0_0_2)))) OR (NOT FIREABLE(to_0_1_1_2v_0_2_0_2) AND FIREABLE(to_1_0_2_1v_1_1_2_2))))) : E ((NOT(E (G (FIREABLE(ti_2_1_0_1v_2_2_1_2)))) U (A (G (FIREABLE(ti_0_1_1_1v_1_2_0_1))) AND A (F (FIREABLE(ti_0_2_1_1v_0_2_2_0)))))) : (((E (G (NOT FIREABLE(ti_1_2_0_2v_2_2_0_1))) AND FIREABLE(ti_1_1_2_1v_2_0_1_1)) AND E (F (E (F (FIREABLE(to_1_1_1_1v_2_1_0_1)))))) OR E (F ((FIREABLE(to_0_2_0_1v_1_2_0_0) AND FIREABLE(to_2_1_2_1v_2_2_2_0) AND FIREABLE(to_1_1_1_0v_2_2_2_0) AND (NOT FIREABLE(ti_1_1_0_1v_1_1_1_2) OR NOT FIREABLE(to_0_2_0_2v_1_1_1_2)))))) : (E (X ((A (X (FIREABLE(to_0_0_0_1v_1_0_0_2))) OR A (G (FIREABLE(to_1_1_2_1v_1_2_2_2)))))) AND E (G (A ((FIREABLE(ti_1_0_1_2v_1_0_2_1) U FIREABLE(to_0_1_0_2v_1_1_1_1))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:401
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:554
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (A (G (FIREABLE(ti_1_1_0_1v_1_2_1_2))))) AND (A (F (NOT FIREABLE(ti_0_2_2_2v_1_2_2_1))) AND E (G (((FIREABLE(ti_1_2_0_0v_1_2_1_1) AND FIREABLE(to_2_1_1_1v_2_2_2_0) AND (FIREABLE(to_1_0_1_1v_2_0_2_1) OR FIREABLE(ti_2_1_1_0v_2_2_0_0))) OR FIREABLE(ti_0_0_1_1v_1_0_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (NOT FIREABLE(ti_0_2_2_2v_1_2_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: FIREABLE(ti_0_2_2_2v_1_2_2_1)
lola: processed formula length: 29
lola: 43 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 102 markings, 102 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (A (X (FIREABLE(ti_1_1_0_0v_1_2_1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U AX(FIREABLE(ti_1_1_0_0v_1_2_1_1))))))
lola: processed formula length: 63
lola: 44 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 588794 markings, 949464 edges, 117759 markings/sec, 0 secs
lola: 1189763 markings, 1905582 edges, 120194 markings/sec, 5 secs
lola: 1794487 markings, 2891048 edges, 120945 markings/sec, 10 secs
lola: 2409187 markings, 3915264 edges, 122940 markings/sec, 15 secs
lola: 3044846 markings, 4945455 edges, 127132 markings/sec, 20 secs
lola: 3671932 markings, 5966621 edges, 125417 markings/sec, 25 secs
lola: 4273723 markings, 6969899 edges, 120358 markings/sec, 30 secs
lola: 4889346 markings, 8016474 edges, 123125 markings/sec, 35 secs
lola: 5483111 markings, 8991213 edges, 118753 markings/sec, 40 secs
lola: 6091746 markings, 9983561 edges, 121727 markings/sec, 45 secs
lola: 6697304 markings, 11001987 edges, 121112 markings/sec, 50 secs
lola: 7334060 markings, 12076648 edges, 127351 markings/sec, 55 secs
lola: 7946533 markings, 13077912 edges, 122495 markings/sec, 60 secs
lola: 8574855 markings, 14122228 edges, 125664 markings/sec, 65 secs
lola: 9206786 markings, 15196653 edges, 126386 markings/sec, 70 secs
lola: 9839489 markings, 16229243 edges, 126541 markings/sec, 75 secs
lola: 10444706 markings, 17272614 edges, 121043 markings/sec, 80 secs
lola: 11069784 markings, 18299418 edges, 125016 markings/sec, 85 secs
lola: 11686591 markings, 19331959 edges, 123361 markings/sec, 90 secs
lola: 12307980 markings, 20390081 edges, 124278 markings/sec, 95 secs
lola: 12927031 markings, 21425069 edges, 123810 markings/sec, 100 secs
lola: 13539203 markings, 22465918 edges, 122434 markings/sec, 105 secs
lola: 14140512 markings, 23512984 edges, 120262 markings/sec, 110 secs
lola: 14306123 markings, 23788248 edges, 33122 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (FIREABLE(to_0_1_0_0v_1_1_1_1))) AND (E (X ((FIREABLE(ti_1_1_1_1v_1_1_2_2) OR FIREABLE(ti_1_0_1_0v_2_0_2_0)))) AND (E (F (NOT FIREABLE(ti_1_0_2_2v_2_1_1_2))) AND FIREABLE(ti_0_1_2_2v_1_0_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(ti_0_1_2_2v_1_0_2_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(ti_0_1_2_2v_1_0_2_2)
lola: processed formula length: 29
lola: 41 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: processed formula with 0 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 3 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(ti_1_0_2_2v_2_1_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (NOT FIREABLE(ti_1_0_2_2v_2_1_1_2)))
lola: processed formula length: 41
lola: 42 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: NOT FIREABLE(ti_1_0_2_2v_2_1_1_2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d4n3m2c23-CTLFireability-3-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 4 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(to_0_1_0_0v_1_1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G (FIREABLE(to_0_1_0_0v_1_1_1_1)))
lola: processed formula length: 37
lola: 43 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: NOT FIREABLE(to_0_1_0_0v_1_1_1_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (FIREABLE(to_0_2_1_0v_1_2_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:627
lola: processed formula: FIREABLE(to_0_2_1_0v_1_2_2_1)
lola: processed formula length: 29
lola: 42 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 98 markings, 98 edges
lola: ========================================

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (FIREABLE(to_1_1_1_1v_2_0_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(EX(FIREABLE(to_1_1_1_1v_2_0_2_1)))))
lola: processed formula length: 53
lola: 43 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 263 markings, 263 edges
lola: ========================================

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (FIREABLE(to_0_1_0_1v_1_2_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(EX(FIREABLE(to_0_1_0_1v_1_2_1_1)))))
lola: processed formula length: 53
lola: 43 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 263 markings, 263 edges

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X ((FIREABLE(to_0_0_1_2v_1_1_1_2) AND FIREABLE(to_0_1_0_2v_1_0_0_2)))) OR (NOT FIREABLE(to_0_1_1_2v_0_2_0_2) AND FIREABLE(to_1_0_2_1v_1_1_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (NOT(EX((FIREABLE(to_0_0_1_2v_1_1_1_2) AND FIREABLE(to_0_1_0_2v_1_0_0_2)))) AND (FIREABLE(to_0_1_1_2v_0_2_0_2) OR NOT FIREABLE(to_1_0_2_1v_1_1_2_2)))))
lola: processed formula length: 165
lola: 45 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 13488 markings, 20071 edges
lola: ========================================

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (X (A (X (FIREABLE(to_0_0_0_1v_1_0_0_2))))) OR E (X (A (G (FIREABLE(to_1_1_2_1v_1_2_2_2)))))) AND E (G (A ((FIREABLE(ti_1_0_1_2v_1_0_2_1) U FIREABLE(to_0_1_0_2v_1_1_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 383 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A ((FIREABLE(ti_1_0_1_2v_1_0_2_1) U FIREABLE(to_0_1_0_2v_1_1_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(A(FIREABLE(ti_1_0_1_2v_1_0_2_1) U FIREABLE(to_0_1_0_2v_1_1_1_1)))))
lola: processed formula length: 84
lola: 43 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 263 markings, 526 edges
lola: ========================================
lola: subprocess 8 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (FIREABLE(to_1_1_2_1v_1_2_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX(NOT(E(TRUE U NOT FIREABLE(to_1_1_2_1v_1_2_2_2))))
lola: processed formula length: 52
lola: 44 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 79546 markings, 79946 edges
lola: lola: subprocess 9 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (X (FIREABLE(to_0_0_0_1v_1_0_0_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(AX(FIREABLE(to_0_0_0_1v_1_0_0_2)))
lola: processed formula length: 37
lola: 43 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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: ========================================

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(ti_0_1_1_2v_0_2_2_2) AND NOT FIREABLE(to_0_1_1_1v_0_2_2_0) AND (NOT FIREABLE(ti_0_0_1_2v_1_1_1_2) OR NOT FIREABLE(ti_0_0_1_2v_1_0_0_2)) AND (FIREABLE(ti_1_0_1_2v_1_1_2_1) OR FIREABLE(to_1_1_0_0v_1_2_0_1)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (FIREABLE(ti_0_1_1_2v_0_2_2_2) OR FIREABLE(to_0_1_1_1v_0_2_2_0) OR (FIREABLE(ti_0_0_1_2v_1_1_1_2) AND FIREABLE(ti_0_0_1_2v_1_0_0_2)) OR (NOT FIREABLE(ti_1_0_1_2v_1_1_2_1) AND NOT FIREABLE(to_1_1_0_0v_1_2_0_1)))
lola: processed formula length: 213
lola: 43 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 73 markings, 73 edges
lola: ========================================

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F (NOT FIREABLE(to_1_2_2_2v_2_1_2_2))) OR NOT FIREABLE(ti_0_1_2_0v_1_0_1_0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U NOT FIREABLE(to_1_2_2_2v_2_1_2_2))) AND FIREABLE(ti_0_1_2_0v_1_0_1_0))))
lola: processed formula length: 99
lola: 45 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 353 markings, 354 edges

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 574 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (((FIREABLE(ti_0_0_0_1v_1_0_1_0) OR FIREABLE(to_0_1_1_2v_1_0_1_1) OR (FIREABLE(to_0_0_0_1v_0_0_1_0) AND FIREABLE(to_0_1_1_0v_1_2_1_1)) OR (NOT FIREABLE(ti_2_1_0_0v_2_2_1_1) AND FIREABLE(to_0_2_2_0v_1_2_2_1))) AND (A (G (FIREABLE(ti_1_2_1_2v_2_2_2_1))) AND (NOT FIREABLE(ti_0_0_1_1v_0_0_2_2) OR NOT FIREABLE(to_0_0_2_1v_0_1_1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U ((FIREABLE(ti_0_0_0_1v_1_0_1_0) OR FIREABLE(to_0_1_1_2v_1_0_1_1) OR (FIREABLE(to_0_0_0_1v_0_0_1_0) AND FIREABLE(to_0_1_1_0v_1_2_1_1)) OR (NOT FIREABLE(ti_2_1_0_0v_2_2_1_1) AND FIREABLE(to_0_2_2_0v_1_2_2_1))) AND (NOT(E(TRUE U NOT FIREABLE(ti_1_2_1_2v_2_2_2_1))) AND (NOT FIREABLE(ti_0_0_1_1v_0_0_2_2) OR NOT FIREABLE(to_0_0_2_1v_0_1_1_0)))))
lola: processed formula length: 354
lola: 44 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 263 markings, 598 edges
lola: ========================================

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 689 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F (NOT FIREABLE(ti_0_1_0_2v_1_2_0_1))) OR E (F (NOT FIREABLE(to_1_0_0_0v_1_0_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: processed formula: NOT(A(TRUE U (NOT(E(TRUE U NOT FIREABLE(ti_0_1_0_2v_1_2_0_1))) AND NOT(E(TRUE U NOT FIREABLE(to_1_0_0_0v_1_0_1_1))))))
lola: processed formula length: 118
lola: 45 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 263 markings, 610 edges
lola: ========================================

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 861 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (F (NOT FIREABLE(ti_2_1_0_1v_2_2_1_2))) U (A (G (FIREABLE(ti_0_1_1_1v_1_2_0_1))) AND A (F (FIREABLE(ti_0_2_1_1v_0_2_2_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(A(TRUE U NOT FIREABLE(ti_2_1_0_1v_2_2_1_2)) U (NOT(E(TRUE U NOT FIREABLE(ti_0_1_1_1v_1_2_0_1))) AND A(TRUE U FIREABLE(ti_0_2_1_1v_0_2_2_0))))
lola: processed formula length: 143
lola: 46 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 4 significant temporal operators and needs 17 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: 792 markings, 823 edges
lola: ========================================

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1149 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((FIREABLE(ti_1_2_2_0v_2_1_1_0) OR FIREABLE(ti_0_2_1_0v_0_2_2_1)) AND FIREABLE(to_2_0_0_2v_2_0_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((NOT FIREABLE(ti_1_2_2_0v_2_1_1_0) AND NOT FIREABLE(ti_0_2_1_0v_0_2_2_1)) OR NOT FIREABLE(to_2_0_0_2v_2_0_1_1))
lola: processed formula length: 113
lola: 43 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 525 markings, 679 edges
lola: ========================================

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1723 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (G (NOT FIREABLE(ti_1_2_0_2v_2_2_0_1))) AND (FIREABLE(ti_1_1_2_1v_2_0_1_1) AND E (F (FIREABLE(to_1_1_1_1v_2_1_0_1))))) OR E (F ((FIREABLE(to_0_2_0_1v_1_2_0_0) AND FIREABLE(to_2_1_2_1v_2_2_2_0) AND FIREABLE(to_1_1_1_0v_2_2_2_0) AND (NOT FIREABLE(ti_1_1_0_1v_1_1_1_2) OR NOT FIREABLE(to_0_2_0_2v_1_1_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1723 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(ti_1_1_2_1v_2_0_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(ti_1_1_2_1v_2_0_1_1)
lola: processed formula length: 29
lola: 41 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: processed formula with 0 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 15 will run for 3447 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(to_1_1_1_1v_2_1_0_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(to_1_1_1_1v_2_1_0_1)))
lola: processed formula length: 37
lola: 42 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
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=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(to_0_2_0_1v_1_2_0_0) AND FIREABLE(to_2_1_2_1v_2_2_2_0) AND FIREABLE(to_1_1_1_0v_2_2_2_0) AND (NOT FIREABLE(ti_1_1_0_1v_1_1_1_2) OR NOT FIREABLE(to_0_2_0_2v_1_1_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FIREABLE(to_0_2_0_1v_1_2_0_0) AND FIREABLE(to_2_1_2_1v_2_2_2_0) AND FIREABLE(to_1_1_1_0v_2_2_2_0) AND (NOT FIREABLE(ti_1_1_0_1v_1_1_1_2) OR NOT FIREABLE(to_0_2_0_2v_1_1_1_2)))))
lola: processed formula length: 185
lola: 42 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FIREABLE(to_0_2_0_1v_1_2_0_0) AND FIREABLE(to_2_1_2_1v_2_2_2_0) AND FIREABLE(to_1_1_1_0v_2_2_2_0) AND (NOT FIREABLE(ti_1_1_0_1v_1_1_1_2) OR NOT FIREABLE(to_0_2_0_2v_1_1_1_2)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d4n3m2c23-CTLFireability-17-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3447 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(to_2_0_2_1v_2_1_1_0) AND (FIREABLE(to_1_2_2_0v_2_2_2_1) AND ((A (F (FIREABLE(ti_1_1_0_0v_2_1_0_1))) OR A (G (FIREABLE(ti_0_0_1_0v_0_1_1_1)))) AND (E (F (FIREABLE(ti_1_2_0_0v_2_1_0_0))) AND E (G ((FIREABLE(to_1_2_0_0v_2_1_1_0) AND FIREABLE(ti_2_1_2_0v_2_2_1_1))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3447 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(to_1_2_2_0v_2_2_2_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(to_1_2_2_0v_2_2_2_1)
lola: processed formula length: 29
lola: 41 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: processed formula with 0 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=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(ti_1_2_0_0v_2_1_0_0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(ti_1_2_0_0v_2_1_0_0)))
lola: processed formula length: 37
lola: 42 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(to_1_2_0_0v_2_1_1_0) AND FIREABLE(ti_2_1_2_0v_2_2_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((FIREABLE(to_1_2_0_0v_2_1_1_0) AND FIREABLE(ti_2_1_2_0v_2_2_1_1))))
lola: processed formula length: 73
lola: 41 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 116 markings, 116 edges
lola: ========================================
lola: subprocess 19 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(ti_0_0_1_0v_0_1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (FIREABLE(ti_0_0_1_0v_0_1_1_1)))
lola: processed formula length: 37
lola: 43 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(ti_0_0_1_0v_0_1_1_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d4n3m2c23-CTLFireability-19-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 20 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(ti_1_1_0_0v_2_1_0_1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(ti_1_1_0_0v_2_1_0_1)
lola: processed formula length: 33
lola: 43 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (E (F (A (X (FIREABLE(ti_1_1_0_0v_1_2_1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U AX(FIREABLE(ti_1_1_0_0v_1_2_1_1))))))
lola: processed formula length: 63
lola: 44 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 705174 markings, 1141781 edges, 141035 markings/sec, 0 secs
lola: 1382664 markings, 2214709 edges, 135498 markings/sec, 5 secs
lola: 2016398 markings, 3263025 edges, 126747 markings/sec, 10 secs
lola: 2698719 markings, 4389523 edges, 136464 markings/sec, 15 secs
lola: 3325422 markings, 5398202 edges, 125341 markings/sec, 20 secs
lola: 3950924 markings, 6430140 edges, 125100 markings/sec, 25 secs
lola: 4591604 markings, 7524865 edges, 128136 markings/sec, 30 secs
lola: 5215352 markings, 8557971 edges, 124750 markings/sec, 35 secs
lola: 5842809 markings, 9578208 edges, 125491 markings/sec, 40 secs
lola: 6460598 markings, 10594519 edges, 123558 markings/sec, 45 secs
lola: 7093802 markings, 11677656 edges, 126641 markings/sec, 50 secs
lola: 7714931 markings, 12689969 edges, 124226 markings/sec, 55 secs
lola: 8347439 markings, 13736721 edges, 126502 markings/sec, 60 secs
lola: 8958547 markings, 14787772 edges, 122222 markings/sec, 65 secs
lola: 9604582 markings, 15841006 edges, 129207 markings/sec, 70 secs
lola: 10244384 markings, 16911854 edges, 127960 markings/sec, 75 secs
lola: 10863405 markings, 17963419 edges, 123804 markings/sec, 80 secs
lola: 11490432 markings, 18997358 edges, 125405 markings/sec, 85 secs
lola: 12092807 markings, 20033817 edges, 120475 markings/sec, 90 secs
lola: 12704149 markings, 21045956 edges, 122268 markings/sec, 95 secs
lola: 13313948 markings, 22100071 edges, 121960 markings/sec, 100 secs
lola: 13928616 markings, 23130426 edges, 122934 markings/sec, 105 secs
lola: 14293628 markings, 23767435 edges, 73002 markings/sec, 110 secs
lola: 14302214 markings, 23781178 edges, 1717 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (FIREABLE(to_2_0_2_1v_2_1_1_0) AND (FIREABLE(to_1_2_2_0v_2_2_2_1) AND ((A (F (FIREABLE(ti_1_1_0_0v_2_1_0_1))) OR A (G (FIREABLE(ti_0_0_1_0v_0_1_1_1)))) AND (E (F (FIREABLE(ti_1_2_0_0v_2_1_0_0))) AND E (G ((FIREABLE(to_1_2_0_0v_2_1_1_0) AND FIREABLE(ti_2_1_2_0v_2_2_1_1))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: FIREABLE(to_1_2_2_0v_2_2_2_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(to_1_2_2_0v_2_2_2_1)
lola: processed formula length: 29
lola: 41 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: processed formula with 0 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: ========================================
lola: ...considering subproblem: FIREABLE(to_2_0_2_1v_2_1_1_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(to_2_0_2_1v_2_1_1_0)
lola: processed formula length: 29
lola: 41 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: processed formula with 0 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: ========================================
lola: ...considering subproblem: E (F (FIREABLE(ti_1_2_0_0v_2_1_0_0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(ti_1_2_0_0v_2_1_0_0)))
lola: processed formula length: 37
lola: 42 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: FIREABLE(ti_1_2_0_0v_2_1_0_0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(to_1_2_0_0v_2_1_1_0) AND FIREABLE(ti_2_1_2_0v_2_2_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((FIREABLE(to_1_2_0_0v_2_1_1_0) AND FIREABLE(ti_2_1_2_0v_2_2_1_1))))
lola: processed formula length: 73
lola: 41 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 116 markings, 116 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(ti_0_0_1_0v_0_1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (FIREABLE(ti_0_0_1_0v_0_1_1_1)))
lola: processed formula length: 37
lola: 43 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(ti_0_0_1_0v_0_1_1_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(ti_1_1_0_0v_2_1_0_1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(ti_1_1_0_0v_2_1_0_1)
lola: processed formula length: 33
lola: 43 rewrites
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no unknown no yes yes no no yes yes no yes no no no yes yes
lola:
preliminary result: no unknown no yes yes no no yes yes no yes no no no yes yes
lola: memory consumption: 14744 KB
lola: time consumption: 245 seconds

BK_STOP 1527022092997

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

Sequence of Actions to be Executed by the VM

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

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