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 212K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K 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 19K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is NeighborGrid-PT-d2n3m1t12, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469200214
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527021571121

info: Time: 3600 - MCC
===========================================================================================
prep: translating NeighborGrid-PT-d2n3m1t12 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating NeighborGrid-PT-d2n3m1t12 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ NeighborGrid-PT-d2n3m1t12 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 81/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 72 transitions, 8 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from NeighborGrid-PT-d2n3m1t12-CTLFireability.task
lola: E (G (E (F (A (G (FIREABLE(to_0_0v_1_2))))))) : A (G (((E (F (FIREABLE(to_0_0v_0_1))) OR FIREABLE(ti_0_1v_2_2)) OR (FIREABLE(ti_0_1v_1_0) AND (FIREABLE(ti_0_0v_0_2) OR FIREABLE(to_1_2v_2_1)) AND (FIREABLE(to_1_0v_1_2) OR FIREABLE(ti_0_1v_2_0) OR FIREABLE(ti_0_2v_1_1)))))) : E (((FIREABLE(ti_0_1v_1_2) OR E (X (FIREABLE(ti_1_2v_2_2)))) U ((FIREABLE(ti_0_1v_0_2) OR FIREABLE(ti_0_2v_1_1) OR NOT FIREABLE(ti_2_0v_2_2)) AND A (G (FIREABLE(ti_0_0v_1_1)))))) : (A (G ((E (X (FIREABLE(to_0_2v_1_1))) OR FIREABLE(to_0_0v_2_1)))) OR ((NOT FIREABLE(ti_0_1v_2_2) OR (NOT FIREABLE(to_0_0v_2_2) AND NOT FIREABLE(ti_1_1v_2_0)) OR FIREABLE(to_0_1v_1_1)) AND (A (X (NOT FIREABLE(ti_1_0v_1_2))) AND NOT FIREABLE(to_0_2v_1_1)))) : NOT(NOT(E (F (A (G (FIREABLE(ti_0_0v_0_2))))))) : NOT(A (G ((FIREABLE(ti_0_1v_1_0) OR FIREABLE(to_0_0v_1_2) OR FIREABLE(ti_0_0v_1_2) OR NOT FIREABLE(to_1_1v_2_1))))) : (A (F (FIREABLE(to_1_0v_1_2))) AND NOT(E (F (((FIREABLE(ti_0_1v_1_2) OR FIREABLE(to_1_2v_2_2)) AND NOT FIREABLE(ti_0_2v_1_2)))))) : (NOT(E (((FIREABLE(to_1_0v_2_2) OR FIREABLE(ti_0_0v_2_2)) U FIREABLE(ti_1_2v_2_0)))) AND NOT FIREABLE(to_0_0v_2_0)) : (FIREABLE(to_0_2v_1_1) OR A (((NOT FIREABLE(ti_0_0v_2_2) AND NOT FIREABLE(ti_2_1v_2_2)) U FIREABLE(to_0_0v_1_1)))) : E (F ((((FIREABLE(to_0_2v_1_0) OR (FIREABLE(to_1_1v_2_1) AND FIREABLE(to_0_1v_1_2))) AND (NOT FIREABLE(ti_2_0v_2_2) OR NOT FIREABLE(to_0_1v_1_2))) AND E (X (NOT FIREABLE(to_0_1v_2_1)))))) : (E (((FIREABLE(ti_0_1v_0_2) AND FIREABLE(to_0_1v_0_2) AND FIREABLE(to_1_0v_1_2)) U FIREABLE(to_0_0v_1_0))) OR (E (X (NOT FIREABLE(to_1_2v_2_2))) AND E (F ((FIREABLE(ti_0_0v_2_0) OR (FIREABLE(ti_1_0v_2_0) AND FIREABLE(ti_1_2v_2_2))))))) : A ((FIREABLE(ti_0_1v_2_1) U ((NOT FIREABLE(to_1_2v_2_2) OR NOT FIREABLE(to_0_1v_1_1)) AND FIREABLE(ti_0_1v_1_0)))) : ((((FIREABLE(ti_0_1v_1_2) AND E (F (FIREABLE(to_1_1v_2_0)))) AND (NOT FIREABLE(ti_0_0v_0_2) OR NOT FIREABLE(to_1_1v_1_2) OR NOT FIREABLE(to_0_1v_2_1) OR NOT FIREABLE(ti_0_1v_2_0))) AND E (F ((FIREABLE(ti_0_0v_1_1) OR FIREABLE(to_1_0v_2_2) OR FIREABLE(to_0_0v_1_1))))) OR (((NOT FIREABLE(ti_0_1v_1_2) OR NOT FIREABLE(to_1_1v_2_0)) AND (FIREABLE(to_0_1v_2_2) OR FIREABLE(to_1_1v_2_2))) OR NOT((A (X (FIREABLE(ti_0_0v_0_1))) AND (NOT FIREABLE(to_0_0v_0_2) OR FIREABLE(to_0_2v_1_1)))))) : E (X (NOT((FIREABLE(to_0_2v_1_0) AND E (G (FIREABLE(ti_1_1v_2_1))))))) : NOT(A (G (A (F (NOT FIREABLE(to_0_1v_1_1)))))) : (FIREABLE(to_0_1v_1_1) OR E (((NOT FIREABLE(ti_0_0v_0_2) AND NOT FIREABLE(to_2_1v_2_2)) U A (X (FIREABLE(to_0_0v_0_2))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:326
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:554
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(ti_0_1v_1_2) OR E (X (FIREABLE(ti_1_2v_2_2)))) U ((FIREABLE(ti_0_1v_0_2) OR FIREABLE(ti_0_2v_1_1) OR NOT FIREABLE(ti_2_0v_2_2)) AND A (G (FIREABLE(ti_0_0v_1_1))))))
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:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E((FIREABLE(ti_0_1v_1_2) OR EX(FIREABLE(ti_1_2v_2_2))) U ((FIREABLE(ti_0_1v_0_2) OR FIREABLE(ti_0_2v_1_1) OR NOT FIREABLE(ti_2_0v_2_2)) AND NOT(E(TRUE U NOT FIREABLE(ti_0_0v_1_1)))))
lola: processed formula length: 184
lola: 44 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-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: 24310 markings, 960817 edges
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((E (X (FIREABLE(to_0_2v_1_1))) OR FIREABLE(to_0_0v_2_1)))) OR ((NOT FIREABLE(ti_0_1v_2_2) OR (NOT FIREABLE(to_0_0v_2_2) AND NOT FIREABLE(ti_1_1v_2_0)) OR FIREABLE(to_0_1v_1_1)) AND (A (X (NOT FIREABLE(ti_1_0v_1_2))) AND NOT FIREABLE(to_0_2v_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(to_0_2v_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(to_0_2v_1_1)
lola: processed formula length: 25
lola: 40 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X (FIREABLE(to_0_2v_1_1))) OR FIREABLE(to_0_0v_2_1))))
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_2v_1_1))) AND NOT FIREABLE(to_0_0v_2_1))))
lola: processed formula length: 77
lola: 44 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-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: 24310 markings, 926640 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(to_0_2v_1_0) OR (FIREABLE(to_1_1v_2_1) AND FIREABLE(to_0_1v_1_2))) AND (NOT FIREABLE(ti_2_0v_2_2) OR NOT FIREABLE(to_0_1v_1_2))) AND E (X (NOT FIREABLE(to_0_1v_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (((FIREABLE(to_0_2v_1_0) OR (FIREABLE(to_1_1v_2_1) AND FIREABLE(to_0_1v_1_2))) AND (NOT FIREABLE(ti_2_0v_2_2) OR NOT FIREABLE(to_0_1v_1_2))) AND EX(NOT FIREABLE(to_0_1v_2_1))))
lola: processed formula length: 187
lola: 42 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-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: 5 markings, 4 edges

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((FIREABLE(ti_0_1v_0_2) AND FIREABLE(to_0_1v_0_2) AND FIREABLE(to_1_0v_1_2)) U FIREABLE(to_0_0v_1_0))) OR (E (X (NOT FIREABLE(to_1_2v_2_2))) AND E (F ((FIREABLE(ti_0_0v_2_0) OR (FIREABLE(ti_1_0v_2_0) AND FIREABLE(ti_1_2v_2_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(ti_0_0v_2_0) OR (FIREABLE(ti_1_0v_2_0) AND FIREABLE(ti_1_2v_2_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(ti_0_0v_2_0) OR (FIREABLE(ti_1_0v_2_0) AND FIREABLE(ti_1_2v_2_2)))))
lola: processed formula length: 85
lola: 41 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(ti_0_1v_0_2) AND FIREABLE(to_0_1v_0_2) AND FIREABLE(to_1_0v_1_2)) U FIREABLE(to_0_0v_1_0)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((FIREABLE(ti_0_1v_0_2) AND FIREABLE(to_0_1v_0_2) AND FIREABLE(to_1_0v_1_2)) U FIREABLE(to_0_0v_1_0)))
lola: processed formula length: 105
lola: 43 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: FIREABLE(to_0_0v_1_0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to NeighborGrid-PT-d2n3m1t12-CTLFireability-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(ti_0_1v_1_2) AND (E (F (FIREABLE(to_1_1v_2_0))) AND ((NOT FIREABLE(ti_0_0v_0_2) OR NOT FIREABLE(to_1_1v_1_2) OR NOT FIREABLE(to_0_1v_2_1) OR NOT FIREABLE(ti_0_1v_2_0)) AND E (F ((FIREABLE(ti_0_0v_1_1) OR FIREABLE(to_1_0v_2_2) OR FIREABLE(to_0_0v_1_1))))))) OR (((NOT FIREABLE(ti_0_1v_1_2) OR NOT FIREABLE(to_1_1v_2_0)) AND (FIREABLE(to_0_1v_2_2) OR FIREABLE(to_1_1v_2_2))) OR (E (X ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(to_0_0v_0_2) AND NOT FIREABLE(to_0_2v_1_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(to_0_0v_0_2) AND NOT FIREABLE(to_0_2v_1_1))
lola: processed formula length: 53
lola: 40 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(ti_0_1v_1_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(ti_0_1v_1_2)
lola: processed formula length: 21
lola: 40 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-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 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(ti_0_1v_1_2) OR NOT FIREABLE(to_1_1v_2_0)) AND (FIREABLE(to_0_1v_2_2) OR FIREABLE(to_1_1v_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NOT FIREABLE(ti_0_1v_1_2) OR NOT FIREABLE(to_1_1v_2_0)) AND (FIREABLE(to_0_1v_2_2) OR FIREABLE(to_1_1v_2_2)))
lola: processed formula length: 113
lola: 40 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(ti_0_0v_0_2) OR NOT FIREABLE(to_1_1v_1_2) OR NOT FIREABLE(to_0_1v_2_1) OR NOT FIREABLE(ti_0_1v_2_0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(ti_0_0v_0_2) OR NOT FIREABLE(to_1_1v_1_2) OR NOT FIREABLE(to_0_1v_2_1) OR NOT FIREABLE(ti_0_1v_2_0))
lola: processed formula length: 117
lola: 40 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (NOT FIREABLE(ti_0_0v_0_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(NOT FIREABLE(ti_0_0v_0_1))
lola: processed formula length: 29
lola: 41 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-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-d2n3m1t12-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (NOT FIREABLE(to_0_2v_1_0))) OR E (X (A (F (NOT FIREABLE(ti_1_1v_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (NOT FIREABLE(to_0_2v_1_0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(NOT FIREABLE(to_0_2v_1_0))
lola: processed formula length: 29
lola: 41 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-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-d2n3m1t12-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(to_0_1v_1_1) OR E (((NOT FIREABLE(ti_0_0v_0_2) AND NOT FIREABLE(to_2_1v_2_2)) U A (X (FIREABLE(to_0_0v_0_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: (FIREABLE(to_0_1v_1_1) OR E((NOT FIREABLE(ti_0_0v_0_2) AND NOT FIREABLE(to_2_1v_2_2)) U AX(FIREABLE(to_0_0v_0_2))))
lola: processed formula length: 115
lola: 42 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-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: 0 markings, 0 edges
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(ti_0_1v_1_0) AND NOT FIREABLE(to_0_0v_1_2) AND NOT FIREABLE(ti_0_0v_1_2) AND FIREABLE(to_1_1v_2_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 ((NOT FIREABLE(ti_0_1v_1_0) AND NOT FIREABLE(to_0_0v_1_2) AND NOT FIREABLE(ti_0_0v_1_2) AND FIREABLE(to_1_1v_2_1))))
lola: processed formula length: 121
lola: 41 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-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_0_1v_1_0) AND NOT FIREABLE(to_0_0v_1_2) AND NOT FIREABLE(ti_0_0v_1_2) AND FIREABLE(to_1_1v_2_1))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (FIREABLE(to_0_1v_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: FIREABLE(to_0_1v_1_1)
lola: processed formula length: 21
lola: 41 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--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 /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 15 markings, 15 edges
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(ti_0_0v_0_2)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(ti_0_0v_0_2)
lola: processed formula length: 25
lola: 42 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 17875 markings, 463320 edges
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F (FIREABLE(to_0_0v_0_1))) OR (FIREABLE(ti_0_1v_2_2) OR (FIREABLE(ti_0_1v_1_0) AND (FIREABLE(ti_0_0v_0_2) OR FIREABLE(to_1_2v_2_1)) AND (FIREABLE(to_1_0v_1_2) OR FIREABLE(ti_0_1v_2_0) OR FIREABLE(ti_0_2v_1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (NOT(E(TRUE U FIREABLE(to_0_0v_0_1))) AND (NOT FIREABLE(ti_0_1v_2_2) AND (NOT FIREABLE(ti_0_1v_1_0) OR (NOT FIREABLE(ti_0_0v_0_2) AND NOT FIREABLE(to_1_2v_2_1)) OR (NOT FIREABLE(to_1_0v_1_2) AND NOT FIREABLE(ti_0_1v_2_0) AND NOT FIREABLE(ti_0_2v_1_1)))))))
lola: processed formula length: 271
lola: 46 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-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: 24310 markings, 962390 edges
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (A (G (FIREABLE(to_0_0v_1_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U NOT(E(TRUE U NOT FIREABLE(to_0_0v_1_2)))))))
lola: processed formula length: 70
lola: 44 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 24310 markings, 995584 edges
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(to_0_2v_1_1) OR A (((NOT FIREABLE(ti_0_0v_2_2) AND NOT FIREABLE(ti_2_1v_2_2)) U FIREABLE(to_0_0v_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(to_0_2v_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(to_0_2v_1_1)
lola: processed formula length: 21
lola: 40 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(ti_0_1v_2_1) U ((NOT FIREABLE(to_1_2v_2_2) OR NOT FIREABLE(to_0_1v_1_1)) AND FIREABLE(ti_0_1v_1_0))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((FIREABLE(ti_0_1v_2_1) U ((NOT FIREABLE(to_1_2v_2_2) OR NOT FIREABLE(to_0_1v_1_1)) AND FIREABLE(ti_0_1v_1_0))))
lola: processed formula length: 115
lola: 44 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 5 markings, 4 edges

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((NOT FIREABLE(to_1_0v_2_2) AND NOT FIREABLE(ti_0_0v_2_2)) R NOT FIREABLE(ti_1_2v_2_0))) AND NOT FIREABLE(to_0_0v_2_0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(to_0_0v_2_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(to_0_0v_2_0)
lola: processed formula length: 25
lola: 40 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (FIREABLE(to_1_0v_1_2))) AND A (G (((NOT FIREABLE(ti_0_1v_1_2) AND NOT FIREABLE(to_1_2v_2_2)) OR FIREABLE(ti_0_2v_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(to_1_0v_1_2)))
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(to_1_0v_1_2)
lola: processed formula length: 25
lola: 42 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-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: 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: ========================================
lola: ...considering subproblem: (A (F (FIREABLE(to_1_0v_1_2))) AND A (G (((NOT FIREABLE(ti_0_1v_1_2) AND NOT FIREABLE(to_1_2v_2_2)) OR FIREABLE(ti_0_2v_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(to_1_0v_1_2)))
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(to_1_0v_1_2)
lola: processed formula length: 25
lola: 42 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-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: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(ti_0_1v_1_2) AND NOT FIREABLE(to_1_2v_2_2)) OR FIREABLE(ti_0_2v_1_2))))
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 (((NOT FIREABLE(ti_0_1v_1_2) AND NOT FIREABLE(to_1_2v_2_2)) OR FIREABLE(ti_0_2v_1_2))))
lola: processed formula length: 93
lola: 42 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1t12-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: ((FIREABLE(ti_0_1v_1_2) OR FIREABLE(to_1_2v_2_2)) AND NOT FIREABLE(ti_0_2v_1_2))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1t12-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no yes no yes yes no yes yes yes no yes yes yes yes
lola:
preliminary result: no yes no yes no yes yes no yes yes yes no yes yes yes yes
lola: memory consumption: 14812 KB
lola: time consumption: 2 seconds

BK_STOP 1527021573302

--------------------
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-d2n3m1t12"
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-d2n3m1t12.tgz
mv NeighborGrid-PT-d2n3m1t12 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-d2n3m1t12, 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-152666469200214"
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 ;