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 804K
-rw-r--r-- 1 mcc users 6.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K 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 3.3K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 32K 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 22K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.7K 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 448K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SafeBus-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732257900532
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528134297864

info: Time: 3600 - MCC
===========================================================================================
prep: translating SafeBus-PT-06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SafeBus-PT-06 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ SafeBus-PT-06 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 595/65536 symbol table entries, 15 collisions
lola: preprocessing...
lola: Size of bit vector: 4608
lola: finding significant places
lola: 144 places, 451 transitions, 109 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 375 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-PT-06-LTLFireability.task
lola: A (X (F (((FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3) OR FIREABLE(I_refused_4_4) OR FIREABLE(I_refused_5_5) OR FIREABLE(I_refused_6_6)) U (FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3) OR FIREABLE(C_free_4_4) OR FIREABLE(C_free_5_5) OR FIREABLE(C_free_6_6)))))) : A (G ((F (F ((FIREABLE(I_rec2_1_1) OR FIREABLE(I_rec2_2_2) OR FIREABLE(I_rec2_3_3) OR FIREABLE(I_rec2_4_4) OR FIREABLE(I_rec2_5_5) OR FIREABLE(I_rec2_6_6)))) U G (X ((FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_4_1) OR FIREABLE(I_free_5_1) OR FIREABLE(I_free_6_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_4_2) OR FIREABLE(I_free_5_2) OR FIREABLE(I_free_6_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3) OR FIREABLE(I_free_4_3) OR FIREABLE(I_free_5_3) OR FIREABLE(I_free_6_3) OR FIREABLE(I_free_1_4) OR FIREABLE(I_free_2_4) OR FIREABLE(I_free_3_4) OR FIREABLE(I_free_5_4) OR FIREABLE(I_free_6_4) OR FIREABLE(I_free_1_5) OR FIREABLE(I_free_2_5) OR FIREABLE(I_free_3_5) OR FIREABLE(I_free_4_5) OR FIREABLE(I_free_6_5) OR FIREABLE(I_free_1_6) OR FIREABLE(I_free_2_6) OR FIREABLE(I_free_3_6) OR FIREABLE(I_free_4_6) OR FIREABLE(I_free_5_6))))))) : A ((X ((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3) OR FIREABLE(loss_m_4) OR FIREABLE(loss_m_5) OR FIREABLE(loss_m_6))) U G (F ((FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3) OR FIREABLE(Gto_4) OR FIREABLE(Gto_5) OR FIREABLE(Gto_6)))))) : A ((X ((FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3) OR FIREABLE(I_rec1_4_4) OR FIREABLE(I_rec1_5_5) OR FIREABLE(I_rec1_6_6))) U (FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_4_1) OR FIREABLE(I_ask2_5_1) OR FIREABLE(I_ask2_6_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_4_2) OR FIREABLE(I_ask2_5_2) OR FIREABLE(I_ask2_6_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3) OR FIREABLE(I_ask2_4_3) OR FIREABLE(I_ask2_5_3) OR FIREABLE(I_ask2_6_3) OR FIREABLE(I_ask2_1_4) OR FIREABLE(I_ask2_2_4) OR FIREABLE(I_ask2_3_4) OR FIREABLE(I_ask2_4_4) OR FIREABLE(I_ask2_5_4) OR FIREABLE(I_ask2_6_4) OR FIREABLE(I_ask2_1_5) OR FIREABLE(I_ask2_2_5) OR FIREABLE(I_ask2_3_5) OR FIREABLE(I_ask2_4_5) OR FIREABLE(I_ask2_5_5) OR FIREABLE(I_ask2_6_5) OR FIREABLE(I_ask2_1_6) OR FIREABLE(I_ask2_2_6) OR FIREABLE(I_ask2_3_6) OR FIREABLE(I_ask2_4_6) OR FIREABLE(I_ask2_5_6) OR FIREABLE(I_ask2_6_6)))) : A (X (((FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3) OR FIREABLE(C_free_4_4) OR FIREABLE(C_free_5_5) OR FIREABLE(C_free_6_6)) U X (X ((FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3) OR FIREABLE(I_rec1_4_4) OR FIREABLE(I_rec1_5_5) OR FIREABLE(I_rec1_6_6))))))) : A (X (G ((F ((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3) OR FIREABLE(loss_m_4) OR FIREABLE(loss_m_5) OR FIREABLE(loss_m_6))) U X ((FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3) OR FIREABLE(I_refused_4_4) OR FIREABLE(I_refused_5_5) OR FIREABLE(I_refused_6_6))))))) : A ((FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_4_1) OR FIREABLE(I_ask2_5_1) OR FIREABLE(I_ask2_6_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_4_2) OR FIREABLE(I_ask2_5_2) OR FIREABLE(I_ask2_6_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3) OR FIREABLE(I_ask2_4_3) OR FIREABLE(I_ask2_5_3) OR FIREABLE(I_ask2_6_3) OR FIREABLE(I_ask2_1_4) OR FIREABLE(I_ask2_2_4) OR FIREABLE(I_ask2_3_4) OR FIREABLE(I_ask2_4_4) OR FIREABLE(I_ask2_5_4) OR FIREABLE(I_ask2_6_4) OR FIREABLE(I_ask2_1_5) OR FIREABLE(I_ask2_2_5) OR FIREABLE(I_ask2_3_5) OR FIREABLE(I_ask2_4_5) OR FIREABLE(I_ask2_5_5) OR FIREABLE(I_ask2_6_5) OR FIREABLE(I_ask2_1_6) OR FIREABLE(I_ask2_2_6) OR FIREABLE(I_ask2_3_6) OR FIREABLE(I_ask2_4_6) OR FIREABLE(I_ask2_5_6) OR FIREABLE(I_ask2_6_6))) : A (G (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_4_1_1) OR FIREABLE(C_provide_5_1_1) OR FIREABLE(C_provide_6_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_4_2_2) OR FIREABLE(C_provide_5_2_2) OR FIREABLE(C_provide_6_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(C_provide_4_3_3) OR FIREABLE(C_provide_5_3_3) OR FIREABLE(C_provide_6_3_3) OR FIREABLE(C_provide_1_4_4) OR FIREABLE(C_provide_2_4_4) OR FIREABLE(C_provide_3_4_4) OR FIREABLE(C_provide_4_4_4) OR FIREABLE(C_provide_5_4_4) OR FIREABLE(C_provide_6_4_4) OR FIREABLE(C_provide_1_5_5) OR FIREABLE(C_provide_2_5_5) OR FIREABLE(C_provide_3_5_5) OR FIREABLE(C_provide_4_5_5) OR FIREABLE(C_provide_5_5_5) OR FIREABLE(C_provide_6_5_5) OR FIREABLE(C_provide_1_6_6) OR FIREABLE(C_provide_2_6_6) OR FIREABLE(C_provide_3_6_6) OR FIREABLE(C_provide_4_6_6) OR FIREABLE(C_provide_5_6_6) OR FIREABLE(C_provide_6_6_6))))) : A (X (F (G (G (G (FIREABLE(loss_m_6))))))) : A ((G (X (G (FIREABLE(I_free_3_5)))) U F (FIREABLE(I_emit_1_1_6)))) : A (F (X (FIREABLE(C_provide_2_4_4)))) : A ((FIREABLE(I_ask2_5_1) U X ((FIREABLE(I_ask1_4_6) U FIREABLE(C_refuse_4_4_1_1))))) : A ((G (FIREABLE(C_refuse_2_5_6_6)) U G (X (X (FIREABLE(C_refuse_3_6_3_3)))))) : A (X (G (G (G (G (FIREABLE(I_emit_2_2_1))))))) : A (F (FIREABLE(I_ask1_1_3))) : A (G (FIREABLE(C_refuse_6_1_1_1)))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_4_1) OR FIREABLE(I_ask2_5_1) OR FIREABLE(I_ask2_6_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_4_2) OR FIREABLE(I_ask2_5_2) OR FIREABLE(I_ask2_6_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3) OR FIREABLE(I_ask2_4_3) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_4_1) OR FIREABLE(I_ask2_5_1) OR FIREABLE(I_ask2_6_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_4_2) OR FIREABLE(I_ask2_5_2) OR FIREABLE(I_ask2_6_2) OR FIREABLE(I_ask2_1_3) OR FIREABLE(I_ask2_2_3) OR FIREABLE(I_ask2_3_3) OR FIREABLE(I_ask2_4_3) OR ... (shortened)
lola: processed formula length: 897
lola: 33 rewrites
lola: closed formula file SafeBus-PT-06-LTLFireability.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: ========================================

