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 184K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.3K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K 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 2.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K 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 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 14K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Eratosthenes-PT-020, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649997900014
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526595051027

info: Time: 3600 - MCC
===========================================================================================
prep: translating Eratosthenes-PT-020 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-020 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ Eratosthenes-PT-020 @ 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: 46/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 19
lola: finding significant places
lola: 19 places, 27 transitions, 11 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 36 transition conflict sets
lola: TASK
lola: reading formula from Eratosthenes-PT-020-ReachabilityFireability.task
lola: A (G ((FIREABLE(t9.3) OR FIREABLE(t15.5) OR NOT FIREABLE(t10.5) OR NOT FIREABLE(t16.8) OR FIREABLE(t16.2) OR FIREABLE(t18.9) OR FIREABLE(t6.3)))) : A (G (())) : A (G (())) : A (G ((FIREABLE(t8.2) OR FIREABLE(t8.4) OR (FIREABLE(t12.3) AND FIREABLE(t18.6)) OR FIREABLE(t4.2) OR (NOT FIREABLE(t16.4) AND NOT FIREABLE(t20.4)) OR NOT FIREABLE(t18.2)))) : E (F ((FIREABLE(t12.4) AND FIREABLE(t16.4) AND NOT FIREABLE(t4.2)))) : A (G ((NOT FIREABLE(t18.2) OR NOT FIREABLE(t12.2) OR NOT FIREABLE(t4.2) OR NOT FIREABLE(t9.3) OR FIREABLE(t12.3)))) : A (G ((FIREABLE(t12.3) OR NOT FIREABLE(t12.4)))) : E (F (FIREABLE(t18.6))) : E (F (NOT FIREABLE(t14.2))) : A (G ((NOT FIREABLE(t20.5) OR NOT FIREABLE(t15.5) OR (NOT FIREABLE(t15.3) AND NOT FIREABLE(t18.2) AND FIREABLE(t18.9))))) : A (G (FIREABLE(t20.5))) : E (F (((FIREABLE(t16.2) OR FIREABLE(t18.2)) AND FIREABLE(t18.9)))) : E (F ((NOT FIREABLE(t18.6) AND NOT FIREABLE(t12.4) AND NOT FIREABLE(t20.4) AND NOT FIREABLE(t20.5) AND NOT FIREABLE(t16.2)))) : E (F (FIREABLE(t18.3))) : A (G ((FIREABLE(t10.5) AND FIREABLE(t12.2)))) : E (F (((NOT FIREABLE(t10.2) AND NOT FIREABLE(t16.8) AND NOT FIREABLE(t4.2) AND NOT FIREABLE(t20.10)) OR (NOT FIREABLE(t15.5) AND NOT FIREABLE(t20.2) AND FIREABLE(t18.6)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 6 rewrites
lola: closed formula file Eratosthenes-PT-020-ReachabilityFireability.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: ========================================

FORMULA Eratosthenes-PT-020-ReachabilityFireability-1 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 6 rewrites
lola: closed formula file Eratosthenes-PT-020-ReachabilityFireability.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: ========================================

FORMULA Eratosthenes-PT-020-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (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(t18.6)))
lola: processed formula length: 23
lola: 7 rewrites
lola: closed formula file Eratosthenes-PT-020-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(t18.6)
lola: SUBRESULT
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to Eratosthenes-PT-020-ReachabilityFireability-2-0.sara
lola: lola: ========================================

FORMULA Eratosthenes-PT-020-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: calling and running sara
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(t14.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(t14.2)))
lola: processed formula length: 27
lola: 7 rewrites
lola: closed formula file Eratosthenes-PT-020-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA Eratosthenes-PT-020-ReachabilityFireability-8 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(t20.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 (FIREABLE(t20.5)))
lola: processed formula length: 23
lola: 8 rewrites
lola: closed formula file Eratosthenes-PT-020-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: sara: try reading problem file Eratosthenes-PT-020-ReachabilityFireability-2-0.sara.
rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(t20.5)
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-020-ReachabilityFireability-4-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

FORMULA Eratosthenes-PT-020-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t18.3)))
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(t18.3)))
lola: processed formula length: 23
lola: 7 rewrites
lola: closed formula file Eratosthenes-PT-020-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(t18.3)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-020-ReachabilityFireability-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Eratosthenes-PT-020-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: A (G ((FIREABLE(t12.3) OR NOT FIREABLE(t12.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(t12.3) OR NOT FIREABLE(t12.4))))
lola: processed formula length: 49
lola: 8 rewrites
lola: closed formula file Eratosthenes-PT-020-ReachabilityFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
sara: place or transition ordering is non-deterministic
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(t12.3) AND FIREABLE(t12.4))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-020-ReachabilityFireability-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Eratosthenes-PT-020-ReachabilityFireability-6-0.sara.
sara: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1536 markings, 7424 edges

