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 372K
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K 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.6K 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 10K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 35K 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 12K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K 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 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 98K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Peterson-PT-2, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469700557
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527043840238

info: Time: 3600 - MCC
===========================================================================================
prep: translating Peterson-PT-2 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating Peterson-PT-2 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ Peterson-PT-2 @ 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: 228/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 102
lola: finding significant places
lola: 102 places, 126 transitions, 91 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 189 transition conflict sets
lola: TASK
lola: reading formula from Peterson-PT-2-CTLFireability.task
lola: A (G (E (F (A (F ((FIREABLE(ProgressTurn_0_0) OR FIREABLE(ProgressTurn_1_0) OR FIREABLE(ProgressTurn_2_0)))))))) : (E (G (E (F ((FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0)))))) AND E (F ((A (G ((FIREABLE(TurnDiff_1_0_1) OR FIREABLE(TurnDiff_1_2_0) OR FIREABLE(TurnDiff_0_2_0) OR FIREABLE(TurnDiff_2_1_0) OR FIREABLE(TurnDiff_0_2_1) OR FIREABLE(TurnDiff_2_1_1) OR FIREABLE(TurnDiff_0_1_1) OR FIREABLE(TurnDiff_2_0_1) OR FIREABLE(TurnDiff_0_1_0) OR FIREABLE(TurnDiff_2_0_0) OR FIREABLE(TurnDiff_1_0_0) OR FIREABLE(TurnDiff_1_2_1)))) AND (NOT FIREABLE(AccessCS_2) AND NOT FIREABLE(AccessCS_1) AND NOT FIREABLE(AccessCS_0) AND NOT FIREABLE(Alone1_0_2_0) AND NOT FIREABLE(Alone1_2_1_0) AND NOT FIREABLE(Alone1_0_1_0) AND NOT FIREABLE(Alone1_2_0_0) AND NOT FIREABLE(Alone1_1_0_0) AND NOT FIREABLE(Alone1_1_0_1) AND NOT FIREABLE(Alone1_1_2_0) AND NOT FIREABLE(Alone1_0_1_1) AND NOT FIREABLE(Alone1_2_0_1) AND NOT FIREABLE(Alone1_0_2_1) AND NOT FIREABLE(Alone1_2_1_1) AND NOT FIREABLE(Alone1_1_2_1)))))) : (E (F (A (G ((FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1)))))) OR (FIREABLE(Alone1_0_2_0) OR FIREABLE(Alone1_2_1_0) OR FIREABLE(Alone1_0_1_0) OR FIREABLE(Alone1_2_0_0) OR FIREABLE(Alone1_1_0_0) OR FIREABLE(Alone1_1_0_1) OR FIREABLE(Alone1_1_2_0) OR FIREABLE(Alone1_0_1_1) OR FIREABLE(Alone1_2_0_1) OR FIREABLE(Alone1_0_2_1) OR FIREABLE(Alone1_2_1_1) OR FIREABLE(Alone1_1_2_1))) : A (F (A (((FIREABLE(Identity_1_1) OR FIREABLE(Identity_2_1) OR FIREABLE(Identity_0_0) OR FIREABLE(Identity_1_0) OR FIREABLE(Identity_2_0) OR FIREABLE(Identity_0_1)) U (FIREABLE(NoIdentity_2_0_0) OR FIREABLE(NoIdentity_1_0_0) OR FIREABLE(NoIdentity_2_1_0) OR FIREABLE(NoIdentity_0_1_0) OR FIREABLE(NoIdentity_0_1_1) OR FIREABLE(NoIdentity_2_1_1) OR FIREABLE(NoIdentity_0_2_1) OR FIREABLE(NoIdentity_1_2_1) OR FIREABLE(NoIdentity_0_2_0) OR FIREABLE(NoIdentity_1_2_0) OR FIREABLE(NoIdentity_1_0_1) OR FIREABLE(NoIdentity_2_0_1) OR FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1)))))) : E (F (A (F (A (X ((FIREABLE(Alone1_0_2_0) OR FIREABLE(Alone1_2_1_0) OR FIREABLE(Alone1_0_1_0) OR FIREABLE(Alone1_2_0_0) OR FIREABLE(Alone1_1_0_0) OR FIREABLE(Alone1_1_0_1) OR FIREABLE(Alone1_1_2_0) OR FIREABLE(Alone1_0_1_1) OR FIREABLE(Alone1_2_0_1) OR FIREABLE(Alone1_0_2_1) OR FIREABLE(Alone1_2_1_1) OR FIREABLE(Alone1_1_2_1)))))))) : A (F ((FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1)))) : ((FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1)) OR E (F (A (G (((FIREABLE(ProgressTurn_0_0) OR FIREABLE(ProgressTurn_1_0) OR FIREABLE(ProgressTurn_2_0)) AND (FIREABLE(ProgressTurn_0_0) OR FIREABLE(ProgressTurn_1_0) OR FIREABLE(ProgressTurn_2_0)))))))) : ((FIREABLE(UpdateTurn_0_0_0) OR FIREABLE(UpdateTurn_1_0_0) OR FIREABLE(UpdateTurn_1_1_0) OR FIREABLE(UpdateTurn_2_1_0) OR FIREABLE(UpdateTurn_2_0_0) OR FIREABLE(UpdateTurn_0_1_0) OR FIREABLE(UpdateTurn_0_2_1) OR FIREABLE(UpdateTurn_2_1_1) OR FIREABLE(UpdateTurn_2_2_1) OR FIREABLE(UpdateTurn_1_2_1) OR FIREABLE(UpdateTurn_2_0_1) OR FIREABLE(UpdateTurn_1_0_1) OR FIREABLE(UpdateTurn_1_1_1) OR FIREABLE(UpdateTurn_0_1_1) OR FIREABLE(UpdateTurn_1_2_0) OR FIREABLE(UpdateTurn_0_2_0) OR FIREABLE(UpdateTurn_0_0_1) OR FIREABLE(UpdateTurn_2_2_0)) OR NOT(E (X (A (F ((FIREABLE(ContinueLoop_2_1_0) OR FIREABLE(ContinueLoop_0_2_0) OR FIREABLE(ContinueLoop_1_2_0) OR FIREABLE(ContinueLoop_2_2_0) OR FIREABLE(ContinueLoop_0_0_1) OR FIREABLE(ContinueLoop_1_0_1) OR FIREABLE(ContinueLoop_2_0_1) OR FIREABLE(ContinueLoop_0_1_1) OR FIREABLE(ContinueLoop_0_0_0) OR FIREABLE(ContinueLoop_1_0_0) OR FIREABLE(ContinueLoop_2_0_0) OR FIREABLE(ContinueLoop_0_1_0) OR FIREABLE(ContinueLoop_1_1_0) OR FIREABLE(ContinueLoop_1_2_1) OR FIREABLE(ContinueLoop_0_2_1) OR FIREABLE(ContinueLoop_2_1_1) OR FIREABLE(ContinueLoop_1_1_1) OR FIREABLE(ContinueLoop_2_2_1)))))))) : (FIREABLE(BecomeIdle_0) OR A (((NOT FIREABLE(UpdateTurn_2_2_1) OR NOT FIREABLE(ContinueLoop_0_2_1)) U E (F (FIREABLE(Loop_2_1_1)))))) : E (F ((FIREABLE(Alone1_1_2_0) AND FIREABLE(Loop_1_0_0)))) : ((((NOT FIREABLE(Alone1_1_0_0) OR NOT FIREABLE(Loop_0_0_1) OR (NOT FIREABLE(UpdateTurn_0_0_0) AND NOT FIREABLE(NoIdentity_2_1_0))) AND (FIREABLE(TurnEqual_0_1) OR NOT FIREABLE(Identity_2_0))) OR ((((FIREABLE(TurnDiff_0_2_1) OR FIREABLE(ContinueLoop_0_1_0)) AND NOT FIREABLE(Ask_2)) OR FIREABLE(UpdateTurn_2_2_1)) AND NOT(A (F (FIREABLE(UpdateTurn_1_2_0)))))) AND (E ((NOT FIREABLE(Loop_2_0_0) U FIREABLE(Alone1_0_2_1))) AND NOT((E (X (FIREABLE(NoIdentity_2_0_0))) AND E (X (FIREABLE(Loop_1_1_1))))))) : (FIREABLE(ContinueLoop_1_2_0) OR (NOT(A ((FIREABLE(NotAlone_1_2_1) U FIREABLE(Identity_0_0)))) AND E ((NOT FIREABLE(TurnDiff_1_0_1) U (FIREABLE(TurnDiff_0_1_1) AND FIREABLE(UpdateTurn_1_0_1)))))) : NOT(E (F ((A (G (FIREABLE(NotAlone_1_0_1))) OR (FIREABLE(Identity_2_1) OR FIREABLE(Alone1_0_2_1)))))) : A (G (E (F (FIREABLE(NotAlone_2_1_0))))) : (FIREABLE(Loop_0_0_1) AND (FIREABLE(Loop_2_0_1) OR FIREABLE(Ask_2))) : ((FIREABLE(NotAlone_0_2_0) OR FIREABLE(EndLoop_2_0)) AND (E (F (A (G (FIREABLE(Loop_2_0_1))))) OR ((FIREABLE(TurnDiff_2_1_0) OR FIREABLE(Alone1_1_2_1)) OR A ((FIREABLE(NotAlone_1_2_0) U FIREABLE(TurnEqual_0_0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:440
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:452
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:315
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k: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:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(Loop_0_0_1) AND (FIREABLE(Loop_2_0_1) OR FIREABLE(Ask_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(Loop_0_0_1) AND (FIREABLE(Loop_2_0_1) OR FIREABLE(Ask_2)))
lola: processed formula length: 69
lola: 33 rewrites
lola: closed formula file Peterson-PT-2-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: ========================================

FORMULA Peterson-PT-2-CTLFireability-14 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: ((FIREABLE(UpdateTurn_0_0_0) OR FIREABLE(UpdateTurn_1_0_0) OR FIREABLE(UpdateTurn_1_1_0) OR FIREABLE(UpdateTurn_2_1_0) OR FIREABLE(UpdateTurn_2_0_0) OR FIREABLE(UpdateTurn_0_1_0) OR FIREABLE(UpdateTurn_0_2_1) OR FIREABLE(UpdateTurn_2_1_1) OR FIREABLE(UpdateTurn_2_2_1) OR FIREABLE(UpdateTurn_1_2_1) OR FIREABLE(UpdateTurn_2_0_1) OR FIREABLE(UpdateTurn_1_0_1) OR FIREABLE(UpdateTurn_1_1_1)... (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: (FIREABLE(UpdateTurn_0_0_0) OR FIREABLE(UpdateTurn_1_0_0) OR FIREABLE(UpdateTurn_1_1_0) OR FIREABLE(UpdateTurn_2_1_0) OR FIREABLE(UpdateTurn_2_0_0) OR FIREABLE(UpdateTurn_0_1_0) OR FIREABLE(UpdateTurn_0_2_1) OR FIREABLE(UpdateTurn_2_1_1) OR FIREABLE(UpdateTurn_2_2_1) OR FIREABLE(UpdateTurn_1_2_1) OR FIREABLE(UpdateTurn_2_0_1) OR FIREABLE(UpdateTurn_1_0_1) OR FIREABLE(UpdateTurn_1_1_1) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(UpdateTurn_0_0_0) OR FIREABLE(UpdateTurn_1_0_0) OR FIREABLE(UpdateTurn_1_1_0) OR FIREABLE(UpdateTurn_2_1_0) OR FIREABLE(UpdateTurn_2_0_0) OR FIREABLE(UpdateTurn_0_1_0) OR FIREABLE(UpdateTurn_0_2_1) OR FIREABLE(UpdateTurn_2_1_1) OR FIREABLE(UpdateTurn_2_2_1) OR FIREABLE(UpdateTurn_1_2_1) OR FIREABLE(UpdateTurn_2_0_1) OR FIREABLE(UpdateTurn_1_0_1) OR FIREABLE(UpdateTurn_1_1_1) ... (shortened)
lola: processed formula length: 555
lola: 33 rewrites
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((NOT FIREABLE(ContinueLoop_2_1_0) AND NOT FIREABLE(ContinueLoop_0_2_0) AND NOT FIREABLE(ContinueLoop_1_2_0) AND NOT FIREABLE(ContinueLoop_2_2_0) AND NOT FIREABLE(ContinueLoop_0_0_1) AND NOT FIREABLE(ContinueLoop_1_0_1) AND NOT FIREABLE(ContinueLoop_2_0_1) AND NOT FIREABLE(ContinueLoop_0_1_1) AND NOT FIREABLE(ContinueLoop_0_0_0) AND NOT FIREABLE(ContinueLoop_1_0_0) AND NOT FIREABLE(Cont... (shortened)
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:300
lola: processed formula: AX(NOT(A(TRUE U (FIREABLE(ContinueLoop_2_1_0) OR FIREABLE(ContinueLoop_0_2_0) OR FIREABLE(ContinueLoop_1_2_0) OR FIREABLE(ContinueLoop_2_2_0) OR FIREABLE(ContinueLoop_0_0_1) OR FIREABLE(ContinueLoop_1_0_1) OR FIREABLE(ContinueLoop_2_0_1) OR FIREABLE(ContinueLoop_0_1_1) OR FIREABLE(ContinueLoop_0_0_0) OR FIREABLE(ContinueLoop_1_0_0) OR FIREABLE(ContinueLoop_2_0_0) OR FIREABLE(ContinueLoo... (shortened)
lola: processed formula length: 610
lola: 36 rewrites
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 85 markings, 87 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Peterson-PT-2-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((NOT FIREABLE(Alone1_1_0_0) OR NOT FIREABLE(Loop_0_0_1) OR (NOT FIREABLE(UpdateTurn_0_0_0) AND NOT FIREABLE(NoIdentity_2_1_0))) AND (FIREABLE(TurnEqual_0_1) OR NOT FIREABLE(Identity_2_0))) OR ((((FIREABLE(TurnDiff_0_2_1) OR FIREABLE(ContinueLoop_0_1_0)) AND NOT FIREABLE(Ask_2)) OR FIREABLE(UpdateTurn_2_2_1)) AND E (G (NOT FIREABLE(UpdateTurn_1_2_0))))) AND (E ((NOT FIREABLE(Loop_2_0_0) U F... (shortened)
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(Loop_1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(NOT FIREABLE(Loop_1_1_1))
lola: processed formula length: 28
lola: 34 rewrites
lola: closed formula file Peterson-PT-2-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: (((FIREABLE(TurnDiff_0_2_1) OR FIREABLE(ContinueLoop_0_1_0)) AND NOT FIREABLE(Ask_2)) OR FIREABLE(UpdateTurn_2_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((FIREABLE(TurnDiff_0_2_1) OR FIREABLE(ContinueLoop_0_1_0)) AND NOT FIREABLE(Ask_2)) OR FIREABLE(UpdateTurn_2_2_1))
lola: processed formula length: 118
lola: 33 rewrites
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(Alone1_1_0_0) OR NOT FIREABLE(Loop_0_0_1) OR (NOT FIREABLE(UpdateTurn_0_0_0) AND NOT FIREABLE(NoIdentity_2_1_0))) AND (FIREABLE(TurnEqual_0_1) OR NOT FIREABLE(Identity_2_0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NOT FIREABLE(Alone1_1_0_0) OR NOT FIREABLE(Loop_0_0_1) OR (NOT FIREABLE(UpdateTurn_0_0_0) AND NOT FIREABLE(NoIdentity_2_1_0))) AND (FIREABLE(TurnEqual_0_1) OR NOT FIREABLE(Identity_2_0)))
lola: processed formula length: 192
lola: 33 rewrites
lola: closed formula file Peterson-PT-2-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 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(Loop_2_0_0) U FIREABLE(Alone1_0_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((NOT FIREABLE(Loop_2_0_0) U FIREABLE(Alone1_0_2_1)))
lola: processed formula length: 55
lola: 36 rewrites
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: FIREABLE(Alone1_0_2_1)
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-PT-2-CTLFireability-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-PT-2-CTLFireability-5-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 8317 markings, 24853 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.

FORMULA Peterson-PT-2-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((FIREABLE(Alone1_0_2_0) OR FIREABLE(Alone1_2_1_0) OR FIREABLE(Alone1_0_1_0) OR FIREABLE(Alone1_2_0_0) OR FIREABLE(Alone1_1_0_0) OR FIREABLE(Alone1_1_0_1) OR FIREABLE(Alone1_1_2_0) OR FIREABLE(Alone1_0_1_1) OR FIREABLE(Alone1_2_0_1) OR FIREABLE(Alone1_0_2_1) OR FIREABLE(Alone1_2_1_1) OR FIREABLE(Alone1_1_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U AX((FIREABLE(Alone1_0_2_0) OR FIREABLE(Alone1_2_1_0) OR FIREABLE(Alone1_0_1_0) OR FIREABLE(Alone1_2_0_0) OR FIREABLE(Alone1_1_0_0) OR FIREABLE(Alone1_1_0_1) OR FIREABLE(Alone1_1_2_0) OR FIREABLE(Alone1_0_1_1) OR FIREABLE(Alone1_2_0_1) OR FIREABLE(Alone1_0_2_1) OR FIREABLE(Alone1_2_1_1) OR FIREABLE(Alone1_1_2_1))))
lola: processed formula length: 335
lola: 35 rewrites
lola: closed formula file Peterson-PT-2-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: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 20754 markings, 62262 edges

FORMULA Peterson-PT-2-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(Alone1_1_2_0) AND FIREABLE(Loop_1_0_0))))
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(Alone1_1_2_0) AND FIREABLE(Loop_1_0_0))))
lola: processed formula length: 57
lola: 34 rewrites
lola: closed formula file Peterson-PT-2-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(Alone1_1_2_0) AND FIREABLE(Loop_1_0_0))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-PT-2-CTLFireability-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-PT-2-CTLFireability-4-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: 12439 markings, 29963 edges
lola: ========================================

FORMULA Peterson-PT-2-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (FIREABLE(NotAlone_2_1_0)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: FIREABLE(NotAlone_2_1_0)
lola: processed formula length: 24
lola: 34 rewrites
lola: closed formula file Peterson-PT-2-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: 1255 markings, 2722 edges
lola: ========================================

FORMULA Peterson-PT-2-CTLFireability-13 FALSE 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 (G (E (F ((FIREABLE(ProgressTurn_0_0) OR FIREABLE(ProgressTurn_1_0) OR FIREABLE(ProgressTurn_2_0))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: (FIREABLE(ProgressTurn_0_0) OR FIREABLE(ProgressTurn_1_0) OR FIREABLE(ProgressTurn_2_0))
lola: processed formula length: 90
lola: 34 rewrites
lola: closed formula file Peterson-PT-2-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: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 13323 markings, 35379 edges

FORMULA Peterson-PT-2-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1))))
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(NotAlone_0_1_0) AND NOT FIREABLE(NotAlone_2_0_0) AND NOT FIREABLE(NotAlone_0_2_0) AND NOT FIREABLE(NotAlone_2_1_0) AND NOT FIREABLE(NotAlone_1_0_1) AND NOT FIREABLE(NotAlone_1_2_0) AND NOT FIREABLE(NotAlone_0_1_1) AND NOT FIREABLE(NotAlone_2_0_1) AND NOT FIREABLE(NotAlone_1_0_0) AND NOT FIREABLE(NotAlone_2_1_1) AND NOT FIREABLE(NotAlone_0_2_1) AND NOT FIREABLE(NotAlone_1_2_1))
lola: processed formula length: 393
lola: 35 rewrites
lola: closed formula file Peterson-PT-2-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: 507 markings, 594 edges
lola: ========================================

FORMULA Peterson-PT-2-CTLFireability-5 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: A (F ((FIREABLE(NoIdentity_2_0_0) OR FIREABLE(NoIdentity_1_0_0) OR FIREABLE(NoIdentity_2_1_0) OR FIREABLE(NoIdentity_0_1_0) OR FIREABLE(NoIdentity_0_1_1) OR FIREABLE(NoIdentity_2_1_1) OR FIREABLE(NoIdentity_0_2_1) OR FIREABLE(NoIdentity_1_2_1) OR FIREABLE(NoIdentity_0_2_0) OR FIREABLE(NoIdentity_1_2_0) OR FIREABLE(NoIdentity_1_0_1) OR FIREABLE(NoIdentity_2_0_1) OR FIREABLE(NotAlone_0_1... (shortened)
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(NoIdentity_2_0_0) AND NOT FIREABLE(NoIdentity_1_0_0) AND NOT FIREABLE(NoIdentity_2_1_0) AND NOT FIREABLE(NoIdentity_0_1_0) AND NOT FIREABLE(NoIdentity_0_1_1) AND NOT FIREABLE(NoIdentity_2_1_1) AND NOT FIREABLE(NoIdentity_0_2_1) AND NOT FIREABLE(NoIdentity_1_2_1) AND NOT FIREABLE(NoIdentity_0_2_0) AND NOT FIREABLE(NoIdentity_1_2_0) AND NOT FIREABLE(NoIdentity_1_0_1) AND NOT FIREABLE(N... (shortened)
lola: processed formula length: 813
lola: 35 rewrites
lola: closed formula file Peterson-PT-2-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: 294 markings, 367 edges

FORMULA Peterson-PT-2-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(BecomeIdle_0) OR E (F (FIREABLE(Loop_2_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(BecomeIdle_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(BecomeIdle_0)
lola: processed formula length: 22
lola: 33 rewrites
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(Loop_2_1_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(Loop_2_1_1)))
lola: processed formula length: 28
lola: 34 rewrites
lola: closed formula file Peterson-PT-2-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(Loop_2_1_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-PT-2-CTLFireability-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-PT-2-CTLFireability-10-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4793 markings, 11404 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Peterson-PT-2-CTLFireability-8 TRUE 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: (FIREABLE(ContinueLoop_1_2_0) OR (E ((NOT FIREABLE(NotAlone_1_2_1) R NOT FIREABLE(Identity_0_0))) AND E ((NOT FIREABLE(TurnDiff_1_0_1) U (FIREABLE(TurnDiff_0_1_1) AND FIREABLE(UpdateTurn_1_0_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(ContinueLoop_1_2_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(ContinueLoop_1_2_0)
lola: processed formula length: 28
lola: 33 rewrites
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(NotAlone_1_2_1) R NOT FIREABLE(Identity_0_0)))
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(NotAlone_1_2_1) R NOT FIREABLE(Identity_0_0)))
lola: processed formula length: 63
lola: 35 rewrites
lola: closed formula file Peterson-PT-2-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: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((NOT FIREABLE(TurnDiff_1_0_1) U (FIREABLE(TurnDiff_0_1_1) AND FIREABLE(UpdateTurn_1_0_1))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((NOT FIREABLE(TurnDiff_1_0_1) U (FIREABLE(TurnDiff_0_1_1) AND FIREABLE(UpdateTurn_1_0_1))))
lola: processed formula length: 94
lola: 36 rewrites
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (FIREABLE(TurnDiff_0_1_1) AND FIREABLE(UpdateTurn_1_0_1))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-PT-2-CTLFireability-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-PT-2-CTLFireability-12-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 20726 markings, 62118 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Peterson-PT-2-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: solution impossible
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1)) OR E (F (A (G (((FIREABLE(ProgressTurn_0_0) OR FIREA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1))
lola: processed formula length: 345
lola: 33 rewrites
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((FIREABLE(ProgressTurn_0_0) OR FIREABLE(ProgressTurn_1_0) OR FIREABLE(ProgressTurn_2_0)) AND (FIREABLE(ProgressTurn_0_0) OR FIREABLE(ProgressTurn_1_0) OR FIREABLE(ProgressTurn_2_0)))))))
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(ProgressTurn_0_0) AND NOT FIREABLE(ProgressTurn_1_0) AND NOT FIREABLE(ProgressTurn_2_0)) OR (NOT FIREABLE(ProgressTurn_0_0) AND NOT FIREABLE(ProgressTurn_1_0) AND NOT FIREABLE(ProgressTurn_2_0)))
lola: processed formula length: 211
lola: 35 rewrites
lola: closed formula file Peterson-PT-2-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: 20709 markings, 58335 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Peterson-PT-2-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G ((FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1)))))) OR (FIREABLE(Alone1_0_2_0) OR FIREAB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(Alone1_0_2_0) OR FIREABLE(Alone1_2_1_0) OR FIREABLE(Alone1_0_1_0) OR FIREABLE(Alone1_2_0_0) OR FIREABLE(Alone1_1_0_0) OR FIREABLE(Alone1_1_0_1) OR FIREABLE(Alone1_1_2_0) OR FIREABLE(Alone1_0_1_1) OR FIREABLE(Alone1_2_0_1) OR FIREABLE(Alone1_0_2_1) OR FIREABLE(Alone1_2_1_1) OR FIREABLE(Alone1_1_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(Alone1_0_2_0) OR FIREABLE(Alone1_2_1_0) OR FIREABLE(Alone1_0_1_0) OR FIREABLE(Alone1_2_0_0) OR FIREABLE(Alone1_1_0_0) OR FIREABLE(Alone1_1_0_1) OR FIREABLE(Alone1_1_2_0) OR FIREABLE(Alone1_0_1_1) OR FIREABLE(Alone1_2_0_1) OR FIREABLE(Alone1_0_2_1) OR FIREABLE(Alone1_2_1_1) OR FIREABLE(Alone1_1_2_1))
lola: processed formula length: 321
lola: 33 rewrites
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((FIREABLE(NotAlone_0_1_0) OR FIREABLE(NotAlone_2_0_0) OR FIREABLE(NotAlone_0_2_0) OR FIREABLE(NotAlone_2_1_0) OR FIREABLE(NotAlone_1_0_1) OR FIREABLE(NotAlone_1_2_0) OR FIREABLE(NotAlone_0_1_1) OR FIREABLE(NotAlone_2_0_1) OR FIREABLE(NotAlone_1_0_0) OR FIREABLE(NotAlone_2_1_1) OR FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1))))))
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(NotAlone_0_1_0) AND NOT FIREABLE(NotAlone_2_0_0) AND NOT FIREABLE(NotAlone_0_2_0) AND NOT FIREABLE(NotAlone_2_1_0) AND NOT FIREABLE(NotAlone_1_0_1) AND NOT FIREABLE(NotAlone_1_2_0) AND NOT FIREABLE(NotAlone_0_1_1) AND NOT FIREABLE(NotAlone_2_0_1) AND NOT FIREABLE(NotAlone_1_0_0) AND NOT FIREABLE(NotAlone_2_1_1) AND NOT FIREABLE(NotAlone_0_2_1) AND NOT FIREABLE(NotAlone_1_2_1))
lola: processed formula length: 393
lola: 35 rewrites
lola: closed formula file Peterson-PT-2-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: 20754 markings, 59604 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

FORMULA Peterson-PT-2-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F (NOT FIREABLE(NotAlone_1_0_1))))) AND A (G ((NOT FIREABLE(Identity_2_1) AND NOT FIREABLE(Alone1_0_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(Identity_2_1) AND NOT FIREABLE(Alone1_0_2_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:695
lola: processed formula: A (G ((NOT FIREABLE(Identity_2_1) AND NOT FIREABLE(Alone1_0_2_1))))
lola: processed formula length: 67
lola: 35 rewrites
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: (FIREABLE(Identity_2_1) OR FIREABLE(Alone1_0_2_1))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Peterson-PT-2-CTLFireability-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Peterson-PT-2-CTLFireability-13-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5325 markings, 12958 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Peterson-PT-2-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(NotAlone_0_2_0) OR FIREABLE(EndLoop_2_0)) AND (E (F (A (G (FIREABLE(Loop_2_0_1))))) OR ((FIREABLE(TurnDiff_2_1_0) OR FIREABLE(Alone1_1_2_1)) OR A ((FIREABLE(NotAlone_1_2_0) U FIREABLE(TurnEqual_0_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(Loop_2_0_1)))))
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(Loop_2_0_1)
lola: processed formula length: 24
lola: 35 rewrites
lola: closed formula file Peterson-PT-2-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: 20520 markings, 61534 edges
lola: ========================================
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(NotAlone_0_2_0) OR FIREABLE(EndLoop_2_0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(NotAlone_0_2_0) OR FIREABLE(EndLoop_2_0))
lola: processed formula length: 52
lola: 33 rewrites
lola: closed formula file Peterson-PT-2-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Peterson-PT-2-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0)))))) AND E (F ((A (G ((FIREABLE(TurnDiff_1_0_1) OR FIREABLE(TurnDiff_1_2_0) OR FIREABLE(TurnDiff_0_2_0) OR FIREABLE(TurnDiff_2_1_0) OR FIREABLE(TurnDiff_0_2_1) OR FIREABLE(TurnDiff_2_1_1) OR FIREABLE(TurnDiff_0_1_1) OR FIREABLE(TurnDiff_2_0_1) OR FIREABLE(TurnDiff_0_1_0) OR FIREABLE(TurnDiff_2_0_0) OR FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0))
lola: processed formula length: 72
lola: 34 rewrites
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 95 markings, 105 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (E (G (E (F ((FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0)))))) AND E (F ((A (G ((FIREABLE(TurnDiff_1_0_1) OR FIREABLE(TurnDiff_1_2_0) OR FIREABLE(TurnDiff_0_2_0) OR FIREABLE(TurnDiff_2_1_0) OR FIREABLE(TurnDiff_0_2_1) OR FIREABLE(TurnDiff_2_1_1) OR FIREABLE(TurnDiff_0_1_1) OR FIREABLE(TurnDiff_2_0_1) OR FIREABLE(TurnDiff_0_1_0) OR FIREABLE(TurnDiff_2_0_0) OR FI... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (FIREABLE(AccessCS_2) OR FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0))
lola: processed formula length: 72
lola: 34 rewrites
lola: closed formula file Peterson-PT-2-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 95 markings, 105 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((FIREABLE(TurnDiff_1_0_1) OR FIREABLE(TurnDiff_1_2_0) OR FIREABLE(TurnDiff_0_2_0) OR FIREABLE(TurnDiff_2_1_0) OR FIREABLE(TurnDiff_0_2_1) OR FIREABLE(TurnDiff_2_1_1) OR FIREABLE(TurnDiff_0_1_1) OR FIREABLE(TurnDiff_2_0_1) OR FIREABLE(TurnDiff_0_1_0) OR FIREABLE(TurnDiff_2_0_0) OR FIREABLE(TurnDiff_1_0_0) OR FIREABLE(TurnDiff_1_2_1)))) AND (NOT FIREABLE(AccessCS_2) AND NOT F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(TRUE U (NOT(E(TRUE U (NOT FIREABLE(TurnDiff_1_0_1) AND NOT FIREABLE(TurnDiff_1_2_0) AND NOT FIREABLE(TurnDiff_0_2_0) AND NOT FIREABLE(TurnDiff_2_1_0) AND NOT FIREABLE(TurnDiff_0_2_1) AND NOT FIREABLE(TurnDiff_2_1_1) AND NOT FIREABLE(TurnDiff_0_1_1) AND NOT FIREABLE(TurnDiff_2_0_1) AND NOT FIREABLE(TurnDiff_0_1_0) AND NOT FIREABLE(TurnDiff_2_0_0) AND NOT FIREABLE(TurnDiff_1_0_0) AND NOT FIREABLE(... (shortened)
lola: processed formula length: 881
lola: 36 rewrites
lola: closed formula file Peterson-PT-2-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: 20754 markings, 82540 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Peterson-PT-2-CTLFireability-1 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 yes yes no yes no no no no no
lola:
preliminary result: yes no no no no no no yes yes no yes no no no no no
lola: memory consumption: 14824 KB
lola: time consumption: 2 seconds

BK_STOP 1527043842076

--------------------
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="Peterson-PT-2"
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/Peterson-PT-2.tgz
mv Peterson-PT-2 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 Peterson-PT-2, 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 r112-csrt-152666469700557"
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 ;