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 196K
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K 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 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 24K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is TCPcondis-PT-05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-152708743000182
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527235327283

info: Time: 3600 - MCC
===========================================================================================
prep: translating TCPcondis-PT-05 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating TCPcondis-PT-05 formula ReachabilityFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityFireability @ TCPcondis-PT-05 @ 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: 62/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 960
lola: finding significant places
lola: 30 places, 32 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 48 transition conflict sets
lola: TASK
lola: reading formula from TCPcondis-PT-05-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(xraf) AND FIREABLE(xraf2) AND FIREABLE(xPOPEN) AND FIREABLE(xCLOSE2)))) : A (G ((NOT FIREABLE(ras) OR NOT FIREABLE(end) OR FIREABLE(SEND) OR (NOT FIREABLE(POPEN) AND NOT FIREABLE(xraf1))))) : E (F ((FIREABLE(xSEND) AND FIREABLE(xCLOSE3) AND FIREABLE(xrf2) AND FIREABLE(end) AND FIREABLE(POPEN)))) : E (F ((FIREABLE(xCLOSE2) AND FIREABLE(xPOPEN) AND FIREABLE(xSEND) AND NOT FIREABLE(raf) AND NOT FIREABLE(raf1) AND NOT FIREABLE(SEND) AND FIREABLE(xraf)))) : E (F (((FIREABLE(xend) OR (FIREABLE(xrs1) AND FIREABLE(xSEND))) AND FIREABLE(raf) AND (FIREABLE(xCLOSE3) OR FIREABLE(xraf1))))) : E (F ((FIREABLE(xraf2) AND FIREABLE(xraf) AND (FIREABLE(xrf2) OR FIREABLE(rsa)) AND FIREABLE(xSEND) AND FIREABLE(SEND) AND (NOT FIREABLE(raf1) OR NOT FIREABLE(rf2))))) : A (G (())) : A (G ((NOT FIREABLE(xraf1) OR NOT FIREABLE(xCLOSE3) OR FIREABLE(rf2) OR (FIREABLE(rs1)) OR (FIREABLE(raf1) AND FIREABLE(rs1))))) : E (F ((FIREABLE(raf1) AND FIREABLE(xras) AND FIREABLE(CLOSE2)))) : A (G ((((NOT FIREABLE(xrs) OR NOT FIREABLE(rf)) AND (NOT FIREABLE(SEND) OR NOT FIREABLE(raf))) OR (NOT FIREABLE(xras) AND (FIREABLE(xend) OR FIREABLE(xCLOSE2) OR NOT FIREABLE(end)))))) : A (G (((FIREABLE(xrs) AND FIREABLE(xraf)) OR (FIREABLE(xrs1) AND FIREABLE(rf1)) OR NOT FIREABLE(end) OR NOT FIREABLE(rs) OR NOT FIREABLE(rs1)))) : A (G (((NOT FIREABLE(rsa) OR NOT FIREABLE(rf1) OR (NOT FIREABLE(rf) AND NOT FIREABLE(CLOSE2))) AND (NOT FIREABLE(rf2) OR NOT FIREABLE(raf) OR FIREABLE(xras))))) : E (F (((FIREABLE(xSEND) OR FIREABLE(POPEN)) AND FIREABLE(xrf2) AND FIREABLE(xAOPEN) AND (FIREABLE(rf2) OR FIREABLE(raf))))) : A (G ((FIREABLE(rs1) OR NOT FIREABLE(rsa) OR NOT FIREABLE(xrs)))) : E (F ((FIREABLE(rf2) AND FIREABLE(raf2)))) : A (G (NOT FIREABLE(end)))
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: 3 rewrites
lola: closed formula file TCPcondis-PT-05-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 TCPcondis-PT-05-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(end)))
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(end)))
lola: processed formula length: 25
lola: 5 rewrites
lola: closed formula file TCPcondis-PT-05-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(end)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to TCPcondis-PT-05-ReachabilityFireability-0.sara
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
lola: state equation: calling and running sara

