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 4.3M
-rw-r--r-- 1 mcc users 3.3K May 29 18:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 29 18:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 28 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 28 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 28 09:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 28 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K May 28 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.3K May 27 06:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 27 06:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 26 07:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K May 26 07:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 3 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 4.1M May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DLCflexbar-PT-4b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145700414
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528111364651

info: Time: 3600 - MCC
===========================================================================================
prep: translating DLCflexbar-PT-4b Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating DLCflexbar-PT-4b formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ DLCflexbar-PT-4b @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 28568/65536 symbol table entries, 10549 collisions
lola: preprocessing...
lola: Size of bit vector: 11440
lola: finding significant places
lola: 11440 places, 17128 transitions, 10832 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 23915 transition conflict sets
lola: TASK
lola: reading formula from DLCflexbar-PT-4b-ReachabilityFireability.task
lola: A (G (((NOT FIREABLE(t6037) OR NOT FIREABLE(t946) OR (FIREABLE(t3814) AND NOT FIREABLE(t6766))) AND (NOT FIREABLE(t11537) OR NOT FIREABLE(t15075) OR FIREABLE(t340) OR FIREABLE(t3083) OR FIREABLE(t1193))))) : E (F (FIREABLE(t8485))) : E (F (FIREABLE(t4728))) : E (F (FIREABLE(t15469))) : E (F (FIREABLE(t12487))) : A (G ((((FIREABLE(t14619) OR FIREABLE(t4287) OR NOT FIREABLE(t13981)) AND (NOT FIREABLE(t3992) OR FIREABLE(t5932))) OR ((FIREABLE(t14362) OR FIREABLE(t15539)) AND FIREABLE(t15054) AND (NOT FIREABLE(t14211) OR NOT FIREABLE(t4045)))))) : E (F (FIREABLE(t5378))) : E (F ((FIREABLE(t16370) AND FIREABLE(t3695) AND NOT FIREABLE(t2476) AND NOT FIREABLE(t12268) AND (NOT FIREABLE(t8059) OR NOT FIREABLE(t13964))))) : A (G (NOT FIREABLE(t12245))) : E (F (FIREABLE(t6560))) : A (G ((NOT FIREABLE(t12734) AND NOT FIREABLE(t3828) AND (NOT FIREABLE(t16762) OR NOT FIREABLE(t12825)) AND NOT FIREABLE(t4485)))) : A (G (NOT FIREABLE(t5465))) : E (F (FIREABLE(t15278))) : E (F (FIREABLE(t1485))) : E (F (FIREABLE(t975))) : E (F (((FIREABLE(t7398) AND FIREABLE(t4612) AND FIREABLE(t3528)) OR FIREABLE(t9202) OR ((NOT FIREABLE(t4498) OR NOT FIREABLE(t1967)) AND FIREABLE(t5433)))))
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(t8485)))
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(t8485)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4b-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(t8485)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4b-ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-4b-ReachabilityFireability-0.sara.
lola: sara is running 0 secs || 5789 markings, 6918 edges, 1158 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9861 markings, 11644 edges
lola: ========================================

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

FORMULA DLCflexbar-PT-4b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t15469)))
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(t15469)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4b-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(t15469)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4b-ReachabilityFireability-2-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-4b-ReachabilityFireability-2-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 437 markings, 436 edges
lola: ========================================

FORMULA DLCflexbar-PT-4b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t12487)))
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(t12487)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4b-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(t12487)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4b-ReachabilityFireability-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-4b-ReachabilityFireability-3-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 270 markings, 269 edges
lola: ========================================

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

FORMULA DLCflexbar-PT-4b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t12245)))
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(t12245)))
lola: processed formula length: 28
lola: 2 rewrites
lola: closed formula file DLCflexbar-PT-4b-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(t12245)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4b-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-4b-ReachabilityFireability-5-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 266 markings, 265 edges
lola: ========================================

FORMULA DLCflexbar-PT-4b-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t6560)))
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(t6560)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4b-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(t6560)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4b-ReachabilityFireability-6-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: 16 markings, 15 edges
lola: ========================================

FORMULA DLCflexbar-PT-4b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t5465)))
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(t5465)))
lola: processed formula length: 27
lola: 2 rewrites
lola: closed formula file DLCflexbar-PT-4b-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(t5465)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4b-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-4b-ReachabilityFireability-7-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 552 markings, 551 edges
lola: ========================================

FORMULA DLCflexbar-PT-4b-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t15278)))
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(t15278)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4b-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(t15278)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4b-ReachabilityFireability-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-4b-ReachabilityFireability-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2200 markings, 2426 edges
lola: ========================================

FORMULA DLCflexbar-PT-4b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1485)))
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(t1485)))
lola: processed formula length: 23
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4b-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(t1485)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4b-ReachabilityFireability-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-4b-ReachabilityFireability-9-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 154 markings, 153 edges
lola: ========================================

FORMULA DLCflexbar-PT-4b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t975)))
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(t975)))
lola: processed formula length: 22
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4b-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(t975)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4b-ReachabilityFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-4b-ReachabilityFireability-10-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 103 markings, 102 edges
lola: ========================================

FORMULA DLCflexbar-PT-4b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t12734) AND NOT FIREABLE(t3828) AND (NOT FIREABLE(t16762) OR NOT FIREABLE(t12825)) AND NOT FIREABLE(t4485))))
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(t12734) AND NOT FIREABLE(t3828) AND (NOT FIREABLE(t16762) OR NOT FIREABLE(t12825)) AND NOT FIREABLE(t4485))))
lola: processed formula length: 130
lola: 2 rewrites
lola: closed formula file DLCflexbar-PT-4b-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(t12734) OR FIREABLE(t3828) OR (FIREABLE(t16762) AND FIREABLE(t12825)) OR FIREABLE(t4485))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4b-ReachabilityFireability-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-4b-ReachabilityFireability-11-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 371 markings, 370 edges
lola: ========================================