FORMULA SafeBus-PT-06-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_4_1) OR FIREABLE(I_free_5_1) OR FIREABLE(I_free_6_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_4_2) OR FIREABLE(I_free_5_2) OR FIREABLE(I_free_6_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3) OR FIREABLE(I_free_4_3) OR FIREABLE(I_free_5_3) OR FIREABLE(I_free_6_3) OR FIREABLE(I_fre... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_4_1) OR FIREABLE(I_free_5_1) OR FIREABLE(I_free_6_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_4_2) OR FIREABLE(I_free_5_2) OR FIREABLE(I_free_6_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3) OR FIREABLE(I_free_4_3) OR FIREABLE(I_free_5_3) OR FIREABLE(I_free_6_3) OR FIREABLE(I_free... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(I_free_2_1) OR FIREABLE(I_free_3_1) OR FIREABLE(I_free_4_1) OR FIREABLE(I_free_5_1) OR FIREABLE(I_free_6_1) OR FIREABLE(I_free_1_2) OR FIREABLE(I_free_3_2) OR FIREABLE(I_free_4_2) OR FIREABLE(I_free_5_2) OR FIREABLE(I_free_6_2) OR FIREABLE(I_free_1_3) OR FIREABLE(I_free_2_3) OR FIREABLE(I_free_4_3) OR FIREABLE(I_free_5_3) OR FIREABLE(I_free_6_3) OR FIREABLE(I_free... (shortened)
lola: processed formula length: 759
lola: 33 rewrites
lola: closed formula file SafeBus-PT-06-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 111 markings, 112 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA SafeBus-PT-06-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X ((FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3) OR FIREABLE(I_rec1_4_4) OR FIREABLE(I_rec1_5_5) OR FIREABLE(I_rec1_6_6))) U (FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_4_1) OR FIREABLE(I_ask2_5_1) OR FIREABLE(I_ask2_6_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3) OR FIREABLE(I_rec1_4_4) OR FIREABLE(I_rec1_5_5) OR FIREABLE(I_rec1_6_6))) U (FIREABLE(I_ask2_1_1) OR FIREABLE(I_ask2_2_1) OR FIREABLE(I_ask2_3_1) OR FIREABLE(I_ask2_4_1) OR FIREABLE(I_ask2_5_1) OR FIREABLE(I_ask2_6_1) OR FIREABLE(I_ask2_1_2) OR FIREABLE(I_ask2_2_2) OR FIREABLE(I_ask2_3_2) OR FIREABLE(I_ask2_... (shortened)
lola: processed formula length: 1057
lola: 33 rewrites
lola: closed formula file SafeBus-PT-06-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 130 markings, 130 edges
lola: ========================================

FORMULA SafeBus-PT-06-LTLFireability-3 FALSE 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: A (X (((FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3) OR FIREABLE(C_free_4_4) OR FIREABLE(C_free_5_5) OR FIREABLE(C_free_6_6)) U X (X ((FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3) OR FIREABLE(I_rec1_4_4) OR FIREABLE(I_rec1_5_5) OR FIREABLE(I_rec1_6_6)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3) OR FIREABLE(C_free_4_4) OR FIREABLE(C_free_5_5) OR FIREABLE(C_free_6_6)) U X (X ((FIREABLE(I_rec1_1_1) OR FIREABLE(I_rec1_2_2) OR FIREABLE(I_rec1_3_3) OR FIREABLE(I_rec1_4_4) OR FIREABLE(I_rec1_5_5) OR FIREABLE(I_rec1_6_6)))))))
lola: processed formula length: 315
lola: 33 rewrites
lola: closed formula file SafeBus-PT-06-LTLFireability.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 130 markings, 130 edges
lola: ========================================

FORMULA SafeBus-PT-06-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3) OR FIREABLE(I_refused_4_4) OR FIREABLE(I_refused_5_5) OR FIREABLE(I_refused_6_6))) AND (F ((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3) OR FIREABLE(loss_m_4) OR FIREABLE(loss_m_5) OR FIREABLE(loss_m_6))) OR X ((FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_r... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_refused_3_3) OR FIREABLE(I_refused_4_4) OR FIREABLE(I_refused_5_5) OR FIREABLE(I_refused_6_6))) AND (F ((FIREABLE(loss_m_1) OR FIREABLE(loss_m_2) OR FIREABLE(loss_m_3) OR FIREABLE(loss_m_4) OR FIREABLE(loss_m_5) OR FIREABLE(loss_m_6))) OR X ((FIREABLE(I_refused_1_1) OR FIREABLE(I_refused_2_2) OR FIREABLE(I_r... (shortened)
lola: processed formula length: 502
lola: 33 rewrites
lola: closed formula file SafeBus-PT-06-LTLFireability.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 259 markings, 259 edges
lola: ========================================

FORMULA SafeBus-PT-06-LTLFireability-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 (X (F ((FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3) OR FIREABLE(C_free_4_4) OR FIREABLE(C_free_5_5) OR FIREABLE(C_free_6_6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((FIREABLE(C_free_1_1) OR FIREABLE(C_free_2_2) OR FIREABLE(C_free_3_3) OR FIREABLE(C_free_4_4) OR FIREABLE(C_free_5_5) OR FIREABLE(C_free_6_6)))))
lola: processed formula length: 159
lola: 33 rewrites
lola: closed formula file SafeBus-PT-06-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 692082 markings, 2301324 edges, 138416 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 779197 markings, 2595372 edges
lola: ========================================

FORMULA SafeBus-PT-06-LTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (FIREABLE(C_provide_2_4_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(C_provide_2_4_4))))
lola: processed formula length: 37
lola: 33 rewrites
lola: closed formula file SafeBus-PT-06-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 161 markings, 216 edges
lola: ========================================

FORMULA SafeBus-PT-06-LTLFireability-10 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: A ((FIREABLE(I_ask2_5_1) U X ((FIREABLE(I_ask1_4_6) U FIREABLE(C_refuse_4_4_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(I_ask2_5_1) U X ((FIREABLE(I_ask1_4_6) U FIREABLE(C_refuse_4_4_1_1)))))
lola: processed formula length: 84
lola: 33 rewrites
lola: closed formula file SafeBus-PT-06-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 130 markings, 130 edges
lola: ========================================

FORMULA SafeBus-PT-06-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (X (G (FIREABLE(C_refuse_3_6_3_3)))) OR (G (FIREABLE(C_refuse_2_5_6_6)) AND F (G (FIREABLE(C_refuse_3_6_3_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X (G (FIREABLE(C_refuse_3_6_3_3)))) OR (G (FIREABLE(C_refuse_2_5_6_6)) AND F (G (FIREABLE(C_refuse_3_6_3_3))))))
lola: processed formula length: 119
lola: 33 rewrites
lola: closed formula file SafeBus-PT-06-LTLFireability.task
lola: the resulting Büchi automaton has 11 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 130 markings, 130 edges
lola: ========================================

FORMULA SafeBus-PT-06-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (FIREABLE(I_emit_2_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (FIREABLE(I_emit_2_2_1))))
lola: processed formula length: 34
lola: 33 rewrites
lola: closed formula file SafeBus-PT-06-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 130 markings, 130 edges
lola: ========================================

FORMULA SafeBus-PT-06-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(C_refuse_6_1_1_1)))
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(C_refuse_6_1_1_1)))
lola: processed formula length: 34
lola: 35 rewrites
lola: closed formula file SafeBus-PT-06-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA SafeBus-PT-06-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: 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_4_1_1) OR FIREABLE(C_provide_5_1_1) OR FIREABLE(C_provide_6_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_4_2_2) OR FIREABLE(C_provide_5_2_2) OR FIREABLE(C_provide_6_2_2) OR FIREABLE(C_provide_1_3_3) OR FIR... (shortened)
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(C_provide_1_1_1) OR FIREABLE(C_provide_2_1_1) OR FIREABLE(C_provide_3_1_1) OR FIREABLE(C_provide_4_1_1) OR FIREABLE(C_provide_5_1_1) OR FIREABLE(C_provide_6_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_4_2_2) OR FIREABLE(C_provide_5_2_2) OR FIREABLE(C_provide_6_2_2) OR FIREABLE(C_provide_1_3_3) OR FIR... (shortened)
lola: processed formula length: 1085
lola: 35 rewrites
lola: closed formula file SafeBus-PT-06-LTLFireability.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(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_4_1_1) AND NOT FIREABLE(C_provide_5_1_1) AND NOT FIREABLE(C_provide_6_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_4_2_2) AND NOT FIREABLE(C_provide_5_2_2) AND NOT FIREABLE(C_provide_6_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(C_provide_4_3_3) AND NOT FIREABLE(C_provide_5_3_3) AND NOT FIREABLE(C_provide_6_3_3) AND NOT FIREABLE(C_provide_1_4_4) AND NOT FIREABLE(C_provide_2_4_4) AND NOT FIREABLE(C_provide_3_4_4) AND NOT FIREABLE(C_provide_4_4_4) AND NOT FIREABLE(C_provide_5_4_4) AND NOT FIREABLE(C_provide_6_4_4) AND NOT FIREABLE(C_provide_1_5_5) AND NOT FIREABLE(C_provide_2_5_5) AND NOT FIREABLE(C_provide_3_5_5) AND NOT FIREABLE(C_provide_4_5_5) AND NOT FIREABLE(C_provide_5_5_5) AND NOT FIREABLE(C_provide_6_5_5) AND NOT FIREABLE(C_provide_1_6_6) AND NOT FIREABLE(C_provide_2_6_6) AND NOT FIREABLE(C_provide_3_6_6) AND NOT FIREABLE(C_provide_4_6_6) AND NOT FIREABLE(C_provide_5_6_6) AND NOT FIREABLE(C_provide_6_6_6))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges

FORMULA SafeBus-PT-06-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(I_ask1_1_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)
lola: processed formula length: 24
lola: 35 rewrites
lola: closed formula file SafeBus-PT-06-LTLFireability.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: 54 markings, 54 edges
lola: ========================================

FORMULA SafeBus-PT-06-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(I_emit_1_1_6)))
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_emit_1_1_6)
lola: processed formula length: 26
lola: 35 rewrites
lola: closed formula file SafeBus-PT-06-LTLFireability.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: 63 markings, 63 edges
lola: ========================================

FORMULA SafeBus-PT-06-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(loss_m_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(loss_m_6))))
lola: processed formula length: 30
lola: 33 rewrites
lola: closed formula file SafeBus-PT-06-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 56 markings, 57 edges

FORMULA SafeBus-PT-06-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3) OR FIREABLE(Gto_4) OR FIREABLE(Gto_5) OR FIREABLE(Gto_6)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((FIREABLE(Gto_1) OR FIREABLE(Gto_2) OR FIREABLE(Gto_3) OR FIREABLE(Gto_4) OR FIREABLE(Gto_5) OR FIREABLE(Gto_6)))))
lola: processed formula length: 129
lola: 33 rewrites
lola: closed formula file SafeBus-PT-06-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 110 markings, 140 edges
lola:
FORMULA SafeBus-PT-06-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no no no no no no no no no no no no no
lola:
preliminary result: yes no no no no no no no no no no no no no no no
========================================
lola: memory consumption: 15348 KB
lola: time consumption: 5 seconds

BK_STOP 1528134303911

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