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 232K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K 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 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 69K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is FlexibleBarrier-PT-04b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-blw7-152649998100109
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526631808557

info: Time: 3600 - MCC
===========================================================================================
prep: translating FlexibleBarrier-PT-04b 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 FlexibleBarrier-PT-04b formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ FlexibleBarrier-PT-04b @ 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: 573/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 268
lola: finding significant places
lola: 268 places, 305 transitions, 262 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 315 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-04b-CTLFireability.task
lola: (E (F (A (F ((FIREABLE(t196) AND FIREABLE(t133)))))) OR (((FIREABLE(t283) OR FIREABLE(t211)) OR A ((FIREABLE(t195) U FIREABLE(t70)))) AND E (F ((FIREABLE(t43) AND FIREABLE(t210) AND FIREABLE(t278)))))) : A (G ((FIREABLE(t122) OR NOT FIREABLE(t167) OR FIREABLE(t23) OR FIREABLE(t285)))) : A (G (NOT(A (X ((FIREABLE(t274) AND FIREABLE(t92))))))) : E (F (FIREABLE(t191))) : (NOT FIREABLE(t282) AND E (F (FIREABLE(t266)))) : NOT(A (F (E (F ((FIREABLE(t239) OR FIREABLE(t251))))))) : E (F (E (((FIREABLE(t186) OR FIREABLE(t157)) U (FIREABLE(t31) OR FIREABLE(t35)))))) : (E ((A (G (FIREABLE(t234))) U A (X (FIREABLE(t250))))) OR (NOT(NOT(E (F (FIREABLE(t301))))) OR E (G (FIREABLE(t219))))) : E (F ((FIREABLE(t98) AND (((FIREABLE(t41) AND FIREABLE(t134)) OR (FIREABLE(t52) AND FIREABLE(t155))) AND E (F (FIREABLE(t274))))))) : E (F ((E ((FIREABLE(t95) U FIREABLE(t271))) OR FIREABLE(t173)))) : E (G (E (F (A (G (FIREABLE(t103))))))) : E (F ((NOT FIREABLE(t27) AND ((FIREABLE(t157) AND FIREABLE(t245)) OR NOT FIREABLE(t269)) AND (FIREABLE(t272) OR FIREABLE(t41) OR FIREABLE(t211)) AND (NOT FIREABLE(t233) OR NOT FIREABLE(t264))))) : (A (F (((NOT FIREABLE(t30) AND NOT FIREABLE(t17)) AND A (G (FIREABLE(t143)))))) OR E (G (A (G (NOT FIREABLE(t210)))))) : E (F ((NOT FIREABLE(t304) AND FIREABLE(t8) AND ((NOT FIREABLE(t9) AND NOT FIREABLE(t150)) OR FIREABLE(t78))))) : (FIREABLE(t70) OR NOT(A (G ((NOT FIREABLE(t148) OR NOT FIREABLE(t230)))))) : (E (G (FIREABLE(t173))) OR E ((NOT FIREABLE(t124) U FIREABLE(t191))))
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:446
lola: rewrite Frontend/Parser/formula_rewrite.k:476
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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 (E (X ((NOT FIREABLE(t274) OR NOT FIREABLE(t92))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX((NOT FIREABLE(t274) OR NOT FIREABLE(t92))))))
lola: processed formula length: 66
lola: 23 rewrites
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 523 markings, 776 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-04b-CTLFireability-2 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 ((A (G (FIREABLE(t234))) U A (X (FIREABLE(t250))))) OR (E (F (FIREABLE(t301))) OR E (G (FIREABLE(t219)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: (E(NOT(E(TRUE U NOT FIREABLE(t234))) U AX(FIREABLE(t250))) OR (E(TRUE U FIREABLE(t301)) OR NOT(A(TRUE U NOT FIREABLE(t219)))))
lola: processed formula length: 126
lola: 28 rewrites
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 4 significant temporal operators and needs 17 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 27 markings, 29 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-04b-CTLFireability-7 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(t191)))
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(t191)))
lola: processed formula length: 22
lola: 22 rewrites
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.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(t191)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04b-CTLFireability-2-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-04b-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t31) OR FIREABLE(t35))))
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(t31) OR FIREABLE(t35))))
lola: processed formula length: 41
lola: 22 rewrites
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.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: 25 markings, 24 edges
lola: formula 0: (FIREABLE(t31) OR FIREABLE(t35))
lola:
FORMULA FlexibleBarrier-PT-04b-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
sara: try reading problem file FlexibleBarrier-PT-04b-CTLFireability-2-0.sara.
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t239) AND NOT FIREABLE(t251))))
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:695
lola: processed formula: A (G ((NOT FIREABLE(t239) AND NOT FIREABLE(t251))))
lola: processed formula length: 51
lola: 23 rewrites
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.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:695
lola: formula 0: (FIREABLE(t239) OR FIREABLE(t251))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04b-CTLFireability-4-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 24 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-04b-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t122) OR NOT FIREABLE(t167) OR FIREABLE(t23) OR FIREABLE(t285))))
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(t122) OR NOT FIREABLE(t167) OR FIREABLE(t23) OR FIREABLE(t285))))
lola: processed formula length: 84
lola: 23 rewrites
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.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(t122) AND FIREABLE(t167) AND NOT FIREABLE(t23) AND NOT FIREABLE(t285))
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04b-CTLFireability-5-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: 20 markings, 19 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-04b-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t304) AND FIREABLE(t8) AND ((NOT FIREABLE(t9) AND NOT FIREABLE(t150)) OR FIREABLE(t78)))))
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(t304) AND FIREABLE(t8) AND ((NOT FIREABLE(t9) AND NOT FIREABLE(t150)) OR FIREABLE(t78)))))
lola: processed formula length: 111
lola: 22 rewrites
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.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(t304) AND FIREABLE(t8) AND ((NOT FIREABLE(t9) AND NOT FIREABLE(t150)) OR FIREABLE(t78)))
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04b-CTLFireability-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: 23 markings, 22 edges
lola: ========================================

