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 216K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K 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 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.5K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 50K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Eratosthenes-PT-050, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649997900021
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526598674604

info: Time: 3600 - MCC
===========================================================================================
prep: translating Eratosthenes-PT-050 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating Eratosthenes-PT-050 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Eratosthenes-PT-050 @ 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: 157/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 49
lola: finding significant places
lola: 49 places, 108 transitions, 34 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 131 transition conflict sets
lola: TASK
lola: reading formula from Eratosthenes-PT-050-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t40.4) OR NOT FIREABLE(t30.3) OR FIREABLE(t8.2) OR FIREABLE(t36.12) OR (FIREABLE(t18.6) AND FIREABLE(t39.3)) OR (FIREABLE(t32.8) AND FIREABLE(t6.3) AND (FIREABLE(t8.2) OR FIREABLE(t4.2)) AND (FIREABLE(t42.2) OR FIREABLE(t44.2) OR NOT FIREABLE(t22.11)))))) : A (G ((FIREABLE(t48.4) OR ((FIREABLE(t22.2) OR FIREABLE(t24.4)) AND (FIREABLE(t24.8) OR FIREABLE(t18.9))) OR FIREABLE(t12.6)))) : E (F ((NOT FIREABLE(t28.14) AND NOT FIREABLE(t48.8) AND NOT FIREABLE(t35.7) AND (NOT FIREABLE(t42.21) OR NOT FIREABLE(t45.3) OR FIREABLE(t32.2))))) : A (G (((NOT FIREABLE(t18.2) AND NOT FIREABLE(t30.6)) OR NOT FIREABLE(t42.21) OR FIREABLE(t21.7)))) : A (G ((NOT FIREABLE(t35.7) OR FIREABLE(t35.5) OR (NOT FIREABLE(t44.2) AND NOT FIREABLE(t30.2) AND (NOT FIREABLE(t50.5) OR NOT FIREABLE(t30.10)))))) : A (G ((FIREABLE(t32.8) OR FIREABLE(t36.18) OR FIREABLE(t42.7)))) : A (G ((FIREABLE(t50.2) OR FIREABLE(t35.7) OR FIREABLE(t48.12) OR FIREABLE(t40.10)))) : E (F ((NOT FIREABLE(t4.2) AND NOT FIREABLE(t42.3) AND NOT FIREABLE(t36.9) AND (NOT FIREABLE(t40.5) OR (NOT FIREABLE(t21.3) AND NOT FIREABLE(t36.12)))))) : A (G ((FIREABLE(t33.3) OR FIREABLE(t32.4) OR NOT FIREABLE(t28.2) OR FIREABLE(t32.8) OR FIREABLE(t40.4)))) : A (G ((NOT FIREABLE(t42.6) AND ((FIREABLE(t36.3) AND FIREABLE(t32.16)) OR FIREABLE(t27.3) OR ((FIREABLE(t33.3) OR FIREABLE(t34.17)) AND (FIREABLE(t6.3) OR FIREABLE(t42.21))))))) : A (G ((NOT FIREABLE(t20.10) OR FIREABLE(t15.5)))) : E (F (FIREABLE(t50.2))) : E (F (((FIREABLE(t36.2) OR FIREABLE(t45.5)) AND (NOT FIREABLE(t48.6) OR NOT FIREABLE(t42.2) OR NOT FIREABLE(t18.6))))) : E (F ((NOT FIREABLE(t39.13) AND (FIREABLE(t45.15) OR (NOT FIREABLE(t12.4) AND NOT FIREABLE(t45.5)))))) : E (F (((NOT FIREABLE(t39.3) OR NOT FIREABLE(t32.8) OR FIREABLE(t14.2)) AND FIREABLE(t24.6)))) : A (G ((FIREABLE(t28.7) AND FIREABLE(t38.19) AND (NOT FIREABLE(t20.4) OR NOT FIREABLE(t48.24) OR NOT FIREABLE(t36.12) OR NOT FIREABLE(t26.2)))))
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 (F (FIREABLE(t50.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(t50.2)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file Eratosthenes-PT-050-ReachabilityFireability.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(t50.2)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-050-ReachabilityFireability-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA Eratosthenes-PT-050-ReachabilityFireability-11 TRUE 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 ((NOT FIREABLE(t20.10) OR FIREABLE(t15.5))))
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 ((NOT FIREABLE(t20.10) OR FIREABLE(t15.5))))
lola: processed formula length: 50
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-050-ReachabilityFireability.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: (FIREABLE(t20.10) AND NOT FIREABLE(t15.5))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: state equation: write sara problem file to Eratosthenes-PT-050-ReachabilityFireability-0.sara

FORMULA Eratosthenes-PT-050-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t32.8) OR FIREABLE(t36.18) OR FIREABLE(t42.7))))
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(t32.8) OR FIREABLE(t36.18) OR FIREABLE(t42.7))))
lola: processed formula length: 66
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-050-ReachabilityFireability.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(t32.8) AND NOT FIREABLE(t36.18) AND NOT FIREABLE(t42.7))
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
sara: try reading problem file Eratosthenes-PT-050-ReachabilityFireability-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to Eratosthenes-PT-050-ReachabilityFireability-2-0.sara
lola: The predicate is not invariant.
lola: 7 markings, 6 edges

