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 268K
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K 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.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 26K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is CSRepetitions-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306500438
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526603097208

info: Time: 3600 - MCC
===========================================================================================
prep: translating CSRepetitions-PT-02 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating CSRepetitions-PT-02 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ CSRepetitions-PT-02 @ 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: 51/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 736
lola: finding significant places
lola: 23 places, 28 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 45 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-PT-02-CTLFireability.task
lola: A (G (NOT(A (G ((NOT FIREABLE(Send_Answer_3_2) AND NOT FIREABLE(Send_Answer_4_2) AND NOT FIREABLE(Send_Answer_1_1) AND NOT FIREABLE(Send_Answer_3_1) AND NOT FIREABLE(Send_Answer_2_1) AND NOT FIREABLE(Send_Answer_4_1) AND NOT FIREABLE(Send_Answer_1_2) AND NOT FIREABLE(Send_Answer_2_2))))))) : A (G (NOT(((NOT FIREABLE(Prepare_Request_2) AND NOT FIREABLE(Prepare_Request_3) AND NOT FIREABLE(Prepare_Request_1) AND NOT FIREABLE(Prepare_Request_4) AND (FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_4)) AND (FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1))) AND E (G ((FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_2_2)))))))) : E (X ((E (G ((NOT FIREABLE(Send_Answer_3_2) AND NOT FIREABLE(Send_Answer_4_2) AND NOT FIREABLE(Send_Answer_1_1) AND NOT FIREABLE(Send_Answer_3_1) AND NOT FIREABLE(Send_Answer_2_1) AND NOT FIREABLE(Send_Answer_4_1) AND NOT FIREABLE(Send_Answer_1_2) AND NOT FIREABLE(Send_Answer_2_2)))) AND (FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1) OR FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1))))) : NOT(A (F ((FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_2_2))))) : (A (G ((NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3) AND (FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_2_2))))) OR (((NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3) AND NOT FIREABLE(Read_Request_4_2) AND NOT FIREABLE(Read_Request_3_2) AND NOT FIREABLE(Read_Request_1_1) AND NOT FIREABLE(Read_Request_2_2) AND NOT FIREABLE(Read_Request_1_2) AND NOT FIREABLE(Read_Request_4_1) AND NOT FIREABLE(Read_Request_3_1) AND NOT FIREABLE(Read_Request_2_1) AND NOT FIREABLE(Send_Answer_3_2) AND NOT FIREABLE(Send_Answer_4_2) AND NOT FIREABLE(Send_Answer_1_1) AND NOT FIREABLE(Send_Answer_3_1) AND NOT FIREABLE(Send_Answer_2_1) AND NOT FIREABLE(Send_Answer_4_1) AND NOT FIREABLE(Send_Answer_1_2) AND NOT FIREABLE(Send_Answer_2_2)) AND (A (X ((FIREABLE(Read_Request_4_2) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_1_1) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_1_2) OR FIREABLE(Read_Request_4_1) OR FIREABLE(Read_Request_3_1) OR FIREABLE(Read_Request_2_1)))) AND (FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_4) OR FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1) OR (NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3))))) OR NOT(NOT(A (F ((FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_2_2)))))))) : E (F ((A (G (((FIREABLE(Send_Request_2) OR FIREABLE(Send_Request_4) OR FIREABLE(Send_Request_1) OR FIREABLE(Send_Request_3)) AND (FIREABLE(Read_Request_4_2) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_1_1) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_1_2) OR FIREABLE(Read_Request_4_1) OR FIREABLE(Read_Request_3_1) OR FIREABLE(Read_Request_2_1))))) AND A (F (((FIREABLE(Send_Request_2) OR FIREABLE(Send_Request_4) OR FIREABLE(Send_Request_1) OR FIREABLE(Send_Request_3)) AND (FIREABLE(Read_Request_4_2) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_1_1) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_1_2) OR FIREABLE(Read_Request_4_1) OR FIREABLE(Read_Request_3_1) OR FIREABLE(Read_Request_2_1)))))))) : A (G ((E (((FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_4)) U (FIREABLE(Read_Request_4_2) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_1_1) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_1_2) OR FIREABLE(Read_Request_4_1) OR FIREABLE(Read_Request_3_1) OR FIREABLE(Read_Request_2_1)))) OR (FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_4) OR FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1) OR (NOT FIREABLE(Lose_Request_4) AND NOT FIREABLE(Lose_Request_2) AND NOT FIREABLE(Lose_Request_3) AND NOT FIREABLE(Lose_Request_1)) OR FIREABLE(Send_Request_2) OR FIREABLE(Send_Request_4) OR FIREABLE(Send_Request_1) OR FIREABLE(Send_Request_3))))) : E (F (NOT((A (F ((FIREABLE(Send_Request_2) OR FIREABLE(Send_Request_4) OR FIREABLE(Send_Request_1) OR FIREABLE(Send_Request_3)))) OR A (G ((FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_4)))))))) : ((E (F ((FIREABLE(Read_Request_1_2) AND FIREABLE(Send_Answer_4_2) AND (FIREABLE(Read_Request_1_1) OR FIREABLE(Lose_Request_3))))) OR NOT FIREABLE(Prepare_Request_4)) AND (NOT(A (G ((FIREABLE(Read_Request_1_2) OR FIREABLE(Prepare_Request_1))))) OR E (F (NOT FIREABLE(Read_Request_3_1))))) : E (F (NOT(NOT(A (G (FIREABLE(Read_Request_4_2))))))) : A (F (A (G (E (F (FIREABLE(Send_Answer_3_2))))))) : (E (F (FIREABLE(Read_Request_4_1))) AND (NOT(A ((FIREABLE(Read_Request_2_1) U FIREABLE(Prepare_Request_1)))) OR ((NOT FIREABLE(Send_Answer_4_1) AND NOT FIREABLE(Send_Answer_1_2) AND (FIREABLE(Send_Answer_4_2) OR FIREABLE(Prepare_Request_3))) AND E (F (NOT FIREABLE(Prepare_Request_1)))))) : A (X ((NOT FIREABLE(Send_Answer_2_2) AND (E (G (FIREABLE(Read_Request_1_1))) OR (FIREABLE(Send_Answer_2_2) AND FIREABLE(Read_Request_4_1) AND NOT FIREABLE(Prepare_Request_1)))))) : E (((NOT FIREABLE(Read_Request_1_2) OR E (X (FIREABLE(Send_Answer_2_2)))) U (((FIREABLE(Read_Request_3_2) AND FIREABLE(Prepare_Request_3)) OR NOT FIREABLE(Send_Answer_4_2)) OR A (F (FIREABLE(Send_Request_2)))))) : ((NOT(E (X ((FIREABLE(Prepare_Request_1) AND FIREABLE(Send_Answer_3_2))))) OR NOT FIREABLE(Send_Answer_1_2)) OR A ((NOT FIREABLE(Send_Answer_3_2) U A (F (FIREABLE(Lose_Request_3)))))) : A (G (E (X (A (F (FIREABLE(Send_Answer_2_2)))))))
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: rewrite Frontend/Parser/formula_rewrite.k:315
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:323
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:332
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:300
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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:323
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:329
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:464
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:551
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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 ((NOT FIREABLE(Send_Answer_3_2) AND NOT FIREABLE(Send_Answer_4_2) AND NOT FIREABLE(Send_Answer_1_1) AND NOT FIREABLE(Send_Answer_3_1) AND NOT FIREABLE(Send_Answer_2_1) AND NOT FIREABLE(Send_Answer_4_1) AND NOT FIREABLE(Send_Answer_1_2) AND NOT FIREABLE(Send_Answer_2_2)))) AND (FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: EX((NOT(A(TRUE U (FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_2_2)))) AND (FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1) OR FIREABLE(Lose_Request_... (shortened)
lola: processed formula length: 492
lola: 47 rewrites
lola: closed formula file CSRepetitions-PT-02-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: 49 markings, 51 edges
lola: ========================================

FORMULA CSRepetitions-PT-02-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: (A (G ((NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3) AND (FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_2_2))))) OR (((NOT FIREABLE(... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3) AND (FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_2_2)))))
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(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3) AND (FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_2_2)))))
lola: processed formula length: 379
lola: 46 rewrites
lola: closed formula file CSRepetitions-PT-02-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (FIREABLE(Send_Request_2) OR FIREABLE(Send_Request_4) OR FIREABLE(Send_Request_1) OR FIREABLE(Send_Request_3) OR (NOT FIREABLE(Send_Answer_3_2) AND NOT FIREABLE(Send_Answer_4_2) AND NOT FIREABLE(Send_Answer_1_1) AND NOT FIREABLE(Send_Answer_3_1) AND NOT FIREABLE(Send_Answer_2_1) AND NOT FIREABLE(Send_Answer_4_1) AND NOT FIREABLE(Send_Answer_1_2) AND NOT FIREABLE(Send_Answer_2_2)))
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_4) OR FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1) OR (NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_4) OR FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1) OR (NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3)))
lola: processed formula length: 375
lola: 44 rewrites
lola: closed formula file CSRepetitions-PT-02-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 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3) AND NOT FIREABLE(Read_Request_4_2) AND NOT FIREABLE(Read_Request_3_2) AND NOT FIREABLE(Read_Request_1_1) AND NOT FIREABLE(Read_Request_2_2) AND NOT FIREABLE(Read_Request_1_2) AND NOT FIREABLE(Read_Request_4_1) AND NOT FIREABLE(Read_Request_3_1) AND NOT FIREABLE(Read_Requ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3) AND NOT FIREABLE(Read_Request_4_2) AND NOT FIREABLE(Read_Request_3_2) AND NOT FIREABLE(Read_Request_1_1) AND NOT FIREABLE(Read_Request_2_2) AND NOT FIREABLE(Read_Request_1_2) AND NOT FIREABLE(Read_Request_4_1) AND NOT FIREABLE(Read_Request_3_1) AND NOT FIREABLE(Read_Requ... (shortened)
lola: processed formula length: 681
lola: 44 rewrites
lola: closed formula file CSRepetitions-PT-02-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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_2_2))))
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(Send_Answer_3_2) AND NOT FIREABLE(Send_Answer_4_2) AND NOT FIREABLE(Send_Answer_1_1) AND NOT FIREABLE(Send_Answer_3_1) AND NOT FIREABLE(Send_Answer_2_1) AND NOT FIREABLE(Send_Answer_4_1) AND NOT FIREABLE(Send_Answer_1_2) AND NOT FIREABLE(Send_Answer_2_2))
lola: processed formula length: 269
lola: 46 rewrites
lola: closed formula file CSRepetitions-PT-02-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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(Read_Request_4_2) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_1_1) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_1_2) OR FIREABLE(Read_Request_4_1) OR FIREABLE(Read_Request_3_1) OR FIREABLE(Read_Request_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((FIREABLE(Read_Request_4_2) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_1_1) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_1_2) OR FIREABLE(Read_Request_4_1) OR FIREABLE(Read_Request_3_1) OR FIREABLE(Read_Request_2_1)))
lola: processed formula length: 249
lola: 45 rewrites
lola: closed formula file CSRepetitions-PT-02-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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA CSRepetitions-PT-02-CTLFireability-4 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 (X (NOT FIREABLE(Send_Answer_2_2))) AND A (X ((E (G (FIREABLE(Read_Request_1_1))) OR (FIREABLE(Send_Answer_2_2) AND FIREABLE(Read_Request_4_1) AND NOT FIREABLE(Prepare_Request_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (NOT FIREABLE(Send_Answer_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(NOT FIREABLE(Send_Answer_2_2))
lola: processed formula length: 33
lola: 45 rewrites
lola: closed formula file CSRepetitions-PT-02-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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((E (G (FIREABLE(Read_Request_1_1))) OR (FIREABLE(Send_Answer_2_2) AND FIREABLE(Read_Request_4_1) AND NOT FIREABLE(Prepare_Request_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: AX((NOT(A(TRUE U NOT FIREABLE(Read_Request_1_1))) OR (FIREABLE(Send_Answer_2_2) AND FIREABLE(Read_Request_4_1) AND NOT FIREABLE(Prepare_Request_1))))
lola: processed formula length: 149
lola: 47 rewrites
lola: closed formula file CSRepetitions-PT-02-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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA CSRepetitions-PT-02-CTLFireability-12 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: E (((NOT FIREABLE(Read_Request_1_2) OR E (X (FIREABLE(Send_Answer_2_2)))) U (((FIREABLE(Read_Request_3_2) AND FIREABLE(Prepare_Request_3)) OR NOT FIREABLE(Send_Answer_4_2)) OR A (F (FIREABLE(Send_Request_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E((NOT FIREABLE(Read_Request_1_2) OR EX(FIREABLE(Send_Answer_2_2))) U (((FIREABLE(Read_Request_3_2) AND FIREABLE(Prepare_Request_3)) OR NOT FIREABLE(Send_Answer_4_2)) OR A(TRUE U FIREABLE(Send_Request_2))))
lola: processed formula length: 207
lola: 47 rewrites
lola: closed formula file CSRepetitions-PT-02-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: 1 markings, 0 edges
lola: ========================================

FORMULA CSRepetitions-PT-02-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((NOT FIREABLE(Prepare_Request_1) OR NOT FIREABLE(Send_Answer_3_2)))) OR (NOT FIREABLE(Send_Answer_1_2) OR A (F (FIREABLE(Lose_Request_3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(Send_Answer_1_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(Send_Answer_1_2)
lola: processed formula length: 29
lola: 44 rewrites
lola: closed formula file CSRepetitions-PT-02-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA CSRepetitions-PT-02-CTLFireability-14 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: A (G (E (X (A (F (FIREABLE(Send_Answer_2_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
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(A(TRUE U FIREABLE(Send_Answer_2_2))))))
lola: processed formula length: 59
lola: 47 rewrites
lola: closed formula file CSRepetitions-PT-02-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: 47 markings, 50 edges
lola: ========================================

FORMULA CSRepetitions-PT-02-CTLFireability-15 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 (A (G (FIREABLE(Read_Request_4_2)))))
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(Read_Request_4_2)
lola: processed formula length: 30
lola: 46 rewrites
lola: closed formula file CSRepetitions-PT-02-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: 7424 markings, 36903 edges
lola: ========================================

FORMULA CSRepetitions-PT-02-CTLFireability-9 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 (G (E (F (FIREABLE(Send_Answer_3_2)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: FIREABLE(Send_Answer_3_2)
lola: processed formula length: 25
lola: 45 rewrites
lola: closed formula file CSRepetitions-PT-02-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 live.
lola: 16 markings, 19 edges
lola: ========================================

FORMULA CSRepetitions-PT-02-CTLFireability-10 FALSE 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 (G ((NOT FIREABLE(Send_Answer_3_2) AND NOT FIREABLE(Send_Answer_4_2) AND NOT FIREABLE(Send_Answer_1_1) AND NOT FIREABLE(Send_Answer_3_1) AND NOT FIREABLE(Send_Answer_2_1) AND NOT FIREABLE(Send_Answer_4_1) AND NOT FIREABLE(Send_Answer_1_2) AND NOT FIREABLE(Send_Answer_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((NOT FIREABLE(Send_Answer_3_2) AND NOT FIREABLE(Send_Answer_4_2) AND NOT FIREABLE(Send_Answer_1_1) AND NOT FIREABLE(Send_Answer_3_1) AND NOT FIREABLE(Send_Answer_2_1) AND NOT FIREABLE(Send_Answer_4_1) AND NOT FIREABLE(Send_Answer_1_2) AND NOT FIREABLE(Send_Answer_2_2))))
lola: processed formula length: 277
lola: 44 rewrites
lola: closed formula file CSRepetitions-PT-02-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: 9 markings, 8 edges
lola: ========================================

FORMULA CSRepetitions-PT-02-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (FIREABLE(Send_Answer_3_2) OR FIREABLE(Send_Answer_4_2) OR FIREABLE(Send_Answer_1_1) OR FIREABLE(Send_Answer_3_1) OR FIREABLE(Send_Answer_2_1) OR FIREABLE(Send_Answer_4_1) OR FIREABLE(Send_Answer_1_2) OR FIREABLE(Send_Answer_2_2))
lola: processed formula length: 237
lola: 45 rewrites
lola: closed formula file CSRepetitions-PT-02-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 live.
lola: 279 markings, 442 edges
lola: ========================================

FORMULA CSRepetitions-PT-02-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_4) OR (NOT FIREABLE(Prepare_Request_2) AND NOT FIREABLE(Prepare_Request_3) AND NOT FIREABLE(Prepare_Request_1) AND NOT FIREABLE(Prepare_Request_4)) OR (NOT FIREABLE(Lose_Request_4) AND NOT FIREABLE(Lose_Request_2) AND NOT FIREABLE(Lose_Request_3) AND NOT FIREABLE(Lose_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: NOT(E(TRUE U ((NOT FIREABLE(Prepare_Request_2) AND NOT FIREABLE(Prepare_Request_3) AND NOT FIREABLE(Prepare_Request_1) AND NOT FIREABLE(Prepare_Request_4) AND (FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_4)) AND (FIREABLE(Lose_Request_4) OR FIREABLE(Lose_Request_2) OR FIREABLE(Lose_Request_3) OR FIREABLE(Lose_Request_1... (shortened)
lola: processed formula length: 695
lola: 48 rewrites
lola: closed formula file CSRepetitions-PT-02-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: 7424 markings, 37088 edges
lola: ========================================

FORMULA CSRepetitions-PT-02-CTLFireability-1 TRUE 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 (G ((E (((FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_4)) U (FIREABLE(Read_Request_4_2) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_1_1) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_1_2) OR FIREABLE(Read_Request_4_1) OR FIREABLE(Read_Request_3_1) OR FIREABLE(Read_Request_2_1)))) OR (FIREABLE(... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (NOT(E((FIREABLE(Prepare_Request_2) OR FIREABLE(Prepare_Request_3) OR FIREABLE(Prepare_Request_1) OR FIREABLE(Prepare_Request_4)) U (FIREABLE(Read_Request_4_2) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_1_1) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_1_2) OR FIREABLE(Read_Request_4_1) OR FIREABLE(Read_Request_3_1) OR FIREABLE(Read_Request_2_1)))) AND ... (shortened)
lola: processed formula length: 926
lola: 48 rewrites
lola: closed formula file CSRepetitions-PT-02-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: 7424 markings, 49868 edges
lola: ========================================

FORMULA CSRepetitions-PT-02-CTLFireability-6 TRUE 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 (F ((E (G ((NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3)))) AND E (F ((NOT FIREABLE(Prepare_Request_2) AND NOT FIREABLE(Prepare_Request_3) AND NOT FIREABLE(Prepare_Request_1) AND NOT FIREABLE(Prepare_Request_4)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: E(TRUE U (NOT(A(TRUE U (FIREABLE(Send_Request_2) OR FIREABLE(Send_Request_4) OR FIREABLE(Send_Request_1) OR FIREABLE(Send_Request_3)))) AND E(TRUE U (NOT FIREABLE(Prepare_Request_2) AND NOT FIREABLE(Prepare_Request_3) AND NOT FIREABLE(Prepare_Request_1) AND NOT FIREABLE(Prepare_Request_4)))))
lola: processed formula length: 296
lola: 48 rewrites
lola: closed formula file CSRepetitions-PT-02-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 39 markings, 61 edges
lola: ========================================

FORMULA CSRepetitions-PT-02-CTLFireability-7 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 (F ((A (G (((FIREABLE(Send_Request_2) OR FIREABLE(Send_Request_4) OR FIREABLE(Send_Request_1) OR FIREABLE(Send_Request_3)) AND (FIREABLE(Read_Request_4_2) OR FIREABLE(Read_Request_3_2) OR FIREABLE(Read_Request_1_1) OR FIREABLE(Read_Request_2_2) OR FIREABLE(Read_Request_1_2) OR FIREABLE(Read_Request_4_1) OR FIREABLE(Read_Request_3_1) OR FIREABLE(Read_Request_2_1))))) AND A (F (((FIREABL... (shortened)
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:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U (NOT(E(TRUE U ((NOT FIREABLE(Send_Request_2) AND NOT FIREABLE(Send_Request_4) AND NOT FIREABLE(Send_Request_1) AND NOT FIREABLE(Send_Request_3)) OR (NOT FIREABLE(Read_Request_4_2) AND NOT FIREABLE(Read_Request_3_2) AND NOT FIREABLE(Read_Request_1_1) AND NOT FIREABLE(Read_Request_2_2) AND NOT FIREABLE(Read_Request_1_2) AND NOT FIREABLE(Read_Request_4_1) AND NOT FIREABLE(Read_Request_3_1) ... (shortened)
lola: processed formula length: 820
lola: 48 rewrites
lola: closed formula file CSRepetitions-PT-02-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: 7424 markings, 45052 edges
lola: ========================================

FORMULA CSRepetitions-PT-02-CTLFireability-5 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 (F ((FIREABLE(Read_Request_1_2) AND FIREABLE(Send_Answer_4_2) AND (FIREABLE(Read_Request_1_1) OR FIREABLE(Lose_Request_3))))) OR NOT FIREABLE(Prepare_Request_4)) AND (E (F ((NOT FIREABLE(Read_Request_1_2) AND NOT FIREABLE(Prepare_Request_1)))) OR E (F (NOT FIREABLE(Read_Request_3_1)))))
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 (F (NOT FIREABLE(Read_Request_3_1)))
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(Read_Request_3_1)))
lola: processed formula length: 38
lola: 45 rewrites
lola: closed formula file CSRepetitions-PT-02-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(Read_Request_3_1)
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CSRepetitions-PT-02-CTLFireability-14-0.sara
lola: ========================================
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(Prepare_Request_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(Prepare_Request_4)
lola: processed formula length: 31
lola: 44 rewrites
lola: closed formula file CSRepetitions-PT-02-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: 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: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (FIREABLE(Read_Request_4_1))) AND (E ((NOT FIREABLE(Read_Request_2_1) R NOT FIREABLE(Prepare_Request_1))) OR ((NOT FIREABLE(Send_Answer_4_1) AND NOT FIREABLE(Send_Answer_1_2) AND (FIREABLE(Send_Answer_4_2) OR FIREABLE(Prepare_Request_3))) AND E (F (NOT FIREABLE(Prepare_Request_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(Read_Request_4_1)))
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(Read_Request_4_1)))
lola: processed formula length: 34
lola: 45 rewrites
lola: closed formula file CSRepetitions-PT-02-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(Read_Request_4_1)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(Prepare_Request_1)))
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(Prepare_Request_1)))
lola: processed formula length: 39
lola: 45 rewrites
lola: closed formula file CSRepetitions-PT-02-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: NOT FIREABLE(Prepare_Request_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(Read_Request_2_1) R NOT FIREABLE(Prepare_Request_1)))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:646
lola: rewrite Frontend/Parser/formula_rewrite.k:610
lola: processed formula: E ((NOT FIREABLE(Read_Request_2_1) R NOT FIREABLE(Prepare_Request_1)))
lola: processed formula length: 70
lola: 46 rewrites
lola: closed formula file CSRepetitions-PT-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: There is no path where Predicate Phi releases Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((E (F ((FIREABLE(Read_Request_1_2) AND FIREABLE(Send_Answer_4_2) AND (FIREABLE(Read_Request_1_1) OR FIREABLE(Lose_Request_3))))) OR NOT FIREABLE(Prepare_Request_4)) AND (E (F ((NOT FIREABLE(Read_Request_1_2) AND NOT FIREABLE(Prepare_Request_1)))) OR E (F (NOT FIREABLE(Read_Request_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(Read_Request_3_1)))
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(Read_Request_3_1)))
lola: processed formula length: 38
lola: 45 rewrites
lola: closed formula file CSRepetitions-PT-02-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(Read_Request_3_1)
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(Prepare_Request_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(Prepare_Request_4)
lola: processed formula length: 31
lola: 44 rewrites
lola: closed formula file CSRepetitions-PT-02-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: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Read_Request_1_2) AND FIREABLE(Send_Answer_4_2) AND (FIREABLE(Read_Request_1_1) OR FIREABLE(Lose_Request_3)))))
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(Read_Request_1_2) AND FIREABLE(Send_Answer_4_2) AND (FIREABLE(Read_Request_1_1) OR FIREABLE(Lose_Request_3)))))
lola: processed formula length: 128
lola: 45 rewrites
lola: closed formula file CSRepetitions-PT-02-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(Read_Request_1_2) AND FIREABLE(Send_Answer_4_2) AND (FIREABLE(Read_Request_1_1) OR FIREABLE(Lose_Request_3)))
lola: state equation: Generated DNF with 11 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-02-CTLFireability-18-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-02-CTLFireability-18-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 5278 markings, 17727 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA CSRepetitions-PT-02-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (E (F (FIREABLE(Read_Request_4_1))) AND (E ((NOT FIREABLE(Read_Request_2_1) R NOT FIREABLE(Prepare_Request_1))) OR ((NOT FIREABLE(Send_Answer_4_1) AND NOT FIREABLE(Send_Answer_1_2) AND (FIREABLE(Send_Answer_4_2) OR FIREABLE(Prepare_Request_3))) AND E (F (NOT FIREABLE(Prepare_Request_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(Read_Request_4_1)))
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(Read_Request_4_1)))
lola: processed formula length: 34
lola: 45 rewrites
lola: closed formula file CSRepetitions-PT-02-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(Read_Request_4_1)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-02-CTLFireability-17-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: 3 markings, 2 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(Send_Answer_4_1) AND NOT FIREABLE(Send_Answer_1_2) AND (FIREABLE(Send_Answer_4_2) OR FIREABLE(Prepare_Request_3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(Send_Answer_4_1) AND NOT FIREABLE(Send_Answer_1_2) AND (FIREABLE(Send_Answer_4_2) OR FIREABLE(Prepare_Request_3)))
lola: processed formula length: 129
lola: 44 rewrites
lola: closed formula file CSRepetitions-PT-02-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: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(Prepare_Request_1)))
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(Prepare_Request_1)))
lola: processed formula length: 39
lola: 45 rewrites
lola: closed formula file CSRepetitions-PT-02-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA CSRepetitions-PT-02-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no yes no no yes yes no no no yes no yes yes no
lola:
preliminary result: no yes no yes no no yes yes no no no yes no yes yes no
lola: memory consumption: 14980 KB
lola: time consumption: 1 seconds

BK_STOP 1526603098056

--------------------
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="CSRepetitions-PT-02"
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/CSRepetitions-PT-02.tgz
mv CSRepetitions-PT-02 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 CSRepetitions-PT-02, 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 r028-ebro-152646306500438"
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 ;