FORMULA FlexibleBarrier-PT-04b-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: place or transition ordering is non-deterministic
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t27) AND ((FIREABLE(t157) AND FIREABLE(t245)) OR NOT FIREABLE(t269)) AND (FIREABLE(t272) OR FIREABLE(t41) OR FIREABLE(t211)) AND (NOT FIREABLE(t233) OR NOT FIREABLE(t264)))))
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(t27) AND ((FIREABLE(t157) AND FIREABLE(t245)) OR NOT FIREABLE(t269)) AND (FIREABLE(t272) OR FIREABLE(t41) OR FIREABLE(t211)) AND (NOT FIREABLE(t233) OR NOT FIREABLE(t264)))))
lola: processed formula length: 198
lola: 22 rewrites
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.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(t27) AND ((FIREABLE(t157) AND FIREABLE(t245)) OR NOT FIREABLE(t269)) AND (FIREABLE(t272) OR FIREABLE(t41) OR FIREABLE(t211)) AND (NOT FIREABLE(t233) OR NOT FIREABLE(t264)))
lola: state equation: Generated DNF with 126 literals and 27 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04b-CTLFireability-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 22 markings, 21 edges

FORMULA FlexibleBarrier-PT-04b-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t98) AND (((FIREABLE(t41) AND FIREABLE(t134)) OR (FIREABLE(t52) AND FIREABLE(t155))) AND E (F (FIREABLE(t274)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:719
sara: try reading problem file FlexibleBarrier-PT-04b-CTLFireability-7-0.sara.
lola: processed formula: E(TRUE U (FIREABLE(t98) AND (((FIREABLE(t41) AND FIREABLE(t134)) OR (FIREABLE(t52) AND FIREABLE(t155))) AND E(TRUE U FIREABLE(t274)))))
lola: processed formula length: 136
lola: 23 rewrites
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic

sara: warning, failure of lp_solve (at job 653)
lola: 608906 markings, 1761124 edges, 121781 markings/sec, 0 secs
lola: 1380299 markings, 3906486 edges, 154279 markings/sec, 5 secs
lola: 2181626 markings, 6007990 edges, 160265 markings/sec, 10 secs
lola: 3041353 markings, 8120554 edges, 171945 markings/sec, 15 secs
lola: 3765154 markings, 10263813 edges, 144760 markings/sec, 20 secs
lola: 4446605 markings, 12283784 edges, 136290 markings/sec, 25 secs
lola: 5151689 markings, 14272571 edges, 141017 markings/sec, 30 secs
lola: 5874259 markings, 16274625 edges, 144514 markings/sec, 35 secs
lola: 6543962 markings, 18255309 edges, 133941 markings/sec, 40 secs
lola: 7243464 markings, 20191645 edges, 139900 markings/sec, 45 secs
lola: 7902151 markings, 22130509 edges, 131737 markings/sec, 50 secs
lola: 8555759 markings, 24061861 edges, 130722 markings/sec, 55 secs
lola: 9222467 markings, 25941926 edges, 133342 markings/sec, 60 secs
lola: 9907281 markings, 27812068 edges, 136963 markings/sec, 65 secs
lola: 10587674 markings, 29678142 edges, 136079 markings/sec, 70 secs
lola: 11221305 markings, 31534982 edges, 126726 markings/sec, 75 secs
lola: 11848932 markings, 33390838 edges, 125525 markings/sec, 80 secs
lola: 12453740 markings, 35227644 edges, 120962 markings/sec, 85 secs
lola: 13082724 markings, 37030724 edges, 125797 markings/sec, 90 secs
lola: 13727781 markings, 38845301 edges, 129011 markings/sec, 95 secs
lola: 14349268 markings, 40669505 edges, 124297 markings/sec, 100 secs
lola: 14948503 markings, 42444259 edges, 119847 markings/sec, 105 secs
lola: 15563594 markings, 44258858 edges, 123018 markings/sec, 110 secs
lola: 16201348 markings, 46115683 edges, 127551 markings/sec, 115 secs
lola: 16799022 markings, 47901293 edges, 119535 markings/sec, 120 secs
lola: 17419613 markings, 49705010 edges, 124118 markings/sec, 125 secs
lola: 18082798 markings, 51557555 edges, 132637 markings/sec, 130 secs
lola: 18703594 markings, 53288012 edges, 124159 markings/sec, 135 secs
lola: 19342481 markings, 55088524 edges, 127777 markings/sec, 140 secs
lola: 19936265 markings, 56851440 edges, 118757 markings/sec, 145 secs
lola: 20503648 markings, 58571884 edges, 113477 markings/sec, 150 secs
lola: 21123725 markings, 60299030 edges, 124015 markings/sec, 155 secs
lola: 21739597 markings, 62107094 edges, 123174 markings/sec, 160 secs
lola: 22324900 markings, 63872741 edges, 117061 markings/sec, 165 secs
lola: 22919424 markings, 65648823 edges, 118905 markings/sec, 170 secs
lola: 23481650 markings, 67386964 edges, 112445 markings/sec, 175 secs
lola: 24096423 markings, 69162314 edges, 122955 markings/sec, 180 secs
lola: 24707890 markings, 70893765 edges, 122293 markings/sec, 185 secs
lola: 25303818 markings, 72607970 edges, 119186 markings/sec, 190 secs
lola: 25923988 markings, 74386018 edges, 124034 markings/sec, 195 secs
lola: 26524033 markings, 76140143 edges, 120009 markings/sec, 200 secs
lola: 27124040 markings, 77867602 edges, 120001 markings/sec, 205 secs
lola: 27729611 markings, 79608279 edges, 121114 markings/sec, 210 secs
lola: 28336894 markings, 81332832 edges, 121457 markings/sec, 215 secs
lola: 28939428 markings, 83110688 edges, 120507 markings/sec, 220 secs
lola: 29507902 markings, 84773674 edges, 113695 markings/sec, 225 secs
lola: 30092563 markings, 86482093 edges, 116932 markings/sec, 230 secs
lola: 30663518 markings, 88167681 edges, 114191 markings/sec, 235 secs
lola: 31254699 markings, 89892383 edges, 118236 markings/sec, 240 secs
lola: 31823554 markings, 91538269 edges, 113771 markings/sec, 245 secs
lola: 32412725 markings, 93263000 edges, 117834 markings/sec, 250 secs
lola: 32968370 markings, 94928913 edges, 111129 markings/sec, 255 secs
lola: 33538040 markings, 96632121 edges, 113934 markings/sec, 260 secs
lola: 34105485 markings, 98312765 edges, 113489 markings/sec, 265 secs
lola: 34681222 markings, 99984267 edges, 115147 markings/sec, 270 secs
lola: 35268078 markings, 101741281 edges, 117371 markings/sec, 275 secs
lola: 35833906 markings, 103398805 edges, 113166 markings/sec, 280 secs
lola: 36385226 markings, 105080884 edges, 110264 markings/sec, 285 secs
lola: 36930483 markings, 106712908 edges, 109051 markings/sec, 290 secs
lola: 37494529 markings, 108444407 edges, 112809 markings/sec, 295 secs
lola: 38052907 markings, 110116426 edges, 111676 markings/sec, 300 secs
lola: 38622395 markings, 111781070 edges, 113898 markings/sec, 305 secs
lola: 39186708 markings, 113431253 edges, 112863 markings/sec, 310 secs
lola: 39740941 markings, 115069161 edges, 110847 markings/sec, 315 secs
lola: 40295910 markings, 116729709 edges, 110994 markings/sec, 320 secs
lola: 40849667 markings, 118414809 edges, 110751 markings/sec, 325 secs
lola: 41424424 markings, 120126709 edges, 114951 markings/sec, 330 secs
lola: 41972260 markings, 121809610 edges, 109567 markings/sec, 335 secs
lola: 42528828 markings, 123437454 edges, 111314 markings/sec, 340 secs
lola: 43068801 markings, 125075932 edges, 107995 markings/sec, 345 secs
lola: 43608414 markings, 126709779 edges, 107923 markings/sec, 350 secs
lola: 44138902 markings, 128334486 edges, 106098 markings/sec, 355 secs
lola: 44695921 markings, 130024969 edges, 111404 markings/sec, 360 secs
lola: 45216813 markings, 131585354 edges, 104178 markings/sec, 365 secs
lola: 45737568 markings, 133186515 edges, 104151 markings/sec, 370 secs
lola: 46281210 markings, 134815078 edges, 108728 markings/sec, 375 secs
lola: 46805810 markings, 136473844 edges, 104920 markings/sec, 380 secs
lola: 47330344 markings, 138100786 edges, 104907 markings/sec, 385 secs
lola: 47849522 markings, 139683799 edges, 103836 markings/sec, 390 secs
lola: 48362258 markings, 141293355 edges, 102547 markings/sec, 395 secs
lola: 48885499 markings, 142929313 edges, 104648 markings/sec, 400 secs
lola: 49398659 markings, 144532455 edges, 102632 markings/sec, 405 secs
lola: 49937578 markings, 146172099 edges, 107784 markings/sec, 410 secs
lola: 50437506 markings, 147734410 edges, 99986 markings/sec, 415 secs
lola: 50981831 markings, 149375359 edges, 108865 markings/sec, 420 secs
lola: 51500489 markings, 150987613 edges, 103732 markings/sec, 425 secs
lola: 52020352 markings, 152642947 edges, 103973 markings/sec, 430 secs
lola: 52537928 markings, 154276686 edges, 103515 markings/sec, 435 secs
lola: 53040094 markings, 155869940 edges, 100433 markings/sec, 440 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no no yes unknown no yes yes unknown unknown unknown yes unknown yes unknown unknown
lola: memory consumption: 5044180 KB
lola: time consumption: 447 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (A (G (FIREABLE(t103)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U NOT(E(TRUE U NOT FIREABLE(t103)))))))
lola: processed formula length: 63
lola: 25 rewrites
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 634588 markings, 2257041 edges, 126918 markings/sec, 0 secs
lola: 1281387 markings, 4590096 edges, 129360 markings/sec, 5 secs
lola: 1902997 markings, 6848448 edges, 124322 markings/sec, 10 secs
lola: 2527729 markings, 9143389 edges, 124946 markings/sec, 15 secs
lola: 3139845 markings, 11375647 edges, 122423 markings/sec, 20 secs
lola: 3700443 markings, 13536835 edges, 112120 markings/sec, 25 secs
lola: 4253378 markings, 15689081 edges, 110587 markings/sec, 30 secs
lola: 4800820 markings, 17795785 edges, 109488 markings/sec, 35 secs
lola: 5356817 markings, 19890506 edges, 111199 markings/sec, 40 secs
lola: 5916729 markings, 21958953 edges, 111982 markings/sec, 45 secs
lola: 6444121 markings, 23999808 edges, 105478 markings/sec, 50 secs
lola: 7011613 markings, 26081330 edges, 113498 markings/sec, 55 secs
lola: 7566107 markings, 28191277 edges, 110899 markings/sec, 60 secs
lola: 8093055 markings, 30188254 edges, 105390 markings/sec, 65 secs
lola: 8609626 markings, 32177756 edges, 103314 markings/sec, 70 secs
lola: 9163932 markings, 34243398 edges, 110861 markings/sec, 75 secs
lola: 9657339 markings, 36219456 edges, 98681 markings/sec, 80 secs
lola: 10182219 markings, 38218625 edges, 104976 markings/sec, 85 secs
lola: 10690197 markings, 40200182 edges, 101596 markings/sec, 90 secs
lola: 11179997 markings, 42081964 edges, 97960 markings/sec, 95 secs
lola: 11707307 markings, 44077542 edges, 105462 markings/sec, 100 secs
lola: 12209033 markings, 46040050 edges, 100345 markings/sec, 105 secs
lola: 12698081 markings, 47957462 edges, 97810 markings/sec, 110 secs
lola: 13184947 markings, 49809769 edges, 97373 markings/sec, 115 secs
lola: 13722755 markings, 51830204 edges, 107562 markings/sec, 120 secs
lola: 14231252 markings, 53741912 edges, 101699 markings/sec, 125 secs
lola: 14714197 markings, 55659512 edges, 96589 markings/sec, 130 secs
lola: 15195779 markings, 57544728 edges, 96316 markings/sec, 135 secs
lola: 15663038 markings, 59368584 edges, 93452 markings/sec, 140 secs
lola: 16161410 markings, 61337853 edges, 99674 markings/sec, 145 secs
lola: 16670290 markings, 63261678 edges, 101776 markings/sec, 150 secs
lola: 17131674 markings, 65076798 edges, 92277 markings/sec, 155 secs
lola: 17659306 markings, 67065777 edges, 105526 markings/sec, 160 secs
lola: 18154048 markings, 69006547 edges, 98948 markings/sec, 165 secs
lola: 18637498 markings, 70920188 edges, 96690 markings/sec, 170 secs
lola: 19135232 markings, 72859225 edges, 99547 markings/sec, 175 secs
lola: 19631300 markings, 74777714 edges, 99214 markings/sec, 180 secs
lola: 20119617 markings, 76684488 edges, 97663 markings/sec, 185 secs
lola: 20632481 markings, 78662238 edges, 102573 markings/sec, 190 secs
lola: 21153256 markings, 80581654 edges, 104155 markings/sec, 195 secs
lola: 21652634 markings, 82502436 edges, 99876 markings/sec, 200 secs
lola: 22147771 markings, 84402643 edges, 99027 markings/sec, 205 secs
lola: 22636332 markings, 86245382 edges, 97712 markings/sec, 210 secs
lola: 23149060 markings, 88171619 edges, 102546 markings/sec, 215 secs
lola: 23657802 markings, 90096415 edges, 101748 markings/sec, 220 secs
lola: 24146804 markings, 91980004 edges, 97800 markings/sec, 225 secs
lola: 24656382 markings, 93907683 edges, 101916 markings/sec, 230 secs
lola: 25147684 markings, 95806705 edges, 98260 markings/sec, 235 secs
lola: 25637338 markings, 97678005 edges, 97931 markings/sec, 240 secs
lola: 26101114 markings, 99471917 edges, 92755 markings/sec, 245 secs
lola: 26581217 markings, 101352144 edges, 96021 markings/sec, 250 secs
lola: 27068059 markings, 103213387 edges, 97368 markings/sec, 255 secs
lola: 27546667 markings, 105100880 edges, 95722 markings/sec, 260 secs
lola: 28017053 markings, 106927688 edges, 94077 markings/sec, 265 secs
lola: 28486794 markings, 108775046 edges, 93948 markings/sec, 270 secs
lola: 28940241 markings, 110585529 edges, 90689 markings/sec, 275 secs
lola: 29410696 markings, 112425223 edges, 94091 markings/sec, 280 secs
lola: 29882490 markings, 114229644 edges, 94359 markings/sec, 285 secs
lola: 30346664 markings, 116056283 edges, 92835 markings/sec, 290 secs
lola: 30802526 markings, 117835600 edges, 91172 markings/sec, 295 secs
lola: 31251757 markings, 119625973 edges, 89846 markings/sec, 300 secs
lola: 31708133 markings, 121394271 edges, 91275 markings/sec, 305 secs
lola: 32161683 markings, 123241406 edges, 90710 markings/sec, 310 secs
lola: 32635249 markings, 125063449 edges, 94713 markings/sec, 315 secs
lola: 33100126 markings, 126907291 edges, 92975 markings/sec, 320 secs
lola: 33565938 markings, 128760392 edges, 93162 markings/sec, 325 secs
lola: 34042199 markings, 130621058 edges, 95252 markings/sec, 330 secs
lola: 34473891 markings, 132381182 edges, 86338 markings/sec, 335 secs
lola: 34932496 markings, 134225986 edges, 91721 markings/sec, 340 secs
lola: 35387714 markings, 135998674 edges, 91044 markings/sec, 345 secs
lola: 35817270 markings, 137749861 edges, 85911 markings/sec, 350 secs
lola: 36269231 markings, 139558920 edges, 90392 markings/sec, 355 secs
lola: 36740542 markings, 141423832 edges, 94262 markings/sec, 360 secs
lola: 37177836 markings, 143253527 edges, 87459 markings/sec, 365 secs
lola: 37627171 markings, 145050817 edges, 89867 markings/sec, 370 secs
lola: 38045225 markings, 146838487 edges, 83611 markings/sec, 375 secs
lola: 38498345 markings, 148673583 edges, 90624 markings/sec, 380 secs
lola: 38944349 markings, 150524840 edges, 89201 markings/sec, 385 secs
lola: 39355751 markings, 152232144 edges, 82280 markings/sec, 390 secs
lola: 39773310 markings, 154049091 edges, 83512 markings/sec, 395 secs
lola: 40186536 markings, 155753820 edges, 82645 markings/sec, 400 secs
lola: 40619688 markings, 157501178 edges, 86630 markings/sec, 405 secs
lola: 41076531 markings, 159322720 edges, 91369 markings/sec, 410 secs
lola: 41540931 markings, 161178404 edges, 92880 markings/sec, 415 secs
lola: 41993040 markings, 162973833 edges, 90422 markings/sec, 420 secs
lola: 42445599 markings, 164769689 edges, 90512 markings/sec, 425 secs
lola: 42877154 markings, 166517689 edges, 86311 markings/sec, 430 secs
lola: 43315236 markings, 168296276 edges, 87616 markings/sec, 435 secs
lola: 43743264 markings, 170073213 edges, 85606 markings/sec, 440 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown no no yes unknown no yes yes unknown unknown unknown yes unknown yes unknown unknown
lola: memory consumption: 4095896 KB
lola: time consumption: 893 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t282) AND E (F (FIREABLE(t266))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t282)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t282)
lola: processed formula length: 18
lola: 21 rewrites
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.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: ========================================
lola: subprocess 11 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t266)))
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(t266)))
lola: processed formula length: 22
lola: 22 rewrites
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.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(t266)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04b-CTLFireability-11-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: 36 markings, 35 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
========================================
lola: ========================================