FORMULA Eratosthenes-PT-020-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t10.5) AND FIREABLE(t12.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(t10.5) AND FIREABLE(t12.2))))
lola: processed formula length: 45
lola: 8 rewrites
lola: closed formula file Eratosthenes-PT-020-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(t10.5) OR NOT FIREABLE(t12.2))
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-020-ReachabilityFireability-7-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: 4 markings, 3 edges
lola: ========================================

FORMULA Eratosthenes-PT-020-ReachabilityFireability-14 FALSE 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 ((FIREABLE(t12.4) AND FIREABLE(t16.4) AND NOT FIREABLE(t4.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(t12.4) AND FIREABLE(t16.4) AND NOT FIREABLE(t4.2))))
lola: processed formula length: 68
lola: 7 rewrites
lola: closed formula file Eratosthenes-PT-020-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(t12.4) AND FIREABLE(t16.4) AND NOT FIREABLE(t4.2))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-020-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Eratosthenes-PT-020-ReachabilityFireability-8-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1024 markings, 4032 edges

FORMULA Eratosthenes-PT-020-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t16.2) OR FIREABLE(t18.2)) AND FIREABLE(t18.9))))
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(t16.2) OR FIREABLE(t18.2)) AND FIREABLE(t18.9))))
lola: processed formula length: 67
lola: 7 rewrites
lola: closed formula file Eratosthenes-PT-020-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Eratosthenes-PT-020-ReachabilityFireability-11 TRUE 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(t18.6) AND NOT FIREABLE(t12.4) AND NOT FIREABLE(t20.4) AND NOT FIREABLE(t20.5) AND NOT FIREABLE(t16.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(t18.6) AND NOT FIREABLE(t12.4) AND NOT FIREABLE(t20.4) AND NOT FIREABLE(t20.5) AND NOT FIREABLE(t16.2))))
lola: processed formula length: 125
lola: 7 rewrites
lola: closed formula file Eratosthenes-PT-020-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(t18.6) AND NOT FIREABLE(t12.4) AND NOT FIREABLE(t20.4) AND NOT FIREABLE(t20.5) AND NOT FIREABLE(t16.2))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: state equation: Generated DNF with 160 literals and 32 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-020-ReachabilityFireability-10-0.sara
lola: ========================================

FORMULA Eratosthenes-PT-020-ReachabilityFireability-12 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(t18.2) OR NOT FIREABLE(t12.2) OR NOT FIREABLE(t4.2) OR NOT FIREABLE(t9.3) OR FIREABLE(t12.3))))
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) OR NOT FIREABLE(t12.2) OR NOT FIREABLE(t4.2) OR NOT FIREABLE(t9.3) OR FIREABLE(t12.3))))
lola: processed formula length: 119
lola: 8 rewrites
lola: closed formula file Eratosthenes-PT-020-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(t18.2) AND FIREABLE(t12.2) AND FIREABLE(t4.2) AND FIREABLE(t9.3) AND NOT FIREABLE(t12.3))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA Eratosthenes-PT-020-ReachabilityFireability-5 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: A (G ((NOT FIREABLE(t20.5) OR NOT FIREABLE(t15.5) OR (NOT FIREABLE(t15.3) AND NOT FIREABLE(t18.2) AND FIREABLE(t18.9)))))
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.5) OR NOT FIREABLE(t15.5) OR (NOT FIREABLE(t15.3) AND NOT FIREABLE(t18.2) AND FIREABLE(t18.9)))))
lola: processed formula length: 123
lola: 8 rewrites
lola: closed formula file Eratosthenes-PT-020-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: formula 0: (FIREABLE(t20.5) AND FIREABLE(t15.5) AND (FIREABLE(t15.3) OR FIREABLE(t18.2) OR NOT FIREABLE(t18.9)))
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 22 literals and 4 conjunctive subformulas
lola: ========================================

