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 204K
-rw-r--r-- 1 mcc users 4.3K May 30 21:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 30 21:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 15:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 15:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 28 09:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K May 28 09:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 28 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.5K May 28 06:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 28 06:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 27 03:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 27 03:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 17K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DoubleExponent-PT-001, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749169600189
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527782691047

info: Time: 3600 - MCC
===========================================================================================
prep: translating DoubleExponent-PT-001 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating DoubleExponent-PT-001 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DoubleExponent-PT-001 @ 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: 105/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1824
lola: finding significant places
lola: 57 places, 48 transitions, 48 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 64 transition conflict sets
lola: TASK
lola: reading formula from DoubleExponent-PT-001-ReachabilityFireability.task
lola: E (F (((FIREABLE(t10) AND FIREABLE(t38) AND NOT FIREABLE(t20)) OR (NOT FIREABLE(t13) AND NOT FIREABLE(t25)) OR (NOT FIREABLE(t44) AND (FIREABLE(t4) OR FIREABLE(t7)) AND (FIREABLE(t35) OR FIREABLE(t22) OR NOT FIREABLE(t21)))))) : E (F ((NOT FIREABLE(t45) OR NOT FIREABLE(t12)))) : E (F (((FIREABLE(t6) AND FIREABLE(t3) AND NOT FIREABLE(t45)) OR NOT FIREABLE(t6) OR (FIREABLE(t40) AND NOT FIREABLE(t24))))) : E (F ((NOT FIREABLE(t22) AND (FIREABLE(t5) OR FIREABLE(t36))))) : A (G (((FIREABLE(t37) AND NOT FIREABLE(t47))))) : A (G ((FIREABLE(t47) AND FIREABLE(t28) AND FIREABLE(t14) AND FIREABLE(t24) AND FIREABLE(t44) AND (FIREABLE(t7) OR FIREABLE(t32) OR FIREABLE(t48) OR FIREABLE(t16))))) : A (G (((NOT FIREABLE(t1) AND NOT FIREABLE(t37) AND (NOT FIREABLE(t37) OR NOT FIREABLE(t12))) OR (NOT FIREABLE(t38) AND NOT FIREABLE(t17) AND FIREABLE(t23))))) : A (G (FIREABLE(t22))) : E (F ((FIREABLE(t3) OR FIREABLE(t45)))) : A (G (((FIREABLE(t44) AND NOT FIREABLE(t1)) OR FIREABLE(t5) OR (FIREABLE(t24) AND FIREABLE(t2) AND (FIREABLE(t16) OR FIREABLE(t41) OR FIREABLE(t48) OR FIREABLE(t20)))))) : E (F (FIREABLE(t26))) : E (F (FIREABLE(t1))) : E (F ((NOT FIREABLE(t6) OR (FIREABLE(t37) AND FIREABLE(t5) AND NOT FIREABLE(t29) AND FIREABLE(t24) AND FIREABLE(t21) AND (FIREABLE(t12) OR FIREABLE(t34)))))) : A (G (((NOT FIREABLE(t24) AND NOT FIREABLE(t17)) OR (FIREABLE(t25) AND NOT FIREABLE(t17))))) : E (F (((FIREABLE(t18) AND FIREABLE(t44) AND NOT FIREABLE(t23) AND ((FIREABLE(t4) AND FIREABLE(t17)) OR NOT FIREABLE(t20))) OR FIREABLE(t44)))) : A (G (FIREABLE(t33)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t22)))
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(t22)))
lola: processed formula length: 21
lola: 2 rewrites
lola: closed formula file DoubleExponent-PT-001-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(t22)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DoubleExponent-PT-001-ReachabilityFireability-7 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: E (F (FIREABLE(t26)))
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(t26)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file DoubleExponent-PT-001-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(t26)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-001-ReachabilityFireability-0.sara
lola: lola: state equation: calling and running sara
SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: ========================================

FORMULA DoubleExponent-PT-001-ReachabilityFireability-10 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(t1)))
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(t1)))
lola: processed formula length: 20
lola: 1 rewrites
lola: closed formula file DoubleExponent-PT-001-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(t1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
sara: try reading problem file DoubleExponent-PT-001-ReachabilityFireability-0.sara.

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola:
FORMULA DoubleExponent-PT-001-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to DoubleExponent-PT-001-ReachabilityFireability-2-0.sara
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t33)))
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)))
lola: processed formula length: 21
lola: 2 rewrites
lola: closed formula file DoubleExponent-PT-001-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DoubleExponent-PT-001-ReachabilityFireability-15 FALSE 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(t37) AND NOT FIREABLE(t47)))))
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(t37) AND NOT FIREABLE(t47)))))
lola: processed formula length: 47
lola: 2 rewrites
lola: closed formula file DoubleExponent-PT-001-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges

FORMULA DoubleExponent-PT-001-ReachabilityFireability-4 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 ((NOT FIREABLE(t45) OR NOT FIREABLE(t12))))
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(t45) OR NOT FIREABLE(t12))))
lola: processed formula length: 49
lola: 1 rewrites
lola: closed formula file DoubleExponent-PT-001-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 DoubleExponent-PT-001-ReachabilityFireability-1 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 ((FIREABLE(t3) OR FIREABLE(t45))))
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(t3) OR FIREABLE(t45))))
lola: processed formula length: 40
lola: 1 rewrites
lola: closed formula file DoubleExponent-PT-001-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: 3 markings, 2 edges

FORMULA DoubleExponent-PT-001-ReachabilityFireability-8 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 (((NOT FIREABLE(t24) AND NOT FIREABLE(t17)) OR (FIREABLE(t25) AND NOT FIREABLE(t17)))))
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(t24) AND NOT FIREABLE(t17)) OR (FIREABLE(t25) AND NOT FIREABLE(t17)))))
lola: processed formula length: 93
lola: 2 rewrites
lola: closed formula file DoubleExponent-PT-001-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges

FORMULA DoubleExponent-PT-001-ReachabilityFireability-13 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 ((NOT FIREABLE(t22) AND (FIREABLE(t5) OR FIREABLE(t36)))))
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(t22) AND (FIREABLE(t5) OR FIREABLE(t36)))))
lola: processed formula length: 64
lola: 1 rewrites
lola: closed formula file DoubleExponent-PT-001-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(t22) AND (FIREABLE(t5) OR FIREABLE(t36)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-001-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-001-ReachabilityFireability-8-0.sara.

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA DoubleExponent-PT-001-ReachabilityFireability-3 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: E (F (((FIREABLE(t6) AND FIREABLE(t3) AND NOT FIREABLE(t45)) OR NOT FIREABLE(t6) OR (FIREABLE(t40) AND NOT FIREABLE(t24)))))
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(t6) AND FIREABLE(t3) AND NOT FIREABLE(t45)) OR NOT FIREABLE(t6) OR (FIREABLE(t40) AND NOT FIREABLE(t24)))))
lola: processed formula length: 126
lola: 1 rewrites
lola: closed formula file DoubleExponent-PT-001-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(t6) AND FIREABLE(t3) AND NOT FIREABLE(t45)) OR NOT FIREABLE(t6) OR (FIREABLE(t40) AND NOT FIREABLE(t24)))
lola: state equation: Generated DNF with 9 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-001-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-001-ReachabilityFireability-9-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DoubleExponent-PT-001-ReachabilityFireability-2 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 (((FIREABLE(t18) AND FIREABLE(t44) AND NOT FIREABLE(t23) AND ((FIREABLE(t4) AND FIREABLE(t17)) OR NOT FIREABLE(t20))) OR FIREABLE(t44))))
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) AND FIREABLE(t44) AND NOT FIREABLE(t23) AND ((FIREABLE(t4) AND FIREABLE(t17)) OR NOT FIREABLE(t20))) OR FIREABLE(t44))))
lola: processed formula length: 144
lola: 1 rewrites
lola: closed formula file DoubleExponent-PT-001-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: lola: ========================================
rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((FIREABLE(t18) AND FIREABLE(t44) AND NOT FIREABLE(t23) AND ((FIREABLE(t4) AND FIREABLE(t17)) OR NOT FIREABLE(t20))) OR FIREABLE(t44))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 141 markings, 140 edges
lola: ========================================