FORMULA FlexibleBarrier-PT-04b-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t70) OR E (F ((FIREABLE(t148) AND FIREABLE(t230)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 535 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t70)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t70)
lola: processed formula length: 13
lola: 21 rewrites
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 669 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t148) AND FIREABLE(t230))))
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(t148) AND FIREABLE(t230))))
lola: processed formula length: 43
lola: 22 rewrites
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.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: 24 markings, 23 edges
lola: formula 0: (FIREABLE(t148) AND FIREABLE(t230))
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA FlexibleBarrier-PT-04b-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04b-CTLFireability-12-0.sara
lola: subprocess 12 will run for 669 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (FIREABLE(t271))) OR E (F (FIREABLE(t173))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: lola: ========================================
subprocess 12 will run for 669 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t173)))
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(t173)))
lola: processed formula length: 22
lola: 22 rewrites
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.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(t173)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04b-CTLFireability-12-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: 30 markings, 29 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA FlexibleBarrier-PT-04b-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (FIREABLE(t173))) OR E ((NOT FIREABLE(t124) U FIREABLE(t191))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(t173)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (FIREABLE(t173)))
lola: processed formula length: 22
lola: 21 rewrites
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(t124) U FIREABLE(t191)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((NOT FIREABLE(t124) U FIREABLE(t191)))
lola: processed formula length: 41
lola: 24 rewrites
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: FIREABLE(t191)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04b-CTLFireability-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-04b-CTLFireability-14-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 41508 markings, 109967 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA FlexibleBarrier-PT-04b-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (((NOT FIREABLE(t30) AND NOT FIREABLE(t17)) AND A (G (FIREABLE(t143)))))) OR A (G (NOT FIREABLE(t210))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1338 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t210)))
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(t210)))
lola: processed formula length: 26
lola: 23 rewrites
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.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(t210)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-04b-CTLFireability-14-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: 24 markings, 23 edges
lola: ========================================
lola: subprocess 15 will run for 2676 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((NOT FIREABLE(t30) AND NOT FIREABLE(t17)) AND A (G (FIREABLE(t143))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U ((NOT FIREABLE(t30) AND NOT FIREABLE(t17)) AND NOT(E(TRUE U NOT FIREABLE(t143)))))
lola: processed formula length: 91
lola: 24 rewrites
lola: closed formula file FlexibleBarrier-PT-04b-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 20 markings, 40 edges
lola: lola: SUBRESULT
lola: result: no
========================================lola:
The Boolean predicate is false.
lola: ========================================

FORMULA FlexibleBarrier-PT-04b-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2676 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((FIREABLE(t196) AND FIREABLE(t133)))) OR (((FIREABLE(t283) OR FIREABLE(t211)) OR A ((FIREABLE(t195) U FIREABLE(t70)))) AND E (F ((FIREABLE(t43) AND FIREABLE(t210) AND FIREABLE(t278))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola: lola:
preliminary result: unknown no no yes yes no yes yes unknown yes unknown yes no yes yes yes
caught signal User defined signal 1 - aborting LoLA
lola: time limit reached - aborting
lola:
preliminary result: unknown no no yes yes no yes yes unknown yes unknown yes no yes yes yes
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: unknown no no yes yes no yes yes unknown yes unknown yes no yes yes yes
lola:
preliminary result: unknown no no yes yes no yes yes unknown yes unknown yes no yes yes yes
lola:
preliminary result: unknown no no yes yes no yes yes unknown yes unknown yes no yes yes yes

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

Segmentation fault

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