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 316K
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K 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 9.3K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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
-rw-r--r-- 1 mcc users 93K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SafeBus-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685547200228
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527026249564

info: Time: 3600 - MCC
===========================================================================================
prep: translating SafeBus-PT-03 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SafeBus-PT-03 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ SafeBus-PT-03 @ 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: 148/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1824
lola: finding significant places
lola: 57 places, 91 transitions, 37 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 108 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-PT-03-CTLFireability.task
lola: E (F (A (G ((FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREABLE(C_provide_3_2_2) OR FIREABLE(C_provide_1_3_3) OR FIREABLE(C_provide_2_3_3) OR FIREABLE(C_provide_3_3_3) OR FIREABLE(loss_a) OR FIREABLE(C_refuse_1_1_1_1) OR FIREABLE(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1) OR FIREABLE(C_refuse_1_2_1_1) OR FIREABLE(C_refuse_2_2_1_1) OR FIREABLE(C_refuse_3_2_1_1) OR FIREABLE(C_refuse_1_3_1_1) OR FIREABLE(C_refuse_2_3_1_1) OR FIREABLE(C_refuse_3_3_1_1) OR FIREABLE(C_refuse_1_1_2_2) OR FIREABLE(C_refuse_2_1_2_2) OR FIREABLE(C_refuse_3_1_2_2) OR FIREABLE(C_refuse_1_2_2_2) OR FIREABLE(C_refuse_2_2_2_2) OR FIREABLE(C_refuse_3_2_2_2) OR FIREABLE(C_refuse_1_3_2_2) OR FIREABLE(C_refuse_2_3_2_2) OR FIREABLE(C_refuse_3_3_2_2) OR FIREABLE(C_refuse_1_1_3_3) OR FIREABLE(C_refuse_2_1_3_3) OR FIREABLE(C_refuse_3_1_3_3) OR FIREABLE(C_refuse_1_2_3_3) OR FIREABLE(C_refuse_2_2_3_3) OR FIREABLE(C_refuse_3_2_3_3) OR FIREABLE(C_refuse_1_3_3_3) OR FIREABLE(C_refuse_2_3_3_3) OR FIREABLE(C_refuse_3_3_3_3)))))) : E (G (E (F ((FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3) OR FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3) OR FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3) OR FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)))))) : E (G (NOT(((FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3)) OR E (G ((FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3)))))))) : E ((NOT(E (G (FIREABLE(loss_a)))) U ((FIREABLE(I_reemit_2_1) OR FIREABLE(I_reemit_3_1) OR FIREABLE(I_reemit_1_2) OR FIREABLE(I_reemit_3_2) OR FIREABLE(I_reemit_1_3) OR FIREABLE(I_reemit_2_3)) AND (FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3)) AND (FIREABLE(I_reemit_2_1) OR FIREABLE(I_reemit_3_1) OR FIREABLE(I_reemit_1_2) OR FIREABLE(I_reemit_3_2) OR FIREABLE(I_reemit_1_3) OR FIREABLE(I_reemit_2_3) OR FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREABLE(C_provide_3_2_2) OR FIREABLE(C_provide_1_3_3) OR FIREABLE(C_provide_2_3_3) OR FIREABLE(C_provide_3_3_3)) AND (FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3))))) : ((A (G (A (G ((FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3)))))) AND A (G ((NOT FIREABLE(Gto_1) AND NOT FIREABLE(Gto_2) AND NOT FIREABLE(Gto_3) AND (FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3) OR FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3)))))) OR A (F (((NOT FIREABLE(C_free_1_1) AND NOT FIREABLE(C_free_2_2) AND NOT FIREABLE(C_free_3_3) AND NOT FIREABLE(I_refused_1_1) AND NOT FIREABLE(I_refused_2_2) AND NOT FIREABLE(I_refused_3_3)) AND E (G ((FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)))))))) : E (X (NOT(NOT(E (G ((FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3)))))))) : A (F (A (X ((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3)))))) : ((E (G (E (G (FIREABLE(loss_a))))) AND NOT(A (((FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3)) U (FIREABLE(I_emit_2_2_1) OR FIREABLE(I_emit_3_3_1) OR FIREABLE(I_emit_1_1_2) OR FIREABLE(I_emit_3_3_2) OR FIREABLE(I_emit_1_1_3) OR FIREABLE(I_emit_2_2_3)))))) OR NOT(A (F ((FIREABLE(I_reemit_2_1) OR FIREABLE(I_reemit_3_1) OR FIREABLE(I_reemit_1_2) OR FIREABLE(I_reemit_3_2) OR FIREABLE(I_reemit_1_3) OR FIREABLE(I_reemit_2_3)))))) : NOT(E (F (A (X ((FIREABLE(I_emit_2_2_3) AND FIREABLE(C_refuse_3_1_1_1))))))) : (FIREABLE(C_refuse_3_2_1_1) OR E ((A (G (FIREABLE(I_ask2_1_1))) U A (F (FIREABLE(I_ask2_1_2)))))) : (A (F (A (F ((FIREABLE(I_ask1_1_3) AND FIREABLE(C_refuse_2_2_3_3)))))) OR FIREABLE(C_refuse_2_1_2_2)) : E ((((NOT FIREABLE(I_ask2_2_2) AND NOT FIREABLE(I_reemit_1_2)) OR A (F (FIREABLE(C_provide_1_2_2)))) U (A (X (FIREABLE(I_reemit_1_2))) AND (NOT FIREABLE(C_provide_2_3_3) OR (FIREABLE(loss_m_2) AND FIREABLE(I_ask2_3_1)))))) : (E (G (A (F ((FIREABLE(I_ask1_3_1) OR FIREABLE(I_reemit_3_1)))))) AND NOT(E (((FIREABLE(C_refuse_1_2_1_1) AND FIREABLE(loss_m_3)) U (FIREABLE(I_ask2_3_2) OR FIREABLE(I_emit_1_1_3)))))) : E (F ((A (X (FIREABLE(I_ask1_2_2))) AND NOT(A (X (FIREABLE(C_refuse_3_3_2_2))))))) : NOT(A (F ((NOT FIREABLE(C_provide_2_3_3) AND NOT FIREABLE(C_refuse_3_3_1_1) AND ((FIREABLE(I_rec2_3_3) AND FIREABLE(I_refused_3_3)) OR (FIREABLE(I_reemit_3_1) AND FIREABLE(C_provide_2_2_2))))))) : E (((NOT FIREABLE(I_rec2_3_3) AND NOT FIREABLE(Gto_1) AND (NOT FIREABLE(I_ask2_3_3) OR NOT FIREABLE(I_ask2_3_2))) U (E (G (FIREABLE(C_provide_3_1_1))) AND A (F (FIREABLE(I_ask1_3_3))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:392
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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: E (X (E (G ((FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:627
lola: processed formula: (FIREABLE(I_ask1_1_1) OR FIREABLE(I_ask1_2_1) OR FIREABLE(I_ask1_3_1) OR FIREABLE(I_ask1_1_2) OR FIREABLE(I_ask1_2_2) OR FIREABLE(I_ask1_3_2) OR FIREABLE(I_ask1_1_3) OR FIREABLE(I_ask1_2_3) OR FIREABLE(I_ask1_3_3))
lola: processed formula length: 222
lola: 40 rewrites
lola: closed formula file SafeBus-PT-03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate is possibly preserved from some successor.
lola: 32 markings, 32 edges
lola: ========================================

FORMULA SafeBus-PT-03-CTLFireability-5 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 (F (A (X ((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U AX((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3))))
lola: processed formula length: 80
lola: 41 rewrites
lola: closed formula file SafeBus-PT-03-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: 37 markings, 37 edges
lola: ========================================

FORMULA SafeBus-PT-03-CTLFireability-6 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: A (G (E (X ((NOT FIREABLE(I_emit_2_2_3) OR NOT FIREABLE(C_refuse_3_1_1_1))))))
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(I_emit_2_2_3) OR NOT FIREABLE(C_refuse_3_1_1_1))))))
lola: processed formula length: 87
lola: 41 rewrites
lola: closed formula file SafeBus-PT-03-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4650 markings, 12888 edges
lola: ========================================

FORMULA SafeBus-PT-03-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((NOT FIREABLE(I_ask2_2_2) AND NOT FIREABLE(I_reemit_1_2)) OR A (F (FIREABLE(C_provide_1_2_2)))) U (A (X (FIREABLE(I_reemit_1_2))) AND (NOT FIREABLE(C_provide_2_3_3) OR (FIREABLE(loss_m_2) AND FIREABLE(I_ask2_3_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(((NOT FIREABLE(I_ask2_2_2) AND NOT FIREABLE(I_reemit_1_2)) OR A(TRUE U FIREABLE(C_provide_1_2_2))) U (AX(FIREABLE(I_reemit_1_2)) AND (NOT FIREABLE(C_provide_2_3_3) OR (FIREABLE(loss_m_2) AND FIREABLE(I_ask2_3_1)))))
lola: processed formula length: 218
lola: 42 rewrites
lola: closed formula file SafeBus-PT-03-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: 4489 markings, 12435 edges
lola: ========================================

FORMULA SafeBus-PT-03-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X (FIREABLE(I_ask1_2_2))) AND E (X (NOT FIREABLE(C_refuse_3_3_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (AX(FIREABLE(I_ask1_2_2)) AND EX(NOT FIREABLE(C_refuse_3_3_2_2))))
lola: processed formula length: 75
lola: 42 rewrites
lola: closed formula file SafeBus-PT-03-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1808 markings, 3040 edges
lola: ========================================

FORMULA SafeBus-PT-03-CTLFireability-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 (G ((FIREABLE(C_provide_2_3_3) OR FIREABLE(C_refuse_3_3_1_1) OR ((NOT FIREABLE(I_rec2_3_3) OR NOT FIREABLE(I_refused_3_3)) AND (NOT FIREABLE(I_reemit_3_1) OR NOT FIREABLE(C_provide_2_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((FIREABLE(C_provide_2_3_3) OR FIREABLE(C_refuse_3_3_1_1) OR ((NOT FIREABLE(I_rec2_3_3) OR NOT FIREABLE(I_refused_3_3)) AND (NOT FIREABLE(I_reemit_3_1) OR NOT FIREABLE(C_provide_2_2_2))))))
lola: processed formula length: 198
lola: 39 rewrites
lola: closed formula file SafeBus-PT-03-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: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 37 markings, 37 edges
lola: ========================================

FORMULA SafeBus-PT-03-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((FIREABLE(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_1_2_2) OR FIREABLE(C_provide_2_2_2) OR FIREABLE(C_provide_3_2_2) OR FIREABLE(C_provide_1_3_3) OR FIREABLE(C_provide_2_3_3) OR FIREABLE(C_provide_3_3_3) OR FIREABLE(loss_a) OR FIREABLE(C_refuse_1_1_1_1) OR FIREABLE(C_refuse_2_1_1_1) OR FIREABLE(C_refuse_3_1_1_1) OR FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (NOT FIREABLE(C_provide_1_1_1) AND NOT FIREABLE(C_provide_2_1_1) AND NOT FIREABLE(C_provide_3_1_1) AND NOT FIREABLE(C_provide_1_2_2) AND NOT FIREABLE(C_provide_2_2_2) AND NOT FIREABLE(C_provide_3_2_2) AND NOT FIREABLE(C_provide_1_3_3) AND NOT FIREABLE(C_provide_2_3_3) AND NOT FIREABLE(C_provide_3_3_3) AND NOT FIREABLE(loss_a) AND NOT FIREABLE(C_refuse_1_1_1_1) AND NOT FIREABLE(C_refuse_2_1_1_1) AN... (shortened)
lola: processed formula length: 1273
lola: 41 rewrites
lola: closed formula file SafeBus-PT-03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not possibly invariant.
lola: 4560 markings, 12354 edges
lola: ========================================

FORMULA SafeBus-PT-03-CTLFireability-0 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)
lola: ========================================
lola: ...considering subproblem: E (G (((NOT FIREABLE(I_rec2_1_1) AND NOT FIREABLE(I_rec2_2_2) AND NOT FIREABLE(I_rec2_3_3)) AND A (F ((NOT FIREABLE(I_rec1_1_1) AND NOT FIREABLE(I_rec1_2_2) AND NOT FIREABLE(I_rec1_3_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: NOT(A(TRUE U ((FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3)) OR NOT(A(TRUE U (NOT FIREABLE(I_rec1_1_1) AND NOT FIREABLE(I_rec1_2_2) AND NOT FIREABLE(I_rec1_3_3)))))))
lola: processed formula length: 192
lola: 43 rewrites
lola: closed formula file SafeBus-PT-03-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 263 markings, 641 edges
lola: ========================================

FORMULA SafeBus-PT-03-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((A (F (NOT FIREABLE(loss_a))) U ((FIREABLE(I_reemit_2_1) OR FIREABLE(I_reemit_3_1) OR FIREABLE(I_reemit_1_2) OR FIREABLE(I_reemit_3_2) OR FIREABLE(I_reemit_1_3) OR FIREABLE(I_reemit_2_3)) AND (FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3)) AND (FIREABLE(I_reemit_2_1) OR FIREABLE(I_reemit_3_1) OR FIREABLE(I_reemit_1_2) OR FIREABLE(I_reemit_3_2) OR FIREABLE(I_ree... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E(A(TRUE U NOT FIREABLE(loss_a)) U ((FIREABLE(I_reemit_2_1) OR FIREABLE(I_reemit_3_1) OR FIREABLE(I_reemit_1_2) OR FIREABLE(I_reemit_3_2) OR FIREABLE(I_reemit_1_3) OR FIREABLE(I_reemit_2_3)) AND (FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3)) AND (FIREABLE(I_reemit_2_1) OR FIREABLE(I_reemit_3_1) OR FIREABLE(I_reemit_1_2) OR FIREABLE(I_reemit_3_2) OR FIREABLE(I_ree... (shortened)
lola: processed formula length: 779
lola: 41 rewrites
lola: closed formula file SafeBus-PT-03-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: 4650 markings, 19194 edges
lola: ========================================

FORMULA SafeBus-PT-03-CTLFireability-3 FALSE 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: (FIREABLE(C_refuse_3_2_1_1) OR E ((A (G (FIREABLE(I_ask2_1_1))) U A (F (FIREABLE(I_ask2_1_2))))))
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:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: (FIREABLE(C_refuse_3_2_1_1) OR E(NOT(E(TRUE U NOT FIREABLE(I_ask2_1_1))) U A(TRUE U FIREABLE(I_ask2_1_2))))
lola: processed formula length: 107
lola: 43 rewrites
lola: closed formula file SafeBus-PT-03-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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 37 markings, 39 edges

FORMULA SafeBus-PT-03-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(I_rec2_3_3) AND NOT FIREABLE(Gto_1) AND (NOT FIREABLE(I_ask2_3_3) OR NOT FIREABLE(I_ask2_3_2))) U (E (G (FIREABLE(C_provide_3_1_1))) AND A (F (FIREABLE(I_ask1_3_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E((NOT FIREABLE(I_rec2_3_3) AND NOT FIREABLE(Gto_1) AND (NOT FIREABLE(I_ask2_3_3) OR NOT FIREABLE(I_ask2_3_2))) U (NOT(A(TRUE U NOT FIREABLE(C_provide_3_1_1))) AND A(TRUE U FIREABLE(I_ask1_3_3))))
lola: processed formula length: 197
lola: 43 rewrites
lola: closed formula file SafeBus-PT-03-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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 3924 markings, 14356 edges
lola:
FORMULA SafeBus-PT-03-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((FIREABLE(I_ask1_1_3) AND FIREABLE(C_refuse_2_2_3_3)))) OR FIREABLE(C_refuse_2_1_2_2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(C_refuse_2_1_2_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(C_refuse_2_1_2_2)
lola: processed formula length: 26
lola: 39 rewrites
lola: closed formula file SafeBus-PT-03-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 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(I_ask1_1_3) AND FIREABLE(C_refuse_2_2_3_3))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (NOT FIREABLE(I_ask1_1_3) OR NOT FIREABLE(C_refuse_2_2_3_3))
lola: processed formula length: 61
lola: 41 rewrites
lola: closed formula file SafeBus-PT-03-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 does not eventually occur.
lola: 46 markings, 46 edges
lola: lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
========================================
lola: ========================================

FORMULA SafeBus-PT-03-CTLFireability-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: E (G (E (F ((FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3) OR FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3) OR FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3) OR FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3) OR FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3) OR FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3) OR FIREABLE(I_free... (shortened)
lola: processed formula length: 531
lola: 40 rewrites
lola: closed formula file SafeBus-PT-03-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 37 markings, 37 edges
lola: ========================================

FORMULA SafeBus-PT-03-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A (F ((FIREABLE(I_ask1_3_1) OR FIREABLE(I_reemit_3_1)))))) AND A (((NOT FIREABLE(C_refuse_1_2_1_1) OR NOT FIREABLE(loss_m_3)) R (NOT FIREABLE(I_ask2_3_2) AND NOT FIREABLE(I_emit_1_1_3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((NOT FIREABLE(C_refuse_1_2_1_1) OR NOT FIREABLE(loss_m_3)) R (NOT FIREABLE(I_ask2_3_2) AND NOT FIREABLE(I_emit_1_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:647
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (((NOT FIREABLE(C_refuse_1_2_1_1) OR NOT FIREABLE(loss_m_3)) R (NOT FIREABLE(I_ask2_3_2) AND NOT FIREABLE(I_emit_1_1_3))))
lola: processed formula length: 125
lola: 45 rewrites
lola: closed formula file SafeBus-PT-03-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(I_ask2_3_2) OR FIREABLE(I_emit_1_1_3))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-PT-03-CTLFireability-13-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: lola: ========================================
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((FIREABLE(I_ask1_3_1) OR FIREABLE(I_reemit_3_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: state equation: calling and running sara
processed formula: NOT(A(TRUE U NOT(A(TRUE U (FIREABLE(I_ask1_3_1) OR FIREABLE(I_reemit_3_1))))))
lola: processed formula length: 79
lola: 41 rewrites
lola: closed formula file SafeBus-PT-03-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: 99 markings, 105 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SafeBus-PT-03-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (G (FIREABLE(loss_a))) AND E (((NOT FIREABLE(Gto_1) AND NOT FIREABLE(Gto_2) AND NOT FIREABLE(Gto_3)) R (NOT FIREABLE(I_emit_2_2_1) AND NOT FIREABLE(I_emit_3_3_1) AND NOT FIREABLE(I_emit_1_1_2) AND NOT FIREABLE(I_emit_3_3_2) AND NOT FIREABLE(I_emit_1_1_3) AND NOT FIREABLE(I_emit_2_2_3))))) OR E (G ((NOT FIREABLE(I_reemit_2_1) AND NOT FIREABLE(I_reemit_3_1) AND NOT FIREABLE(I_reemit_1_2) AND NOT... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(loss_a)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (FIREABLE(loss_a)))
lola: processed formula length: 24
lola: 39 rewrites
lola: closed formula file SafeBus-PT-03-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: sara: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
try reading problem file SafeBus-PT-03-CTLFireability-13-0.sara.
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(I_reemit_2_1) AND NOT FIREABLE(I_reemit_3_1) AND NOT FIREABLE(I_reemit_1_2) AND NOT FIREABLE(I_reemit_3_2) AND NOT FIREABLE(I_reemit_1_3) AND NOT FIREABLE(I_reemit_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((NOT FIREABLE(I_reemit_2_1) AND NOT FIREABLE(I_reemit_3_1) AND NOT FIREABLE(I_reemit_1_2) AND NOT FIREABLE(I_reemit_3_2) AND NOT FIREABLE(I_reemit_1_3) AND NOT FIREABLE(I_reemit_2_3))))
lola: processed formula length: 191
lola: 39 rewrites
lola: closed formula file SafeBus-PT-03-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: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 34 markings, 34 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA SafeBus-PT-03-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (G ((FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3)))) AND A (G ((NOT FIREABLE(Gto_1) AND NOT FIREABLE(Gto_2) AND NOT FIREABLE(Gto_3) AND (FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3) OR FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3)))))) OR A (F (((NOT FIREABLE(C_free_1_1) AND NOT FIREABLE(C_free_2_2) AND NOT FIREAB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3))))
lola: processed formula length: 89
lola: 41 rewrites
lola: closed formula file SafeBus-PT-03-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(I_refused_1_1) AND NOT FIREABLE(I_refused_2_2) AND NOT FIREABLE(I_refused_3_3))
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-PT-03-CTLFireability-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((A (G ((FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3)))) AND A (G ((NOT FIREABLE(Gto_1) AND NOT FIREABLE(Gto_2) AND NOT FIREABLE(Gto_3) AND (FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3) OR FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3)))))) OR A (F (((NOT FIREABLE(C_free_1_1) AND NOT FIREABLE(C_free_2_2) AND NOT FIREAB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3))))
lola: processed formula length: 89
lola: 41 rewrites
lola: closed formula file SafeBus-PT-03-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(I_refused_1_1) AND NOT FIREABLE(I_refused_2_2) AND NOT FIREABLE(I_refused_3_3))
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-PT-03-CTLFireability-16-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (((NOT FIREABLE(C_free_1_1) AND NOT FIREABLE(C_free_2_2) AND NOT FIREABLE(C_free_3_3) AND NOT FIREABLE(I_refused_1_1) AND NOT FIREABLE(I_refused_2_2) AND NOT FIREABLE(I_refused_3_3)) AND E (G ((FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U ((NOT FIREABLE(C_free_1_1) AND NOT FIREABLE(C_free_2_2) AND NOT FIREABLE(C_free_3_3) AND NOT FIREABLE(I_refused_1_1) AND NOT FIREABLE(I_refused_2_2) AND NOT FIREABLE(I_refused_3_3)) AND NOT(A(TRUE U (NOT FIREABLE(I_free_2_1) AND NOT FIREABLE(I_free_3_1) AND NOT FIREABLE(I_free_1_2) AND NOT FIREABLE(I_free_3_2) AND NOT FIREABLE(I_free_1_3) AND NOT FIREABLE(I_free_2_3))))))
lola: processed formula length: 383
lola: 42 rewrites
lola: closed formula file SafeBus-PT-03-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: 55 markings, 87 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
sara: place or transition ordering is non-deterministic
lola: ========================================

FORMULA SafeBus-PT-03-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no no yes no yes yes no no no no yes yes no
lola:
preliminary result: no yes yes no no yes no yes yes no no no no yes yes no
lola: memory consumption: 14744 KB
lola: time consumption: 1 seconds


BK_STOP 1527026250163

--------------------
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="SafeBus-PT-03"
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/SafeBus-PT-03.tgz
mv SafeBus-PT-03 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 SafeBus-PT-03, 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 r148-smll-152685547200228"
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 ;