FORMULA DoubleExponent-PT-001-ReachabilityFireability-14 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(t1) AND NOT FIREABLE(t37) AND (NOT FIREABLE(t37) OR NOT FIREABLE(t12))) OR (NOT FIREABLE(t38) AND NOT FIREABLE(t17) AND FIREABLE(t23)))))
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(t1) AND NOT FIREABLE(t37) AND (NOT FIREABLE(t37) OR NOT FIREABLE(t12))) OR (NOT FIREABLE(t38) AND NOT FIREABLE(t17) AND FIREABLE(t23)))))
lola: processed formula length: 160
lola: 2 rewrites
lola: closed formula file DoubleExponent-PT-001-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(t1) OR FIREABLE(t37) OR (FIREABLE(t37) AND FIREABLE(t12))) AND (FIREABLE(t38) OR FIREABLE(t17) OR NOT FIREABLE(t23)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 34 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-001-ReachabilityFireability-11-0.sara
lola: ========================================

FORMULA DoubleExponent-PT-001-ReachabilityFireability-6 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: E (F ((NOT FIREABLE(t6) OR (FIREABLE(t37) AND FIREABLE(t5) AND NOT FIREABLE(t29) AND FIREABLE(t24) AND FIREABLE(t21) AND (FIREABLE(t12) OR FIREABLE(t34))))))
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(t6) OR (FIREABLE(t37) AND FIREABLE(t5) AND NOT FIREABLE(t29) AND FIREABLE(t24) AND FIREABLE(t21) AND (FIREABLE(t12) OR FIREABLE(t34))))))
lola: processed formula length: 159
lola: 1 rewrites
lola: closed formula file DoubleExponent-PT-001-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(t6) OR (FIREABLE(t37) AND FIREABLE(t5) AND NOT FIREABLE(t29) AND FIREABLE(t24) AND FIREABLE(t21) AND (FIREABLE(t12) OR FIREABLE(t34))))
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: Generated DNF with 25 literals and 5 conjunctive subformulas
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DoubleExponent-PT-001-ReachabilityFireability-12 TRUE 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(t47) AND FIREABLE(t28) AND FIREABLE(t14) AND FIREABLE(t24) AND FIREABLE(t44) AND (FIREABLE(t7) OR FIREABLE(t32) OR FIREABLE(t48) OR FIREABLE(t16)))))
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(t47) AND FIREABLE(t28) AND FIREABLE(t14) AND FIREABLE(t24) AND FIREABLE(t44) AND (FIREABLE(t7) OR FIREABLE(t32) OR FIREABLE(t48) OR FIREABLE(t16)))))
lola: processed formula length: 168
lola: 2 rewrites
lola: closed formula file DoubleExponent-PT-001-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(t47) OR NOT FIREABLE(t28) OR NOT FIREABLE(t14) OR NOT FIREABLE(t24) OR NOT FIREABLE(t44) OR (NOT FIREABLE(t7) AND NOT FIREABLE(t32) AND NOT FIREABLE(t48) AND NOT FIREABLE(t16)))
lola: state equation: Generated DNF with 23 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-001-ReachabilityFireability-13-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: 0 markings, 0 edges
lola: ========================================

FORMULA DoubleExponent-PT-001-ReachabilityFireability-5 FALSE 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: A (G (((FIREABLE(t44) AND NOT FIREABLE(t1)) OR FIREABLE(t5) OR (FIREABLE(t24) AND FIREABLE(t2) AND (FIREABLE(t16) OR FIREABLE(t41) OR FIREABLE(t48) OR FIREABLE(t20))))))
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(t44) AND NOT FIREABLE(t1)) OR FIREABLE(t5) OR (FIREABLE(t24) AND FIREABLE(t2) AND (FIREABLE(t16) OR FIREABLE(t41) OR FIREABLE(t48) OR FIREABLE(t20))))))
lola: processed formula length: 174
lola: 2 rewrites
lola: closed formula file DoubleExponent-PT-001-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(t44) OR FIREABLE(t1)) AND NOT FIREABLE(t5) AND (NOT FIREABLE(t24) OR NOT FIREABLE(t2) OR (NOT FIREABLE(t16) AND NOT FIREABLE(t41) AND NOT FIREABLE(t48) AND NOT FIREABLE(t20))))
lola: state equation: Generated DNF with 162 literals and 30 conjunctive subformulas
lola: state equation: write sara problem file to DoubleExponent-PT-001-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DoubleExponent-PT-001-ReachabilityFireability-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DoubleExponent-PT-001-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: E (F (((FIREABLE(t10) AND FIREABLE(t38) AND NOT FIREABLE(t20)) OR (NOT FIREABLE(t13) AND NOT FIREABLE(t25)) OR (NOT FIREABLE(t44) AND (FIREABLE(t4) OR FIREABLE(t7)) AND (FIREABLE(t35) OR FIREABLE(t22) OR NOT FIREABLE(t21))))))
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(t10) AND FIREABLE(t38) AND NOT FIREABLE(t20)) OR (NOT FIREABLE(t13) AND NOT FIREABLE(t25)) OR (NOT FIREABLE(t44) AND (FIREABLE(t4) OR FIREABLE(t7)) AND (FIREABLE(t35) OR FIREABLE(t22) OR NOT FIREABLE(t21))))))
lola: processed formula length: 231
lola: 1 rewrites
lola: closed formula file DoubleExponent-PT-001-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: formula 0: ((FIREABLE(t10) AND FIREABLE(t38) AND NOT FIREABLE(t20)) OR (NOT FIREABLE(t13) AND NOT FIREABLE(t25)) OR (NOT FIREABLE(t44) AND (FIREABLE(t4) OR FIREABLE(t7)) AND (FIREABLE(t35) OR FIREABLE(t22) OR NOT FIREABLE(t21))))
FORMULA DoubleExponent-PT-001-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no no no yes no yes yes yes no yes no
lola:
preliminary result: yes yes yes yes no no no no yes no yes yes yes no yes no

lola: state equation: Generated DNF with 52 literals and 15 conjunctive subformulas
lola: ========================================
lola: memory consumption: 14552 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="DoubleExponent-PT-001"
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/DoubleExponent-PT-001.tgz
mv DoubleExponent-PT-001 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 DoubleExponent-PT-001, 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 r280-csrt-152749169600189"
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 ;