FORMULA Eratosthenes-PT-050-ReachabilityFireability-5 FALSE 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: A (G (((NOT FIREABLE(t18.2) AND NOT FIREABLE(t30.6)) OR NOT FIREABLE(t42.21) OR FIREABLE(t21.7))))
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 (((NOT FIREABLE(t18.2) AND NOT FIREABLE(t30.6)) OR NOT FIREABLE(t42.21) OR FIREABLE(t21.7))))
lola: processed formula length: 100
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-050-ReachabilityFireability.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
sara: place or transition ordering is non-deterministic
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((FIREABLE(t18.2) OR FIREABLE(t30.6)) AND FIREABLE(t42.21) AND NOT FIREABLE(t21.7))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas

lola: state equation: write sara problem file to Eratosthenes-PT-050-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Eratosthenes-PT-050-ReachabilityFireability-3-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA Eratosthenes-PT-050-ReachabilityFireability-3 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: A (G ((FIREABLE(t50.2) OR FIREABLE(t35.7) OR FIREABLE(t48.12) OR FIREABLE(t40.10))))
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(t50.2) OR FIREABLE(t35.7) OR FIREABLE(t48.12) OR FIREABLE(t40.10))))
lola: processed formula length: 87
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-050-ReachabilityFireability.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(t50.2) AND NOT FIREABLE(t35.7) AND NOT FIREABLE(t48.12) AND NOT FIREABLE(t40.10))
lola: state equation: Generated DNF with 64 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-050-ReachabilityFireability-4-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================

FORMULA Eratosthenes-PT-050-ReachabilityFireability-6 FALSE 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 (F ((NOT FIREABLE(t39.13) AND (FIREABLE(t45.15) OR (NOT FIREABLE(t12.4) AND NOT FIREABLE(t45.5))))))
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(t39.13) AND (FIREABLE(t45.15) OR (NOT FIREABLE(t12.4) AND NOT FIREABLE(t45.5))))))
lola: processed formula length: 103
lola: 1 rewrites
lola: closed formula file Eratosthenes-PT-050-ReachabilityFireability.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(t39.13) AND (FIREABLE(t45.15) OR (NOT FIREABLE(t12.4) AND NOT FIREABLE(t45.5))))
lola: state equation: Generated DNF with 30 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-050-ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA Eratosthenes-PT-050-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t39.3) OR NOT FIREABLE(t32.8) OR FIREABLE(t14.2)) AND FIREABLE(t24.6))))
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(t39.3) OR NOT FIREABLE(t32.8) OR FIREABLE(t14.2)) AND FIREABLE(t24.6))))
lola: processed formula length: 95
lola: 1 rewrites
lola: closed formula file Eratosthenes-PT-050-ReachabilityFireability.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(t39.3) OR NOT FIREABLE(t32.8) OR FIREABLE(t14.2)) AND FIREABLE(t24.6))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: Generated DNF with 16 literals and 5 conjunctive subformulas
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to Eratosthenes-PT-050-ReachabilityFireability-6-0.sara
lola: ========================================

FORMULA Eratosthenes-PT-050-ReachabilityFireability-14 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: A (G ((FIREABLE(t33.3) OR FIREABLE(t32.4) OR NOT FIREABLE(t28.2) OR FIREABLE(t32.8) OR FIREABLE(t40.4))))
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(t33.3) OR FIREABLE(t32.4) OR NOT FIREABLE(t28.2) OR FIREABLE(t32.8) OR FIREABLE(t40.4))))
lola: processed formula length: 109
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-050-ReachabilityFireability.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(t33.3) AND NOT FIREABLE(t32.4) AND FIREABLE(t28.2) AND NOT FIREABLE(t32.8) AND NOT FIREABLE(t40.4))
lola: state equation: Generated DNF with 96 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-050-ReachabilityFireability-7-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges

FORMULA Eratosthenes-PT-050-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t36.2) OR FIREABLE(t45.5)) AND (NOT FIREABLE(t48.6) OR NOT FIREABLE(t42.2) OR NOT FIREABLE(t18.6)))))
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(t36.2) OR FIREABLE(t45.5)) AND (NOT FIREABLE(t48.6) OR NOT FIREABLE(t42.2) OR NOT FIREABLE(t18.6)))))
lola: processed formula length: 121
lola: 1 rewrites
lola: closed formula file Eratosthenes-PT-050-ReachabilityFireability.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(t36.2) OR FIREABLE(t45.5)) AND (NOT FIREABLE(t48.6) OR NOT FIREABLE(t42.2) OR NOT FIREABLE(t18.6)))
lola: state equation: Generated DNF with 33 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-050-ReachabilityFireability-8-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: 4 markings, 3 edges
lola: ========================================

FORMULA Eratosthenes-PT-050-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t48.4) OR ((FIREABLE(t22.2) OR FIREABLE(t24.4)) AND (FIREABLE(t24.8) OR FIREABLE(t18.9))) OR FIREABLE(t12.6))))
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(t48.4) OR ((FIREABLE(t22.2) OR FIREABLE(t24.4)) AND (FIREABLE(t24.8) OR FIREABLE(t18.9))) OR FIREABLE(t12.6))))
lola: processed formula length: 131
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-050-ReachabilityFireability.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(t48.4) AND ((NOT FIREABLE(t22.2) AND NOT FIREABLE(t24.4)) OR (NOT FIREABLE(t24.8) AND NOT FIREABLE(t18.9))) AND NOT FIREABLE(t12.6))
lola: state equation: Generated DNF with 128 literals and 32 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-050-ReachabilityFireability-9-0.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================

FORMULA Eratosthenes-PT-050-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t4.2) AND NOT FIREABLE(t42.3) AND NOT FIREABLE(t36.9) AND (NOT FIREABLE(t40.5) OR (NOT FIREABLE(t21.3) AND NOT FIREABLE(t36.12))))))
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(t4.2) AND NOT FIREABLE(t42.3) AND NOT FIREABLE(t36.9) AND (NOT FIREABLE(t40.5) OR (NOT FIREABLE(t21.3) AND NOT FIREABLE(t36.12))))))
lola: processed formula length: 153
lola: 1 rewrites
lola: closed formula file Eratosthenes-PT-050-ReachabilityFireability.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(t4.2) AND NOT FIREABLE(t42.3) AND NOT FIREABLE(t36.9) AND (NOT FIREABLE(t40.5) OR (NOT FIREABLE(t21.3) AND NOT FIREABLE(t36.12))))
lola: state equation: Generated DNF with 224 literals and 48 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-050-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23 markings, 22 edges
lola:
========================================
FORMULA Eratosthenes-PT-050-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t35.7) OR FIREABLE(t35.5) OR (NOT FIREABLE(t44.2) AND NOT FIREABLE(t30.2) AND (NOT FIREABLE(t50.5) OR NOT FIREABLE(t30.10))))))
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 ((NOT FIREABLE(t35.7) OR FIREABLE(t35.5) OR (NOT FIREABLE(t44.2) AND NOT FIREABLE(t30.2) AND (NOT FIREABLE(t50.5) OR NOT FIREABLE(t30.10))))))
lola: processed formula length: 150
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-050-ReachabilityFireability.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: (FIREABLE(t35.7) AND NOT FIREABLE(t35.5) AND (FIREABLE(t44.2) OR FIREABLE(t30.2) OR (FIREABLE(t50.5) AND FIREABLE(t30.10))))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-050-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Eratosthenes-PT-050-ReachabilityFireability-11-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA Eratosthenes-PT-050-ReachabilityFireability-4 TRUE 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: E (F ((NOT FIREABLE(t28.14) AND NOT FIREABLE(t48.8) AND NOT FIREABLE(t35.7) AND (NOT FIREABLE(t42.21) OR NOT FIREABLE(t45.3) OR FIREABLE(t32.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(t28.14) AND NOT FIREABLE(t48.8) AND NOT FIREABLE(t35.7) AND (NOT FIREABLE(t42.21) OR NOT FIREABLE(t45.3) OR FIREABLE(t32.2)))))
lola: processed formula length: 149
lola: 1 rewrites
lola: closed formula file Eratosthenes-PT-050-ReachabilityFireability.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(t28.14) AND NOT FIREABLE(t48.8) AND NOT FIREABLE(t35.7) AND (NOT FIREABLE(t42.21) OR NOT FIREABLE(t45.3) OR FIREABLE(t32.2)))
lola: state equation: Generated DNF with 168 literals and 40 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-050-ReachabilityFireability-12-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges

FORMULA Eratosthenes-PT-050-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t28.7) AND FIREABLE(t38.19) AND (NOT FIREABLE(t20.4) OR NOT FIREABLE(t48.24) OR NOT FIREABLE(t36.12) OR NOT FIREABLE(t26.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:694
lola: processed formula: A (G ((FIREABLE(t28.7) AND FIREABLE(t38.19) AND (NOT FIREABLE(t20.4) OR NOT FIREABLE(t48.24) OR NOT FIREABLE(t36.12) OR NOT FIREABLE(t26.2)))))
lola: processed formula length: 146
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-050-ReachabilityFireability.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(t28.7) OR NOT FIREABLE(t38.19) OR (FIREABLE(t20.4) AND FIREABLE(t48.24) AND FIREABLE(t36.12) AND FIREABLE(t26.2)))
lola: state equation: Generated DNF with 12 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges

FORMULA Eratosthenes-PT-050-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: state equation: write sara problem file to Eratosthenes-PT-050-ReachabilityFireability-13-0.sara
lola: ========================================
lola: state equation: calling and running sara
subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t42.6) AND ((FIREABLE(t36.3) AND FIREABLE(t32.16)) OR FIREABLE(t27.3) OR ((FIREABLE(t33.3) OR FIREABLE(t34.17)) AND (FIREABLE(t6.3) OR FIREABLE(t42.21)))))))
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 ((NOT FIREABLE(t42.6) AND ((FIREABLE(t36.3) AND FIREABLE(t32.16)) OR FIREABLE(t27.3) OR ((FIREABLE(t33.3) OR FIREABLE(t34.17)) AND (FIREABLE(t6.3) OR FIREABLE(t42.21)))))))
lola: processed formula length: 181
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-050-ReachabilityFireability.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: (FIREABLE(t42.6) OR ((NOT FIREABLE(t36.3) OR NOT FIREABLE(t32.16)) AND NOT FIREABLE(t27.3) AND ((NOT FIREABLE(t33.3) AND NOT FIREABLE(t34.17)) OR (NOT FIREABLE(t6.3) AND NOT FIREABLE(t42.21)))))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 258 literals and 65 conjunctive subformulas
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to Eratosthenes-PT-050-ReachabilityFireability-14-0.sara
lola: ========================================

