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 688K
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 11K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 41K 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 21K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.8K 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 248K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Peterson-PT-3, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r256-csrt-152732582900162
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527437148639

info: Time: 3600 - MCC
===========================================================================================
prep: translating Peterson-PT-3 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-3 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ Peterson-PT-3 @ 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: 576/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 244
lola: finding significant places
lola: 244 places, 332 transitions, 229 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 504 transition conflict sets
lola: TASK
lola: reading formula from Peterson-PT-3-LTLFireability.task
lola: A ((FIREABLE(Ask_3) OR FIREABLE(Ask_1) OR FIREABLE(Ask_2) OR FIREABLE(Ask_0))) : A (((FIREABLE(Identity_0_0) OR FIREABLE(Identity_3_1) OR FIREABLE(Identity_0_2) OR FIREABLE(Identity_1_1) OR FIREABLE(Identity_2_1) OR FIREABLE(Identity_3_0) OR FIREABLE(Identity_0_1) OR FIREABLE(Identity_1_0) OR FIREABLE(Identity_2_0) OR FIREABLE(Identity_3_2) OR FIREABLE(Identity_2_2) OR FIREABLE(Identity_1_2)) U X (((FIREABLE(Identity_0_0) OR FIREABLE(Identity_3_1) OR FIREABLE(Identity_0_2) OR FIREABLE(Identity_1_1) OR FIREABLE(Identity_2_1) OR FIREABLE(Identity_3_0) OR FIREABLE(Identity_0_1) OR FIREABLE(Identity_1_0) OR FIREABLE(Identity_2_0) OR FIREABLE(Identity_3_2) OR FIREABLE(Identity_2_2) OR FIREABLE(Identity_1_2)) U (FIREABLE(Loop_0_1_1) OR FIREABLE(Loop_3_0_1) OR FIREABLE(Loop_2_0_1) OR FIREABLE(Loop_1_0_1) OR FIREABLE(Loop_0_2_1) OR FIREABLE(Loop_3_1_1) OR FIREABLE(Loop_2_1_1) OR FIREABLE(Loop_1_1_1) OR FIREABLE(Loop_0_0_2) OR FIREABLE(Loop_3_2_1) OR FIREABLE(Loop_2_2_1) OR FIREABLE(Loop_1_2_1) OR FIREABLE(Loop_0_1_2) OR FIREABLE(Loop_3_0_2) OR FIREABLE(Loop_2_0_2) OR FIREABLE(Loop_1_0_2) OR FIREABLE(Loop_0_0_0) OR FIREABLE(Loop_3_0_0) OR FIREABLE(Loop_0_1_0) OR FIREABLE(Loop_1_0_0) OR FIREABLE(Loop_2_0_0) OR FIREABLE(Loop_3_1_0) OR FIREABLE(Loop_0_2_0) OR FIREABLE(Loop_1_1_0) OR FIREABLE(Loop_2_1_0) OR FIREABLE(Loop_3_2_0) OR FIREABLE(Loop_0_0_1) OR FIREABLE(Loop_1_2_0) OR FIREABLE(Loop_2_2_0) OR FIREABLE(Loop_1_1_2) OR FIREABLE(Loop_2_1_2) OR FIREABLE(Loop_3_1_2) OR FIREABLE(Loop_0_2_2) OR FIREABLE(Loop_1_2_2) OR FIREABLE(Loop_2_2_2) OR FIREABLE(Loop_3_2_2)))))) : A (F (F ((FIREABLE(NoIdentity_2_3_2) OR FIREABLE(NoIdentity_0_3_2) OR FIREABLE(NoIdentity_1_3_2) OR FIREABLE(NoIdentity_1_2_2) OR FIREABLE(NoIdentity_3_2_2) OR FIREABLE(NoIdentity_3_1_2) OR FIREABLE(NoIdentity_0_2_2) OR FIREABLE(NoIdentity_2_0_0) OR FIREABLE(NoIdentity_3_0_0) OR FIREABLE(NoIdentity_0_1_0) OR FIREABLE(NoIdentity_2_1_0) OR FIREABLE(NoIdentity_1_0_0) OR FIREABLE(NoIdentity_0_3_0) OR FIREABLE(NoIdentity_1_3_0) OR FIREABLE(NoIdentity_2_3_0) OR FIREABLE(NoIdentity_1_0_1) OR FIREABLE(NoIdentity_3_1_0) OR FIREABLE(NoIdentity_0_2_0) OR FIREABLE(NoIdentity_1_2_0) OR FIREABLE(NoIdentity_3_2_0) OR FIREABLE(NoIdentity_0_2_1) OR FIREABLE(NoIdentity_3_1_1) OR FIREABLE(NoIdentity_3_2_1) OR FIREABLE(NoIdentity_1_2_1) OR FIREABLE(NoIdentity_3_0_1) OR FIREABLE(NoIdentity_2_0_1) OR FIREABLE(NoIdentity_2_1_1) OR FIREABLE(NoIdentity_0_1_1) OR FIREABLE(NoIdentity_3_0_2) OR FIREABLE(NoIdentity_2_0_2) OR FIREABLE(NoIdentity_2_1_2) OR FIREABLE(NoIdentity_0_1_2) OR FIREABLE(NoIdentity_1_3_1) OR FIREABLE(NoIdentity_0_3_1) OR FIREABLE(NoIdentity_1_0_2) OR FIREABLE(NoIdentity_2_3_1))))) : A (F (G (G (X (F ((FIREABLE(BecomeIdle_0) OR FIREABLE(BecomeIdle_1) OR FIREABLE(BecomeIdle_2) OR FIREABLE(BecomeIdle_3)))))))) : A (G ((((FIREABLE(Loop_0_1_1) OR FIREABLE(Loop_3_0_1) OR FIREABLE(Loop_2_0_1) OR FIREABLE(Loop_1_0_1) OR FIREABLE(Loop_0_2_1) OR FIREABLE(Loop_3_1_1) OR FIREABLE(Loop_2_1_1) OR FIREABLE(Loop_1_1_1) OR FIREABLE(Loop_0_0_2) OR FIREABLE(Loop_3_2_1) OR FIREABLE(Loop_2_2_1) OR FIREABLE(Loop_1_2_1) OR FIREABLE(Loop_0_1_2) OR FIREABLE(Loop_3_0_2) OR FIREABLE(Loop_2_0_2) OR FIREABLE(Loop_1_0_2) OR FIREABLE(Loop_0_0_0) OR FIREABLE(Loop_3_0_0) OR FIREABLE(Loop_0_1_0) OR FIREABLE(Loop_1_0_0) OR FIREABLE(Loop_2_0_0) OR FIREABLE(Loop_3_1_0) OR FIREABLE(Loop_0_2_0) OR FIREABLE(Loop_1_1_0) OR FIREABLE(Loop_2_1_0) OR FIREABLE(Loop_3_2_0) OR FIREABLE(Loop_0_0_1) OR FIREABLE(Loop_1_2_0) OR FIREABLE(Loop_2_2_0) OR FIREABLE(Loop_1_1_2) OR FIREABLE(Loop_2_1_2) OR FIREABLE(Loop_3_1_2) OR FIREABLE(Loop_0_2_2) OR FIREABLE(Loop_1_2_2) OR FIREABLE(Loop_2_2_2) OR FIREABLE(Loop_3_2_2)) U (FIREABLE(TurnEqual_3_2) OR FIREABLE(TurnEqual_2_2) OR FIREABLE(TurnEqual_1_2) OR FIREABLE(TurnEqual_0_2) OR FIREABLE(TurnEqual_3_1) OR FIREABLE(TurnEqual_2_1) OR FIREABLE(TurnEqual_1_1) OR FIREABLE(TurnEqual_0_1) OR FIREABLE(TurnEqual_3_0) OR FIREABLE(TurnEqual_2_0) OR FIREABLE(TurnEqual_1_0) OR FIREABLE(TurnEqual_0_0))) U G ((FIREABLE(ContinueLoop_2_1_0) OR FIREABLE(ContinueLoop_1_1_0) OR FIREABLE(ContinueLoop_0_2_0) OR FIREABLE(ContinueLoop_3_1_0) OR FIREABLE(ContinueLoop_2_0_0) OR FIREABLE(ContinueLoop_1_0_0) OR FIREABLE(ContinueLoop_0_1_0) OR FIREABLE(ContinueLoop_3_0_0) OR FIREABLE(ContinueLoop_2_3_0) OR FIREABLE(ContinueLoop_1_3_0) OR FIREABLE(ContinueLoop_0_0_1) OR FIREABLE(ContinueLoop_3_3_0) OR FIREABLE(ContinueLoop_2_2_0) OR FIREABLE(ContinueLoop_1_2_0) OR FIREABLE(ContinueLoop_0_3_0) OR FIREABLE(ContinueLoop_3_2_0) OR FIREABLE(ContinueLoop_0_0_0) OR FIREABLE(ContinueLoop_3_2_2) OR FIREABLE(ContinueLoop_0_3_2) OR FIREABLE(ContinueLoop_1_2_2) OR FIREABLE(ContinueLoop_2_2_2) OR FIREABLE(ContinueLoop_3_3_2) OR FIREABLE(ContinueLoop_1_3_2) OR FIREABLE(ContinueLoop_2_3_2) OR FIREABLE(ContinueLoop_3_0_2) OR FIREABLE(ContinueLoop_0_1_2) OR FIREABLE(ContinueLoop_1_0_2) OR FIREABLE(ContinueLoop_2_0_2) OR FIREABLE(ContinueLoop_3_1_2) OR FIREABLE(ContinueLoop_0_2_2) OR FIREABLE(ContinueLoop_1_1_2) OR FIREABLE(ContinueLoop_2_1_2) OR FIREABLE(ContinueLoop_0_3_1) OR FIREABLE(ContinueLoop_3_2_1) OR FIREABLE(ContinueLoop_2_2_1) OR FIREABLE(ContinueLoop_1_2_1) OR FIREABLE(ContinueLoop_0_0_2) OR FIREABLE(ContinueLoop_3_3_1) OR FIREABLE(ContinueLoop_2_3_1) OR FIREABLE(ContinueLoop_1_3_1) OR FIREABLE(ContinueLoop_0_1_1) OR FIREABLE(ContinueLoop_3_0_1) OR FIREABLE(ContinueLoop_2_0_1) OR FIREABLE(ContinueLoop_1_0_1) OR FIREABLE(ContinueLoop_0_2_1) OR FIREABLE(ContinueLoop_3_1_1) OR FIREABLE(ContinueLoop_2_1_1) OR FIREABLE(ContinueLoop_1_1_1)))))) : A (X ((G (X ((FIREABLE(TurnDiff_1_0_0) OR FIREABLE(TurnDiff_2_0_2) OR FIREABLE(TurnDiff_3_0_2) OR FIREABLE(TurnDiff_0_1_2) OR FIREABLE(TurnDiff_2_1_2) OR FIREABLE(TurnDiff_3_1_2) OR FIREABLE(TurnDiff_0_2_2) OR FIREABLE(TurnDiff_1_2_2) OR FIREABLE(TurnDiff_3_2_2) OR FIREABLE(TurnDiff_3_1_1) OR FIREABLE(TurnDiff_0_2_1) OR FIREABLE(TurnDiff_1_2_1) OR FIREABLE(TurnDiff_3_2_1) OR FIREABLE(TurnDiff_0_3_1) OR FIREABLE(TurnDiff_1_3_1) OR FIREABLE(TurnDiff_2_3_1) OR FIREABLE(TurnDiff_1_0_2) OR FIREABLE(TurnDiff_1_3_0) OR FIREABLE(TurnDiff_0_3_0) OR FIREABLE(TurnDiff_1_0_1) OR FIREABLE(TurnDiff_2_3_0) OR FIREABLE(TurnDiff_3_0_1) OR FIREABLE(TurnDiff_2_0_1) OR FIREABLE(TurnDiff_2_1_1) OR FIREABLE(TurnDiff_0_1_1) OR FIREABLE(TurnDiff_3_0_0) OR FIREABLE(TurnDiff_2_0_0) OR FIREABLE(TurnDiff_2_1_0) OR FIREABLE(TurnDiff_0_1_0) OR FIREABLE(TurnDiff_0_2_0) OR FIREABLE(TurnDiff_3_1_0) OR FIREABLE(TurnDiff_3_2_0) OR FIREABLE(TurnDiff_1_2_0) OR FIREABLE(TurnDiff_2_3_2) OR FIREABLE(TurnDiff_1_3_2) OR FIREABLE(TurnDiff_0_3_2)))) U X (F ((FIREABLE(TurnEqual_3_2) OR FIREABLE(TurnEqual_2_2) OR FIREABLE(TurnEqual_1_2) OR FIREABLE(TurnEqual_0_2) OR FIREABLE(TurnEqual_3_1) OR FIREABLE(TurnEqual_2_1) OR FIREABLE(TurnEqual_1_1) OR FIREABLE(TurnEqual_0_1) OR FIREABLE(TurnEqual_3_0) OR FIREABLE(TurnEqual_2_0) OR FIREABLE(TurnEqual_1_0) OR FIREABLE(TurnEqual_0_0))))))) : A (F (F (F (X (G ((FIREABLE(Alone1_1_3_0) OR FIREABLE(Alone1_0_3_0) OR FIREABLE(Alone1_1_0_1) OR FIREABLE(Alone1_2_3_0) OR FIREABLE(Alone1_3_0_1) OR FIREABLE(Alone1_2_0_1) OR FIREABLE(Alone1_2_1_1) OR FIREABLE(Alone1_0_1_1) OR FIREABLE(Alone1_0_2_1) OR FIREABLE(Alone1_3_1_1) OR FIREABLE(Alone1_3_2_1) OR FIREABLE(Alone1_1_2_1) OR FIREABLE(Alone1_1_3_1) OR FIREABLE(Alone1_0_3_1) OR FIREABLE(Alone1_1_0_2) OR FIREABLE(Alone1_2_3_1) OR FIREABLE(Alone1_1_0_0) OR FIREABLE(Alone1_2_0_0) OR FIREABLE(Alone1_3_0_0) OR FIREABLE(Alone1_0_1_0) OR FIREABLE(Alone1_2_1_0) OR FIREABLE(Alone1_3_1_0) OR FIREABLE(Alone1_0_2_0) OR FIREABLE(Alone1_1_2_0) OR FIREABLE(Alone1_3_2_0) OR FIREABLE(Alone1_1_2_2) OR FIREABLE(Alone1_3_2_2) OR FIREABLE(Alone1_3_1_2) OR FIREABLE(Alone1_0_2_2) OR FIREABLE(Alone1_0_1_2) OR FIREABLE(Alone1_2_1_2) OR FIREABLE(Alone1_2_0_2) OR FIREABLE(Alone1_3_0_2) OR FIREABLE(Alone1_2_3_2) OR FIREABLE(Alone1_0_3_2) OR FIREABLE(Alone1_1_3_2)))))))) : A (G (X ((F ((FIREABLE(ProgressTurn_0_1) OR FIREABLE(ProgressTurn_3_0) OR FIREABLE(ProgressTurn_2_0) OR FIREABLE(ProgressTurn_1_0) OR FIREABLE(ProgressTurn_0_0) OR FIREABLE(ProgressTurn_3_1) OR FIREABLE(ProgressTurn_2_1) OR FIREABLE(ProgressTurn_1_1))) U G ((FIREABLE(EndLoop_3_1) OR FIREABLE(EndLoop_0_2) OR FIREABLE(EndLoop_1_1) OR FIREABLE(EndLoop_2_1) OR FIREABLE(EndLoop_3_0) OR FIREABLE(EndLoop_0_1) OR FIREABLE(EndLoop_1_0) OR FIREABLE(EndLoop_2_0) OR FIREABLE(EndLoop_0_0) OR FIREABLE(EndLoop_3_2) OR FIREABLE(EndLoop_1_2) OR FIREABLE(EndLoop_2_2))))))) : A ((F (F (X (FIREABLE(NotAlone_0_1_2)))) U F ((FIREABLE(TurnDiff_3_1_2) U FIREABLE(UpdateTurn_3_1_2))))) : A (FIREABLE(ContinueLoop_0_2_2)) : A (F ((X (F (FIREABLE(TurnDiff_1_0_1))) U X (FIREABLE(UpdateTurn_1_2_0))))) : A ((X (F (FIREABLE(NoIdentity_1_3_0))) U FIREABLE(ContinueLoop_1_0_1))) : A (FIREABLE(ContinueLoop_2_0_1)) : A (G (G ((G (FIREABLE(Identity_3_2)) U X (FIREABLE(ContinueLoop_2_2_1)))))) : A (X (G (X (X (F (FIREABLE(ContinueLoop_3_0_1))))))) : A (F ((X (FIREABLE(NotAlone_3_1_0)) U X (FIREABLE(EndLoop_0_0)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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(Ask_3) OR FIREABLE(Ask_1) OR FIREABLE(Ask_2) OR FIREABLE(Ask_0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(Ask_3) OR FIREABLE(Ask_1) OR FIREABLE(Ask_2) OR FIREABLE(Ask_0))
lola: processed formula length: 77
lola: 43 rewrites
lola: closed formula file Peterson-PT-3-LTLFireability.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: ========================================

FORMULA Peterson-PT-3-LTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(ContinueLoop_0_2_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(ContinueLoop_0_2_2)
lola: processed formula length: 28
lola: 43 rewrites
lola: closed formula file Peterson-PT-3-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Peterson-PT-3-LTLFireability-9 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: FIREABLE(ContinueLoop_2_0_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(ContinueLoop_2_0_1)
lola: processed formula length: 28
lola: 43 rewrites
lola: closed formula file Peterson-PT-3-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Peterson-PT-3-LTLFireability-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: (A (F (G ((FIREABLE(EndLoop_3_1) OR FIREABLE(EndLoop_0_2) OR FIREABLE(EndLoop_1_1) OR FIREABLE(EndLoop_2_1) OR FIREABLE(EndLoop_3_0) OR FIREABLE(EndLoop_0_1) OR FIREABLE(EndLoop_1_0) OR FIREABLE(EndLoop_2_0) OR FIREABLE(EndLoop_0_0) OR FIREABLE(EndLoop_3_2) OR FIREABLE(EndLoop_1_2) OR FIREABLE(EndLoop_2_2))))) AND A (X (G ((F ((FIREABLE(ProgressTurn_0_1) OR FIREABLE(ProgressTurn_3_0) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((FIREABLE(EndLoop_3_1) OR FIREABLE(EndLoop_0_2) OR FIREABLE(EndLoop_1_1) OR FIREABLE(EndLoop_2_1) OR FIREABLE(EndLoop_3_0) OR FIREABLE(EndLoop_0_1) OR FIREABLE(EndLoop_1_0) OR FIREABLE(EndLoop_2_0) OR FIREABLE(EndLoop_0_0) OR FIREABLE(EndLoop_3_2) OR FIREABLE(EndLoop_1_2) OR FIREABLE(EndLoop_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(EndLoop_3_1) OR FIREABLE(EndLoop_0_2) OR FIREABLE(EndLoop_1_1) OR FIREABLE(EndLoop_2_1) OR FIREABLE(EndLoop_3_0) OR FIREABLE(EndLoop_0_1) OR FIREABLE(EndLoop_1_0) OR FIREABLE(EndLoop_2_0) OR FIREABLE(EndLoop_0_0) OR FIREABLE(EndLoop_3_2) OR FIREABLE(EndLoop_1_2) OR FIREABLE(EndLoop_2_2)))))
lola: processed formula length: 321
lola: 43 rewrites
lola: closed formula file Peterson-PT-3-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 49 markings, 50 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

FORMULA Peterson-PT-3-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(Identity_0_0) OR FIREABLE(Identity_3_1) OR FIREABLE(Identity_0_2) OR FIREABLE(Identity_1_1) OR FIREABLE(Identity_2_1) OR FIREABLE(Identity_3_0) OR FIREABLE(Identity_0_1) OR FIREABLE(Identity_1_0) OR FIREABLE(Identity_2_0) OR FIREABLE(Identity_3_2) OR FIREABLE(Identity_2_2) OR FIREABLE(Identity_1_2)) U X (((FIREABLE(Identity_0_0) OR FIREABLE(Identity_3_1) OR FIREABLE(Iden... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((FIREABLE(Identity_0_0) OR FIREABLE(Identity_3_1) OR FIREABLE(Identity_0_2) OR FIREABLE(Identity_1_1) OR FIREABLE(Identity_2_1) OR FIREABLE(Identity_3_0) OR FIREABLE(Identity_0_1) OR FIREABLE(Identity_1_0) OR FIREABLE(Identity_2_0) OR FIREABLE(Identity_3_2) OR FIREABLE(Identity_2_2) OR FIREABLE(Identity_1_2)) U X (((FIREABLE(Identity_0_0) OR FIREABLE(Identity_3_1) OR FIREABLE(Iden... (shortened)
lola: processed formula length: 1557
lola: 43 rewrites
lola: closed formula file Peterson-PT-3-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 24 markings, 24 edges
lola: ========================================

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

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

FORMULA Peterson-PT-3-LTLFireability-11 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 (X (X ((F ((FIREABLE(TurnEqual_3_2) OR FIREABLE(TurnEqual_2_2) OR FIREABLE(TurnEqual_1_2) OR FIREABLE(TurnEqual_0_2) OR FIREABLE(TurnEqual_3_1) OR FIREABLE(TurnEqual_2_1) OR FIREABLE(TurnEqual_1_1) OR FIREABLE(TurnEqual_0_1) OR FIREABLE(TurnEqual_3_0) OR FIREABLE(TurnEqual_2_0) OR FIREABLE(TurnEqual_1_0) OR FIREABLE(TurnEqual_0_0))) OR (G ((FIREABLE(TurnDiff_1_0_0) OR FIREABLE(TurnDi... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((F ((FIREABLE(TurnEqual_3_2) OR FIREABLE(TurnEqual_2_2) OR FIREABLE(TurnEqual_1_2) OR FIREABLE(TurnEqual_0_2) OR FIREABLE(TurnEqual_3_1) OR FIREABLE(TurnEqual_2_1) OR FIREABLE(TurnEqual_1_1) OR FIREABLE(TurnEqual_0_1) OR FIREABLE(TurnEqual_3_0) OR FIREABLE(TurnEqual_2_0) OR FIREABLE(TurnEqual_1_0) OR FIREABLE(TurnEqual_0_0))) OR (G ((FIREABLE(TurnDiff_1_0_0) OR FIREABLE(TurnDi... (shortened)
lola: processed formula length: 1744
lola: 43 rewrites
lola: closed formula file Peterson-PT-3-LTLFireability.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 124 markings, 188 edges
lola: ========================================

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

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

FORMULA Peterson-PT-3-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(UpdateTurn_3_1_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(UpdateTurn_3_1_2)
lola: processed formula length: 30
lola: 45 rewrites
lola: closed formula file Peterson-PT-3-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 48 markings, 48 edges
lola: ========================================

FORMULA Peterson-PT-3-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(NoIdentity_2_3_2) OR FIREABLE(NoIdentity_0_3_2) OR FIREABLE(NoIdentity_1_3_2) OR FIREABLE(NoIdentity_1_2_2) OR FIREABLE(NoIdentity_3_2_2) OR FIREABLE(NoIdentity_3_1_2) OR FIREABLE(NoIdentity_0_2_2) OR FIREABLE(NoIdentity_2_0_0) OR FIREABLE(NoIdentity_3_0_0) OR FIREABLE(NoIdentity_0_1_0) OR FIREABLE(NoIdentity_2_1_0) OR FIREABLE(NoIdentity_1_0_0) OR FIREABLE(NoIdentity_0... (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_3_2) AND NOT FIREABLE(NoIdentity_0_3_2) AND NOT FIREABLE(NoIdentity_1_3_2) AND NOT FIREABLE(NoIdentity_1_2_2) AND NOT FIREABLE(NoIdentity_3_2_2) AND NOT FIREABLE(NoIdentity_3_1_2) AND NOT FIREABLE(NoIdentity_0_2_2) AND NOT FIREABLE(NoIdentity_2_0_0) AND NOT FIREABLE(NoIdentity_3_0_0) AND NOT FIREABLE(NoIdentity_0_1_0) AND NOT FIREABLE(NoIdentity_2_1_0) AND NOT FIREABLE(N... (shortened)
lola: processed formula length: 1257
lola: 45 rewrites
lola: closed formula file Peterson-PT-3-LTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2423 markings, 3440 edges
lola: ========================================

FORMULA Peterson-PT-3-LTLFireability-2 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: A (G (F (FIREABLE(ContinueLoop_3_0_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(ContinueLoop_3_0_1))))
lola: processed formula length: 40
lola: 43 rewrites
lola: closed formula file Peterson-PT-3-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 48 markings, 48 edges
lola: ========================================

FORMULA Peterson-PT-3-LTLFireability-14 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 (F ((FIREABLE(BecomeIdle_0) OR FIREABLE(BecomeIdle_1) OR FIREABLE(BecomeIdle_2) OR FIREABLE(BecomeIdle_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((FIREABLE(BecomeIdle_0) OR FIREABLE(BecomeIdle_1) OR FIREABLE(BecomeIdle_2) OR FIREABLE(BecomeIdle_3)))))
lola: processed formula length: 117
lola: 43 rewrites
lola: closed formula file Peterson-PT-3-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 38 markings, 38 edges
lola: ========================================

FORMULA Peterson-PT-3-LTLFireability-3 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: A (F (G ((FIREABLE(Alone1_1_3_0) OR FIREABLE(Alone1_0_3_0) OR FIREABLE(Alone1_1_0_1) OR FIREABLE(Alone1_2_3_0) OR FIREABLE(Alone1_3_0_1) OR FIREABLE(Alone1_2_0_1) OR FIREABLE(Alone1_2_1_1) OR FIREABLE(Alone1_0_1_1) OR FIREABLE(Alone1_0_2_1) OR FIREABLE(Alone1_3_1_1) OR FIREABLE(Alone1_3_2_1) OR FIREABLE(Alone1_1_2_1) OR FIREABLE(Alone1_1_3_1) OR FIREABLE(Alone1_0_3_1) OR FIREABLE(Alo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(Alone1_1_3_0) OR FIREABLE(Alone1_0_3_0) OR FIREABLE(Alone1_1_0_1) OR FIREABLE(Alone1_2_3_0) OR FIREABLE(Alone1_3_0_1) OR FIREABLE(Alone1_2_0_1) OR FIREABLE(Alone1_2_1_1) OR FIREABLE(Alone1_0_1_1) OR FIREABLE(Alone1_0_2_1) OR FIREABLE(Alone1_3_1_1) OR FIREABLE(Alone1_3_2_1) OR FIREABLE(Alone1_1_2_1) OR FIREABLE(Alone1_1_3_1) OR FIREABLE(Alone1_0_3_1) OR FIREABLE(Alo... (shortened)
lola: processed formula length: 981
lola: 43 rewrites
lola: closed formula file Peterson-PT-3-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 31 markings, 32 edges
lola: ========================================

FORMULA Peterson-PT-3-LTLFireability-6 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: (A (F (G ((FIREABLE(ContinueLoop_2_1_0) OR FIREABLE(ContinueLoop_1_1_0) OR FIREABLE(ContinueLoop_0_2_0) OR FIREABLE(ContinueLoop_3_1_0) OR FIREABLE(ContinueLoop_2_0_0) OR FIREABLE(ContinueLoop_1_0_0) OR FIREABLE(ContinueLoop_0_1_0) OR FIREABLE(ContinueLoop_3_0_0) OR FIREABLE(ContinueLoop_2_3_0) OR FIREABLE(ContinueLoop_1_3_0) OR FIREABLE(ContinueLoop_0_0_1) OR FIREABLE(ContinueLoop_3_3_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((FIREABLE(ContinueLoop_2_1_0) OR FIREABLE(ContinueLoop_1_1_0) OR FIREABLE(ContinueLoop_0_2_0) OR FIREABLE(ContinueLoop_3_1_0) OR FIREABLE(ContinueLoop_2_0_0) OR FIREABLE(ContinueLoop_1_0_0) OR FIREABLE(ContinueLoop_0_1_0) OR FIREABLE(ContinueLoop_3_0_0) OR FIREABLE(ContinueLoop_2_3_0) OR FIREABLE(ContinueLoop_1_3_0) OR FIREABLE(ContinueLoop_0_0_1) OR FIREABLE(ContinueLoop_3_3_0... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((FIREABLE(ContinueLoop_2_1_0) OR FIREABLE(ContinueLoop_1_1_0) OR FIREABLE(ContinueLoop_0_2_0) OR FIREABLE(ContinueLoop_3_1_0) OR FIREABLE(ContinueLoop_2_0_0) OR FIREABLE(ContinueLoop_1_0_0) OR FIREABLE(ContinueLoop_0_1_0) OR FIREABLE(ContinueLoop_3_0_0) OR FIREABLE(ContinueLoop_2_3_0) OR FIREABLE(ContinueLoop_1_3_0) OR FIREABLE(ContinueLoop_0_0_1) OR FIREABLE(ContinueLoop_3_3_0... (shortened)
lola: processed formula length: 1593
lola: 43 rewrites
lola: closed formula file Peterson-PT-3-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 226 markings, 300 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Peterson-PT-3-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no no yes no no no no no no no no no no
lola:
preliminary result: yes no no no no yes no no no no no no no no no no
lola: memory consumption: 15072 KB
lola: time consumption: 1 seconds

BK_STOP 1527437149078

--------------------
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-3"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-3.tgz
mv Peterson-PT-3 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-3, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r256-csrt-152732582900162"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;