FORMULA TCPcondis-PT-05-ReachabilityFireability-15 FALSE 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(rf2) AND FIREABLE(raf2))))
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(rf2) AND FIREABLE(raf2))))
lola: processed formula length: 42
lola: 4 rewrites
lola: closed formula file TCPcondis-PT-05-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(rf2) AND FIREABLE(raf2))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulassara: try reading problem file TCPcondis-PT-05-ReachabilityFireability-0.sara.

lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges

FORMULA TCPcondis-PT-05-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(raf1) AND FIREABLE(xras) AND FIREABLE(CLOSE2))))
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(raf1) AND FIREABLE(xras) AND FIREABLE(CLOSE2))))
lola: processed formula length: 64
lola: 4 rewrites
lola: closed formula file TCPcondis-PT-05-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(raf1) AND FIREABLE(xras) AND FIREABLE(CLOSE2))
lola: SUBRESULT
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================

FORMULA TCPcondis-PT-05-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(rs1) OR NOT FIREABLE(rsa) OR NOT FIREABLE(xrs))))
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(rs1) OR NOT FIREABLE(rsa) OR NOT FIREABLE(xrs))))
lola: processed formula length: 67
lola: 5 rewrites
lola: closed formula file TCPcondis-PT-05-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(rs1) AND FIREABLE(rsa) AND FIREABLE(xrs))
lola: state equation: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(xraf) AND FIREABLE(xraf2) AND FIREABLE(xPOPEN) AND FIREABLE(xCLOSE2))))
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(xraf) AND FIREABLE(xraf2) AND FIREABLE(xPOPEN) AND FIREABLE(xCLOSE2))))
lola: processed formula length: 91
lola: 4 rewrites
lola: closed formula file TCPcondis-PT-05-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(xraf) AND FIREABLE(xraf2) AND FIREABLE(xPOPEN) AND FIREABLE(xCLOSE2))
sara: place or transition ordering is non-deterministic
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-05-ReachabilityFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file TCPcondis-PT-05-ReachabilityFireability-5-0.sara.
lola: SUBRESULT

lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 350 markings, 394 edges
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityFireability-0 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 ((NOT FIREABLE(ras) OR NOT FIREABLE(end) OR FIREABLE(SEND) OR (NOT FIREABLE(POPEN) AND NOT FIREABLE(xraf1)))))
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(ras) OR NOT FIREABLE(end) OR FIREABLE(SEND) OR (NOT FIREABLE(POPEN) AND NOT FIREABLE(xraf1)))))
lola: processed formula length: 118
lola: 5 rewrites
lola: closed formula file TCPcondis-PT-05-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(ras) AND FIREABLE(end) AND NOT FIREABLE(SEND) AND (FIREABLE(POPEN) OR FIREABLE(xraf1)))
lola: state equation: Generated DNF with 11 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola:
FORMULA TCPcondis-PT-05-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
state equation: write sara problem file to TCPcondis-PT-05-ReachabilityFireability-6-0.sara
lola: lola: ========================================
========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(xraf1) OR NOT FIREABLE(xCLOSE3) OR FIREABLE(rf2) OR (FIREABLE(rs1)) OR (FIREABLE(raf1) AND FIREABLE(rs1)))))
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(xraf1) OR NOT FIREABLE(xCLOSE3) OR FIREABLE(rf2) OR (FIREABLE(rs1)) OR (FIREABLE(raf1) AND FIREABLE(rs1)))))
lola: processed formula length: 132
lola: 5 rewrites
lola: closed formula file TCPcondis-PT-05-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(xraf1) AND FIREABLE(xCLOSE3) AND NOT FIREABLE(rf2) AND (NOT FIREABLE(rs1)) AND (NOT FIREABLE(raf1) OR NOT FIREABLE(rs1)))
lola: state equation: Generated DNF with 96 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-05-ReachabilityFireability-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file TCPcondis-PT-05-ReachabilityFireability-7-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges

FORMULA TCPcondis-PT-05-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(xSEND) AND FIREABLE(xCLOSE3) AND FIREABLE(xrf2) AND FIREABLE(end) AND FIREABLE(POPEN))))
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(xSEND) AND FIREABLE(xCLOSE3) AND FIREABLE(xrf2) AND FIREABLE(end) AND FIREABLE(POPEN))))
lola: processed formula length: 104
lola: 4 rewrites
lola: closed formula file TCPcondis-PT-05-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(xSEND) AND FIREABLE(xCLOSE3) AND FIREABLE(xrf2) AND FIREABLE(end) AND FIREABLE(POPEN))
lola: state equation: Generated DNF with 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-05-ReachabilityFireability-8-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityFireability-2 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(xSEND) OR FIREABLE(POPEN)) AND FIREABLE(xrf2) AND FIREABLE(xAOPEN) AND (FIREABLE(rf2) OR FIREABLE(raf)))))
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(xSEND) OR FIREABLE(POPEN)) AND FIREABLE(xrf2) AND FIREABLE(xAOPEN) AND (FIREABLE(rf2) OR FIREABLE(raf)))))
lola: processed formula length: 125
lola: 4 rewrites
lola: closed formula file TCPcondis-PT-05-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(xSEND) OR FIREABLE(POPEN)) AND FIREABLE(xrf2) AND FIREABLE(xAOPEN) AND (FIREABLE(rf2) OR FIREABLE(raf)))
lola: state equation: Generated DNF with 24 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-05-ReachabilityFireability-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 26 markings, 25 edges
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityFireability-12 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(xend) OR (FIREABLE(xrs1) AND FIREABLE(xSEND))) AND FIREABLE(raf) AND (FIREABLE(xCLOSE3) OR FIREABLE(xraf1)))))
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(xend) OR (FIREABLE(xrs1) AND FIREABLE(xSEND))) AND FIREABLE(raf) AND (FIREABLE(xCLOSE3) OR FIREABLE(xraf1)))))
lola: processed formula length: 129
lola: 4 rewrites
lola: closed formula file TCPcondis-PT-05-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(xend) OR (FIREABLE(xrs1) AND FIREABLE(xSEND))) AND FIREABLE(raf) AND (FIREABLE(xCLOSE3) OR FIREABLE(xraf1)))
lola: state equation: Generated DNF with 22 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-05-ReachabilityFireability-10-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(xrs) AND FIREABLE(xraf)) OR (FIREABLE(xrs1) AND FIREABLE(rf1)) OR NOT FIREABLE(end) OR NOT FIREABLE(rs) OR NOT FIREABLE(rs1))))
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(xrs) AND FIREABLE(xraf)) OR (FIREABLE(xrs1) AND FIREABLE(rf1)) OR NOT FIREABLE(end) OR NOT FIREABLE(rs) OR NOT FIREABLE(rs1))))
lola: processed formula length: 148
lola: 5 rewrites
lola: closed formula file TCPcondis-PT-05-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(xrs) OR NOT FIREABLE(xraf)) AND (NOT FIREABLE(xrs1) OR NOT FIREABLE(rf1)) AND FIREABLE(end) AND FIREABLE(rs) AND FIREABLE(rs1))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: state equation: Generated DNF with 112 literals and 16 conjunctive subformulas
state equation: calling and running sara
sara: try reading problem file TCPcondis-PT-05-ReachabilityFireability-10-0.sara.
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityFireability-10 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: A (G (((NOT FIREABLE(rsa) OR NOT FIREABLE(rf1) OR (NOT FIREABLE(rf) AND NOT FIREABLE(CLOSE2))) AND (NOT FIREABLE(rf2) OR NOT FIREABLE(raf) OR FIREABLE(xras)))))
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(rsa) OR NOT FIREABLE(rf1) OR (NOT FIREABLE(rf) AND NOT FIREABLE(CLOSE2))) AND (NOT FIREABLE(rf2) OR NOT FIREABLE(raf) OR FIREABLE(xras)))))
lola: processed formula length: 164
lola: 5 rewrites
lola: closed formula file TCPcondis-PT-05-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(rsa) AND FIREABLE(rf1) AND (FIREABLE(rf) OR FIREABLE(CLOSE2))) OR (FIREABLE(rf2) AND FIREABLE(raf) AND NOT FIREABLE(xras)))
lola: state equation: Generated DNF with 23 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: state equation: write sara problem file to TCPcondis-PT-05-ReachabilityFireability-12-0.sara
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityFireability-11 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: E (F ((FIREABLE(xCLOSE2) AND FIREABLE(xPOPEN) AND FIREABLE(xSEND) AND NOT FIREABLE(raf) AND NOT FIREABLE(raf1) AND NOT FIREABLE(SEND) AND FIREABLE(xraf))))
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(xCLOSE2) AND FIREABLE(xPOPEN) AND FIREABLE(xSEND) AND NOT FIREABLE(raf) AND NOT FIREABLE(raf1) AND NOT FIREABLE(SEND) AND FIREABLE(xraf))))
lola: processed formula length: 155
lola: 4 rewrites
lola: closed formula file TCPcondis-PT-05-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(xCLOSE2) AND FIREABLE(xPOPEN) AND FIREABLE(xSEND) AND NOT FIREABLE(raf) AND NOT FIREABLE(raf1) AND NOT FIREABLE(SEND) AND FIREABLE(xraf))
lola: state equation: Generated DNF with 32 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-05-ReachabilityFireability-13-0.sara
lola: state equation: calling and running sara
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityFireability-3 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 ((FIREABLE(xraf2) AND FIREABLE(xraf) AND (FIREABLE(xrf2) OR FIREABLE(rsa)) AND FIREABLE(xSEND) AND FIREABLE(SEND) AND (NOT FIREABLE(raf1) OR NOT FIREABLE(rf2)))))
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(xraf2) AND FIREABLE(xraf) AND (FIREABLE(xrf2) OR FIREABLE(rsa)) AND FIREABLE(xSEND) AND FIREABLE(SEND) AND (NOT FIREABLE(raf1) OR NOT FIREABLE(rf2)))))
lola: processed formula length: 169
lola: 4 rewrites
lola: closed formula file TCPcondis-PT-05-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(xraf2) AND FIREABLE(xraf) AND (FIREABLE(xrf2) OR FIREABLE(rsa)) AND FIREABLE(xSEND) AND FIREABLE(SEND) AND (NOT FIREABLE(raf1) OR NOT FIREABLE(rf2)))
lola: state equation: Generated DNF with 76 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-05-ReachabilityFireability-14-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: 21 markings, 20 edges
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityFireability-5 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 ((((NOT FIREABLE(xrs) OR NOT FIREABLE(rf)) AND (NOT FIREABLE(SEND) OR NOT FIREABLE(raf))) OR (NOT FIREABLE(xras) AND (FIREABLE(xend) OR FIREABLE(xCLOSE2) OR NOT FIREABLE(end))))))
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(xrs) OR NOT FIREABLE(rf)) AND (NOT FIREABLE(SEND) OR NOT FIREABLE(raf))) OR (NOT FIREABLE(xras) AND (FIREABLE(xend) OR FIREABLE(xCLOSE2) OR NOT FIREABLE(end))))))
lola: processed formula length: 189
lola: 5 rewrites
lola: closed formula file TCPcondis-PT-05-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: 15 markings, 14 edges
lola: ========================================

FORMULA TCPcondis-PT-05-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes yes yes yes yes no yes no no no yes yes yes no
lola:
preliminary result: yes no yes yes yes yes yes no yes no no no yes yes yes no

lola: memory consumption: 14808 KB
lola: time consumption: 0 seconds

BK_STOP 1527235327622

--------------------
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="TCPcondis-PT-05"
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/TCPcondis-PT-05.tgz
mv TCPcondis-PT-05 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 TCPcondis-PT-05, 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 r172-smll-152708743000182"
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 ;