FORMULA Eratosthenes-PT-020-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t9.3) OR FIREABLE(t15.5) OR NOT FIREABLE(t10.5) OR NOT FIREABLE(t16.8) OR FIREABLE(t16.2) OR FIREABLE(t18.9) OR FIREABLE(t6.3))))
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(t9.3) OR FIREABLE(t15.5) OR NOT FIREABLE(t10.5) OR NOT FIREABLE(t16.8) OR FIREABLE(t16.2) OR FIREABLE(t18.9) OR FIREABLE(t6.3))))
lola: processed formula length: 151
lola: 8 rewrites
lola: closed formula file Eratosthenes-PT-020-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(t9.3) AND NOT FIREABLE(t15.5) AND FIREABLE(t10.5) AND FIREABLE(t16.8) AND NOT FIREABLE(t16.2) AND NOT FIREABLE(t18.9) AND NOT FIREABLE(t6.3))
lola: state equation: Generated DNF with 72 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to Eratosthenes-PT-020-ReachabilityFireability-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1419 markings, 6182 edges
lola: ========================================

FORMULA Eratosthenes-PT-020-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t10.2) AND NOT FIREABLE(t16.8) AND NOT FIREABLE(t4.2) AND NOT FIREABLE(t20.10)) OR (NOT FIREABLE(t15.5) AND NOT FIREABLE(t20.2) AND 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 (((NOT FIREABLE(t10.2) AND NOT FIREABLE(t16.8) AND NOT FIREABLE(t4.2) AND NOT FIREABLE(t20.10)) OR (NOT FIREABLE(t15.5) AND NOT FIREABLE(t20.2) AND FIREABLE(t18.6)))))
lola: processed formula length: 173
lola: 7 rewrites
lola: closed formula file Eratosthenes-PT-020-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(t10.2) AND NOT FIREABLE(t16.8) AND NOT FIREABLE(t4.2) AND NOT FIREABLE(t20.10)) OR (NOT FIREABLE(t15.5) AND NOT FIREABLE(t20.2) AND FIREABLE(t18.6)))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: state equation: Generated DNF with 80 literals and 20 conjunctive subformulas
lola: ========================================

FORMULA Eratosthenes-PT-020-ReachabilityFireability-15 TRUE 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 ((FIREABLE(t8.2) OR FIREABLE(t8.4) OR (FIREABLE(t12.3) AND FIREABLE(t18.6)) OR FIREABLE(t4.2) OR (NOT FIREABLE(t16.4) AND NOT FIREABLE(t20.4)) OR NOT FIREABLE(t18.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(t8.2) OR FIREABLE(t8.4) OR (FIREABLE(t12.3) AND FIREABLE(t18.6)) OR FIREABLE(t4.2) OR (NOT FIREABLE(t16.4) AND NOT FIREABLE(t20.4)) OR NOT FIREABLE(t18.2))))
lola: processed formula length: 178
lola: 8 rewrites
lola: closed formula file Eratosthenes-PT-020-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(t8.2) AND NOT FIREABLE(t8.4) AND (NOT FIREABLE(t12.3) OR NOT FIREABLE(t18.6)) AND NOT FIREABLE(t4.2) AND (FIREABLE(t16.4) OR FIREABLE(t20.4)) AND FIREABLE(t18.2))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA Eratosthenes-PT-020-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes no yes yes yes yes no no yes yes yes no yes
lola:
preliminary result: yes yes yes yes no yes yes yes yes no no yes yes yes no yes
lola: memory consumption: 14640 KB
lola: time consumption: 0 seconds

BK_STOP 1526595051345

--------------------
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-020"
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-020.tgz
mv Eratosthenes-PT-020 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-020, 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-152649997900014"
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 ;