FORMULA DLCflexbar-PT-4b-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t16370) AND FIREABLE(t3695) AND NOT FIREABLE(t2476) AND NOT FIREABLE(t12268) AND (NOT FIREABLE(t8059) OR NOT FIREABLE(t13964)))))
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(t16370) AND FIREABLE(t3695) AND NOT FIREABLE(t2476) AND NOT FIREABLE(t12268) AND (NOT FIREABLE(t8059) OR NOT FIREABLE(t13964)))))
lola: processed formula length: 146
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4b-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(t16370) AND FIREABLE(t3695) AND NOT FIREABLE(t2476) AND NOT FIREABLE(t12268) AND (NOT FIREABLE(t8059) OR NOT FIREABLE(t13964)))
lola: state equation: Generated DNF with 36 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4b-ReachabilityFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-4b-ReachabilityFireability-12-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 416 markings, 415 edges
lola: ========================================

FORMULA DLCflexbar-PT-4b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t7398) AND FIREABLE(t4612) AND FIREABLE(t3528)) OR FIREABLE(t9202) OR ((NOT FIREABLE(t4498) OR NOT FIREABLE(t1967)) AND FIREABLE(t5433)))))
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(t7398) AND FIREABLE(t4612) AND FIREABLE(t3528)) OR FIREABLE(t9202) OR ((NOT FIREABLE(t4498) OR NOT FIREABLE(t1967)) AND FIREABLE(t5433)))))
lola: processed formula length: 159
lola: 1 rewrites
lola: closed formula file DLCflexbar-PT-4b-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(t7398) AND FIREABLE(t4612) AND FIREABLE(t3528)) OR FIREABLE(t9202) OR ((NOT FIREABLE(t4498) OR NOT FIREABLE(t1967)) AND FIREABLE(t5433)))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4b-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-4b-ReachabilityFireability-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4269 markings, 4813 edges
lola: ========================================

FORMULA DLCflexbar-PT-4b-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1777 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t6037) OR NOT FIREABLE(t946) OR (FIREABLE(t3814) AND NOT FIREABLE(t6766))) AND (NOT FIREABLE(t11537) OR NOT FIREABLE(t15075) OR FIREABLE(t340) OR FIREABLE(t3083) OR FIREABLE(t1193)))))
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(t6037) OR NOT FIREABLE(t946) OR (FIREABLE(t3814) AND NOT FIREABLE(t6766))) AND (NOT FIREABLE(t11537) OR NOT FIREABLE(t15075) OR FIREABLE(t340) OR FIREABLE(t3083) OR FIREABLE(t1193)))))
lola: processed formula length: 211
lola: 2 rewrites
lola: closed formula file DLCflexbar-PT-4b-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(t6037) AND FIREABLE(t946) AND (NOT FIREABLE(t3814) OR FIREABLE(t6766))) OR (FIREABLE(t11537) AND FIREABLE(t15075) AND NOT FIREABLE(t340) AND NOT FIREABLE(t3083) AND NOT FIREABLE(t1193)))
lola: state equation: Generated DNF with 13 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4b-ReachabilityFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-4b-ReachabilityFireability-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 219 markings, 218 edges
lola: ========================================

FORMULA DLCflexbar-PT-4b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3555 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(t14619) OR FIREABLE(t4287) OR NOT FIREABLE(t13981)) AND (NOT FIREABLE(t3992) OR FIREABLE(t5932))) OR ((FIREABLE(t14362) OR FIREABLE(t15539)) AND FIREABLE(t15054) AND (NOT FIREABLE(t14211) OR NOT FIREABLE(t4045))))))
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(t14619) OR FIREABLE(t4287) OR NOT FIREABLE(t13981)) AND (NOT FIREABLE(t3992) OR FIREABLE(t5932))) OR ((FIREABLE(t14362) OR FIREABLE(t15539)) AND FIREABLE(t15054) AND (NOT FIREABLE(t14211) OR NOT FIREABLE(t4045))))))
lola: processed formula length: 239
lola: 2 rewrites
lola: closed formula file DLCflexbar-PT-4b-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(t14619) AND NOT FIREABLE(t4287) AND FIREABLE(t13981)) OR (FIREABLE(t3992) AND NOT FIREABLE(t5932))) AND ((NOT FIREABLE(t14362) AND NOT FIREABLE(t15539)) OR NOT FIREABLE(t15054) OR (FIREABLE(t14211) AND FIREABLE(t4045))))
lola: state equation: Generated DNF with 109 literals and 21 conjunctive subformulas
lola: state equation: write sara problem file to DLCflexbar-PT-4b-ReachabilityFireability-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCflexbar-PT-4b-ReachabilityFireability-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 519 markings, 521 edges
lola: ========================================

FORMULA DLCflexbar-PT-4b-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes yes yes no yes yes no yes no no yes yes yes yes
lola:
preliminary result: no yes yes yes yes no yes yes no yes no no yes yes yes yes
lola: memory consumption: 37580 KB
lola: time consumption: 14 seconds

BK_STOP 1528111379271

--------------------
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="DLCflexbar-PT-4b"
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/DLCflexbar-PT-4b.tgz
mv DLCflexbar-PT-4b 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 DLCflexbar-PT-4b, 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 r268-smll-152749145700414"
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 ;