FORMULA Eratosthenes-PT-050-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t40.4) OR NOT FIREABLE(t30.3) OR FIREABLE(t8.2) OR FIREABLE(t36.12) OR (FIREABLE(t18.6) AND FIREABLE(t39.3)) OR (FIREABLE(t32.8) AND FIREABLE(t6.3) AND (FIREABLE(t8.2) OR FIREABLE(t4.2)) AND (FIREABLE(t42.2) OR FIREABLE(t44.2) OR NOT FIREABLE(t22.11))))))
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 ((NOT FIREABLE(t40.4) OR NOT FIREABLE(t30.3) OR FIREABLE(t8.2) OR FIREABLE(t36.12) OR (FIREABLE(t18.6) AND FIREABLE(t39.3)) OR (FIREABLE(t32.8) AND FIREABLE(t6.3) AND (FIREABLE(t8.2) OR FIREABLE(t4.2)) AND (FIREABLE(t42.2) OR FIREABLE(t44.2) OR NOT FIREABLE(t22.11))))))
lola: processed formula length: 283
lola: 2 rewrites
lola: closed formula file Eratosthenes-PT-050-ReachabilityFireability.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
sara: try reading problem file Eratosthenes-PT-050-ReachabilityFireability-13-0.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (FIREABLE(t40.4) AND FIREABLE(t30.3) AND NOT FIREABLE(t8.2) AND NOT FIREABLE(t36.12) AND (NOT FIREABLE(t18.6) OR NOT FIREABLE(t39.3)) AND (NOT FIREABLE(t32.8) OR NOT FIREABLE(t6.3) OR (NOT FIREABLE(t8.2) AND NOT FIREABLE(t4.2)) OR (NOT FIREABLE(t42.2) AND NOT FIREABLE(t44.2) AND FIREABLE(t22.11))))
lola: state equation: Generated DNF with 1032 literals and 108 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-050-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA Eratosthenes-PT-050-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes yes no no yes no no no yes yes yes yes no
lola:
preliminary result: no no yes yes yes no no yes no no no yes yes yes yes no
lola: memory consumption: 14792 KB
lola: time consumption: 0 seconds


BK_TIME_CONFINEMENT_REACHED

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