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 840K
-rw-r--r-- 1 mcc users 8.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 36K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K 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.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 7.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 52K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 29K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K 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 11K 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 317K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is LamportFastMutEx-PT-8, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r256-csrt-152732582700043
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527429912994

info: Time: 3600 - MCC
===========================================================================================
prep: translating LamportFastMutEx-PT-8 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 LamportFastMutEx-PT-8 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ LamportFastMutEx-PT-8 @ 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: 981/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 315
lola: finding significant places
lola: 315 places, 666 transitions, 214 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 947 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-PT-8-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (2 <= x_0 + x_1 + x_2 + x_3 + x_4 + x_5 + x_6 + x_7 + x_8)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4 + P-awaity_5 + P-awaity_6 + P-awaity_7 + P-awaity_8 <= y_0 + y_1 + y_2 + y_3 + y_4 + y_5 + y_6 + y_7 + y_8)
lola: after: (P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4 + P-awaity_5 + P-awaity_6 + P-awaity_7 + P-awaity_8 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4 + P-awaity_5 + P-awaity_6 + P-awaity_7 + P-awaity_8 <= P-b_6_true + P-b_1_true + P-b_5_false + P-b_4_false + P-b_3_false + P-b_2_false + P-b_7_true + P-b_0_false + P-b_8_true + P-b_0_true + P-b_5_true + P-b_2_true + P-b_1_false + P-b_4_true + P-b_6_false + P-b_3_true + P-b_8_false + P-b_7_false)
lola: after: (P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4 + P-awaity_5 + P-awaity_6 + P-awaity_7 + P-awaity_8 <= 8)
lola: LP says that atomic proposition is always true: (P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4 + P-awaity_5 + P-awaity_6 + P-awaity_7 + P-awaity_8 <= 8)
lola: LP says that atomic proposition is always true: (P-done_0_2 <= P-b_0_false)
lola: LP says that atomic proposition is always true: (P-setbi_24_0 <= P-await_13_7)
lola: LP says that atomic proposition is always true: (P-wait_0_2 <= P-wait_4_4)
lola: A (F (G (F (X ((P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + P-setbi_5_3 + P-setbi_5_4 + P-setbi_5_5 + P-setbi_5_6 + P-setbi_5_7 + P-setbi_5_8 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 + P-ifyi_15_5 + P-ifyi_15_6 + P-ifyi_15_7 + P-ifyi_15_8)))))) : A (F (G (((1 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 + P-CS_21_5 + P-CS_21_6 + P-CS_21_7 + P-CS_21_8) U (3 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 + P-ifxi_10_5 + P-ifxi_10_6 + P-ifxi_10_7 + P-ifxi_10_8))))) : A (X (G ((P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4 + P-sety_9_5 + P-sety_9_6 + P-sety_9_7 + P-sety_9_8 <= P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4 + P-await_13_5 + P-await_13_6 + P-await_13_7 + P-await_13_8)))) : A (F ((X (FALSE) U F ((2 <= P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4 + P-awaity_5 + P-awaity_6 + P-awaity_7 + P-awaity_8))))) : A (F (G (G ((P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4 + P-ify0_4_5 + P-ify0_4_6 + P-ify0_4_7 + P-ify0_4_8 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 + P-CS_21_5 + P-CS_21_6 + P-CS_21_7 + P-CS_21_8))))) : A (X (X (F ((P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4 + P-awaity_5 + P-awaity_6 + P-awaity_7 + P-awaity_8 <= 1))))) : A ((X (F ((P-done_6_0 + P-done_6_1 + P-done_6_2 + P-done_6_3 + P-done_6_4 + P-done_6_5 + P-done_6_6 + P-done_6_7 + P-done_6_8 + P-done_7_0 + P-done_7_1 + P-done_7_2 + P-done_7_3 + P-done_7_4 + P-done_7_5 + P-done_7_6 + P-done_7_7 + P-done_7_8 + P-done_8_0 + P-done_8_1 + P-done_8_2 + P-done_8_3 + P-done_8_4 + P-done_8_5 + P-done_8_6 + P-done_8_7 + P-done_8_8 + P-done_0_8 + P-done_0_7 + P-done_0_6 + P-done_0_5 + P-done_0_4 + P-done_0_3 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_1_3 + P-done_1_4 + P-done_1_5 + P-done_1_6 + P-done_1_7 + P-done_1_8 + P-done_0_2 + P-done_0_1 + P-done_0_0 + P-done_2_0 + P-done_2_1 + P-done_2_2 + P-done_2_3 + P-done_2_4 + P-done_2_5 + P-done_2_6 + P-done_2_7 + P-done_2_8 + P-done_3_0 + P-done_3_1 + P-done_3_2 + P-done_3_3 + P-done_3_4 + P-done_3_5 + P-done_3_6 + P-done_3_7 + P-done_3_8 + P-done_4_0 + P-done_4_1 + P-done_4_2 + P-done_4_3 + P-done_4_4 + P-done_4_5 + P-done_4_6 + P-done_4_7 + P-done_4_8 + P-done_5_0 + P-done_5_1 + P-done_5_2 + P-done_5_3 + P-done_5_4 + P-done_5_5 + P-done_5_6 + P-done_5_7 + P-done_5_8 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 + P-ifxi_10_5 + P-ifxi_10_6 + P-ifxi_10_7 + P-ifxi_10_8))) U ((2 <= P-wait_5_8 + P-wait_5_7 + P-wait_5_6 + P-wait_5_5 + P-wait_5_4 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_0_5 + P-wait_0_6 + P-wait_0_7 + P-wait_0_8 + P-wait_5_3 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_1_5 + P-wait_1_6 + P-wait_1_7 + P-wait_1_8 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_2_5 + P-wait_2_6 + P-wait_2_7 + P-wait_2_8 + P-wait_5_2 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_3_5 + P-wait_3_6 + P-wait_3_7 + P-wait_3_8 + P-wait_5_1 + P-wait_5_0 + P-wait_4_8 + P-wait_4_7 + P-wait_4_6 + P-wait_4_5 + P-wait_4_4 + P-wait_4_3 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_6_0 + P-wait_6_1 + P-wait_6_2 + P-wait_6_3 + P-wait_6_4 + P-wait_6_5 + P-wait_6_6 + P-wait_6_7 + P-wait_6_8 + P-wait_7_0 + P-wait_7_1 + P-wait_7_2 + P-wait_7_3 + P-wait_7_4 + P-wait_7_5 + P-wait_7_6 + P-wait_7_7 + P-wait_7_8 + P-wait_8_0 + P-wait_8_1 + P-wait_8_2 + P-wait_8_3 + P-wait_8_4 + P-wait_8_5 + P-wait_8_6 + P-wait_8_7 + P-wait_8_8) U (P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4 + P-await_13_5 + P-await_13_6 + P-await_13_7 + P-await_13_8 <= P-setx_3_0 + P-setx_3_1 + P-setx_3_2 + P-setx_3_3 + P-setx_3_4 + P-setx_3_5 + P-setx_3_6 + P-setx_3_7 + P-setx_3_8)))) : A ((X (F ((P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4 + P-setbi_24_5 + P-setbi_24_6 + P-setbi_24_7 + P-setbi_24_8 <= P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4 + P-awaity_5 + P-awaity_6 + P-awaity_7 + P-awaity_8))) U (TRUE U (P-done_6_0 + P-done_6_1 + P-done_6_2 + P-done_6_3 + P-done_6_4 + P-done_6_5 + P-done_6_6 + P-done_6_7 + P-done_6_8 + P-done_7_0 + P-done_7_1 + P-done_7_2 + P-done_7_3 + P-done_7_4 + P-done_7_5 + P-done_7_6 + P-done_7_7 + P-done_7_8 + P-done_8_0 + P-done_8_1 + P-done_8_2 + P-done_8_3 + P-done_8_4 + P-done_8_5 + P-done_8_6 + P-done_8_7 + P-done_8_8 + P-done_0_8 + P-done_0_7 + P-done_0_6 + P-done_0_5 + P-done_0_4 + P-done_0_3 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_1_3 + P-done_1_4 + P-done_1_5 + P-done_1_6 + P-done_1_7 + P-done_1_8 + P-done_0_2 + P-done_0_1 + P-done_0_0 + P-done_2_0 + P-done_2_1 + P-done_2_2 + P-done_2_3 + P-done_2_4 + P-done_2_5 + P-done_2_6 + P-done_2_7 + P-done_2_8 + P-done_3_0 + P-done_3_1 + P-done_3_2 + P-done_3_3 + P-done_3_4 + P-done_3_5 + P-done_3_6 + P-done_3_7 + P-done_3_8 + P-done_4_0 + P-done_4_1 + P-done_4_2 + P-done_4_3 + P-done_4_4 + P-done_4_5 + P-done_4_6 + P-done_4_7 + P-done_4_8 + P-done_5_0 + P-done_5_1 + P-done_5_2 + P-done_5_3 + P-done_5_4 + P-done_5_5 + P-done_5_6 + P-done_5_7 + P-done_5_8 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 + P-CS_21_5 + P-CS_21_6 + P-CS_21_7 + P-CS_21_8)))) : A ((P-done_4_4 <= P-start_1_2)) : A (X ((P-b_4_false <= y_5))) : A (G (F (TRUE))) : A (G (F (TRUE))) : A (F (F (((P-setbi_11_1 <= P-wait_3_0) U TRUE)))) : A (X (F (X (F ((P-setx_3_4 <= P-setx_3_5)))))) : A (X (((P-wait_3_8 <= P-wait_5_0) U X ((P-done_7_4 <= P-wait_5_2))))) : A ((P-wait_8_8 <= P-setbi_24_2))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (P-done_4_4 <= P-start_1_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-done_4_4 <= P-start_1_2)
lola: processed formula length: 27
lola: 31 rewrites
lola: closed formula file LamportFastMutEx-PT-8-LTLCardinality.task
lola: processed formula with 1 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 LamportFastMutEx-PT-8-LTLCardinality-8 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 31 rewrites
lola: closed formula file LamportFastMutEx-PT-8-LTLCardinality.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 LamportFastMutEx-PT-8-LTLCardinality-10 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 31 rewrites
lola: closed formula file LamportFastMutEx-PT-8-LTLCardinality.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 LamportFastMutEx-PT-8-LTLCardinality-11 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 31 rewrites
lola: closed formula file LamportFastMutEx-PT-8-LTLCardinality.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 LamportFastMutEx-PT-8-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (P-wait_8_8 <= P-setbi_24_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-wait_8_8 <= P-setbi_24_2)
lola: processed formula length: 28
lola: 31 rewrites
lola: closed formula file LamportFastMutEx-PT-8-LTLCardinality.task
lola: processed formula with 1 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 LamportFastMutEx-PT-8-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4 + P-awaity_5 + P-awaity_6 + P-awaity_7 + P-awaity_8 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4 + P-awaity_5 + P-awaity_6 + P-awaity_7 + P-awaity_8 <= 1)))))
lola: processed formula length: 137
lola: 31 rewrites
lola: closed formula file LamportFastMutEx-PT-8-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 45 markings, 72 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-8-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((P-done_6_0 + P-done_6_1 + P-done_6_2 + P-done_6_3 + P-done_6_4 + P-done_6_5 + P-done_6_6 + P-done_6_7 + P-done_6_8 + P-done_7_0 + P-done_7_1 + P-done_7_2 + P-done_7_3 + P-done_7_4 + P-done_7_5 + P-done_7_6 + P-done_7_7 + P-done_7_8 + P-done_8_0 + P-done_8_1 + P-done_8_2 + P-done_8_3 + P-done_8_4 + P-done_8_5 + P-done_8_6 + P-done_8_7 + P-done_8_8 + P-done_0_8 + P-done_0_7 + P-done_0_6 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((P-done_6_0 + P-done_6_1 + P-done_6_2 + P-done_6_3 + P-done_6_4 + P-done_6_5 + P-done_6_6 + P-done_6_7 + P-done_6_8 + P-done_7_0 + P-done_7_1 + P-done_7_2 + P-done_7_3 + P-done_7_4 + P-done_7_5 + P-done_7_6 + P-done_7_7 + P-done_7_8 + P-done_8_0 + P-done_8_1 + P-done_8_2 + P-done_8_3 + P-done_8_4 + P-done_8_5 + P-done_8_6 + P-done_8_7 + P-done_8_8 + P-done_0_8 + P-done_0_7 + P-done_0_6 +... (shortened)
lola: processed formula length: 2510
lola: 31 rewrites
lola: closed formula file LamportFastMutEx-PT-8-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-8-LTLCardinality-6 TRUE 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 (G ((P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4 + P-sety_9_5 + P-sety_9_6 + P-sety_9_7 + P-sety_9_8 <= P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4 + P-await_13_5 + P-await_13_6 + P-await_13_7 + P-await_13_8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4 + P-sety_9_5 + P-sety_9_6 + P-sety_9_7 + P-sety_9_8 <= P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4 + P-await_13_5 + P-await_13_6 + P-await_13_7 + P-await_13_8))))
lola: processed formula length: 264
lola: 31 rewrites
lola: closed formula file LamportFastMutEx-PT-8-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 26 markings, 26 edges
lola: ========================================

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

FORMULA LamportFastMutEx-PT-8-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((P-wait_3_8 <= P-wait_5_0) U X ((P-done_7_4 <= P-wait_5_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((P-wait_3_8 <= P-wait_5_0) U X ((P-done_7_4 <= P-wait_5_2)))))
lola: processed formula length: 69
lola: 31 rewrites
lola: closed formula file LamportFastMutEx-PT-8-LTLCardinality.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: 45 markings, 72 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-8-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((P-b_4_false <= y_5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((P-b_4_false <= y_5)))
lola: processed formula length: 28
lola: 31 rewrites
lola: closed formula file LamportFastMutEx-PT-8-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 27 markings, 27 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-8-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4 + P-awaity_5 + P-awaity_6 + P-awaity_7 + P-awaity_8)))
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: (P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4 + P-awaity_5 + P-awaity_6 + P-awaity_7 + P-awaity_8 <= 1)
lola: processed formula length: 121
lola: 33 rewrites
lola: closed formula file LamportFastMutEx-PT-8-LTLCardinality.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: 70670 markings, 272553 edges, 14134 markings/sec, 0 secs
lola: 140242 markings, 568810 edges, 13914 markings/sec, 5 secs
lola: 203157 markings, 861363 edges, 12583 markings/sec, 10 secs
lola: 267232 markings, 1164395 edges, 12815 markings/sec, 15 secs
lola: 334183 markings, 1466659 edges, 13390 markings/sec, 20 secs
lola: 399904 markings, 1779591 edges, 13144 markings/sec, 25 secs
lola: 463583 markings, 2101785 edges, 12736 markings/sec, 30 secs
lola: 525248 markings, 2396015 edges, 12333 markings/sec, 35 secs
lola: 585716 markings, 2708244 edges, 12094 markings/sec, 40 secs
lola: 642177 markings, 3022973 edges, 11292 markings/sec, 45 secs
lola: 699318 markings, 3319501 edges, 11428 markings/sec, 50 secs
lola: 757132 markings, 3639137 edges, 11563 markings/sec, 55 secs
lola: 805864 markings, 3900559 edges, 9746 markings/sec, 60 secs
lola: 867458 markings, 4192006 edges, 12319 markings/sec, 65 secs
lola: 935817 markings, 4527860 edges, 13672 markings/sec, 70 secs
lola: 1005500 markings, 4854037 edges, 13937 markings/sec, 75 secs
lola: 1072281 markings, 5193976 edges, 13356 markings/sec, 80 secs
lola: 1142163 markings, 5536076 edges, 13976 markings/sec, 85 secs
lola: 1212685 markings, 5888220 edges, 14104 markings/sec, 90 secs
lola: 1281244 markings, 6238578 edges, 13712 markings/sec, 95 secs
lola: 1348517 markings, 6591275 edges, 13455 markings/sec, 100 secs
lola: 1413008 markings, 6951022 edges, 12898 markings/sec, 105 secs
lola: 1470353 markings, 7253711 edges, 11469 markings/sec, 110 secs
lola: 1522056 markings, 7543858 edges, 10341 markings/sec, 115 secs
lola: 1578168 markings, 7865213 edges, 11222 markings/sec, 120 secs
lola: 1632106 markings, 8177785 edges, 10788 markings/sec, 125 secs
lola: 1686907 markings, 8495545 edges, 10960 markings/sec, 130 secs
lola: 1742333 markings, 8823517 edges, 11085 markings/sec, 135 secs
lola: 1800273 markings, 9178211 edges, 11588 markings/sec, 140 secs
lola: 1859950 markings, 9491541 edges, 11935 markings/sec, 145 secs
lola: 1924437 markings, 9804004 edges, 12897 markings/sec, 150 secs
lola: 1981820 markings, 10112910 edges, 11477 markings/sec, 155 secs
lola: 2040424 markings, 10413404 edges, 11721 markings/sec, 160 secs
lola: 2098245 markings, 10724996 edges, 11564 markings/sec, 165 secs
lola: 2154673 markings, 11045664 edges, 11286 markings/sec, 170 secs
lola: 2208716 markings, 11340035 edges, 10809 markings/sec, 175 secs
lola: 2263643 markings, 11645004 edges, 10985 markings/sec, 180 secs
lola: 2321813 markings, 11976455 edges, 11634 markings/sec, 185 secs
lola: 2380251 markings, 12311767 edges, 11688 markings/sec, 190 secs
lola: 2439057 markings, 12645547 edges, 11761 markings/sec, 195 secs
lola: 2497287 markings, 12984801 edges, 11646 markings/sec, 200 secs
lola: 2554194 markings, 13334130 edges, 11381 markings/sec, 205 secs
lola: 2610073 markings, 13659790 edges, 11176 markings/sec, 210 secs
lola: 2656947 markings, 13934277 edges, 9375 markings/sec, 215 secs
lola: 2702725 markings, 14201195 edges, 9156 markings/sec, 220 secs
lola: 2750127 markings, 14497134 edges, 9480 markings/sec, 225 secs
lola: 2800935 markings, 14801491 edges, 10162 markings/sec, 230 secs
lola: 2851875 markings, 15118494 edges, 10188 markings/sec, 235 secs
lola: 2902364 markings, 15439893 edges, 10098 markings/sec, 240 secs
lola: 2952881 markings, 15772111 edges, 10103 markings/sec, 245 secs
lola: 3025996 markings, 16100313 edges, 14623 markings/sec, 250 secs
lola: 3090686 markings, 16411350 edges, 12938 markings/sec, 255 secs
lola: 3155512 markings, 16717044 edges, 12965 markings/sec, 260 secs
lola: 3218978 markings, 17032074 edges, 12693 markings/sec, 265 secs
lola: 3276219 markings, 17338125 edges, 11448 markings/sec, 270 secs
lola: 3331712 markings, 17642596 edges, 11099 markings/sec, 275 secs
lola: 3388728 markings, 17964258 edges, 11403 markings/sec, 280 secs
lola: 3452008 markings, 18287303 edges, 12656 markings/sec, 285 secs
lola: 3512913 markings, 18624853 edges, 12181 markings/sec, 290 secs
lola: 3570846 markings, 18955324 edges, 11587 markings/sec, 295 secs
lola: 3623274 markings, 19256766 edges, 10486 markings/sec, 300 secs
lola: 3681720 markings, 19528530 edges, 11689 markings/sec, 305 secs
lola: 3742537 markings, 19848779 edges, 12163 markings/sec, 310 secs
lola: 3802825 markings, 20197467 edges, 12058 markings/sec, 315 secs
lola: 3863775 markings, 20527013 edges, 12190 markings/sec, 320 secs
lola: 3923401 markings, 20865603 edges, 11925 markings/sec, 325 secs
lola: 3983689 markings, 21218430 edges, 12058 markings/sec, 330 secs
lola: 4044773 markings, 21563342 edges, 12217 markings/sec, 335 secs
lola: 4107123 markings, 21914569 edges, 12470 markings/sec, 340 secs
lola: 4169004 markings, 22275439 edges, 12376 markings/sec, 345 secs
lola: 4229020 markings, 22630783 edges, 12003 markings/sec, 350 secs
lola: 4289321 markings, 22981461 edges, 12060 markings/sec, 355 secs
lola: 4343096 markings, 23307469 edges, 10755 markings/sec, 360 secs
lola: 4395090 markings, 23633711 edges, 10399 markings/sec, 365 secs
lola: 4446827 markings, 23938430 edges, 10347 markings/sec, 370 secs
lola: 4503121 markings, 24241224 edges, 11259 markings/sec, 375 secs
lola: 4557836 markings, 24551187 edges, 10943 markings/sec, 380 secs
lola: 4607721 markings, 24839100 edges, 9977 markings/sec, 385 secs
lola: 4658302 markings, 25142876 edges, 10116 markings/sec, 390 secs
lola: 4710580 markings, 25446124 edges, 10456 markings/sec, 395 secs
lola: 4757883 markings, 25744745 edges, 9461 markings/sec, 400 secs
lola: 4803440 markings, 26023751 edges, 9111 markings/sec, 405 secs
lola: 4851677 markings, 26321124 edges, 9647 markings/sec, 410 secs
lola: 4899079 markings, 26593711 edges, 9480 markings/sec, 415 secs
lola: 4946169 markings, 26885661 edges, 9418 markings/sec, 420 secs
lola: 4994186 markings, 27184622 edges, 9603 markings/sec, 425 secs
lola: 5040498 markings, 27487522 edges, 9262 markings/sec, 430 secs
lola: 5086054 markings, 27773377 edges, 9111 markings/sec, 435 secs
lola: 5132939 markings, 28067826 edges, 9377 markings/sec, 440 secs
lola: 5180121 markings, 28380663 edges, 9436 markings/sec, 445 secs
lola: 5228500 markings, 28697301 edges, 9676 markings/sec, 450 secs
lola: 5291886 markings, 29012027 edges, 12677 markings/sec, 455 secs
lola: 5351637 markings, 29286236 edges, 11950 markings/sec, 460 secs
lola: 5413178 markings, 29578597 edges, 12308 markings/sec, 465 secs
lola: 5477340 markings, 29899842 edges, 12832 markings/sec, 470 secs
lola: 5538307 markings, 30193706 edges, 12193 markings/sec, 475 secs
lola: 5597366 markings, 30482853 edges, 11812 markings/sec, 480 secs
lola: 5656502 markings, 30789268 edges, 11827 markings/sec, 485 secs
lola: 5716521 markings, 31089062 edges, 12004 markings/sec, 490 secs
lola: 5776224 markings, 31394380 edges, 11941 markings/sec, 495 secs
lola: 5838943 markings, 31730874 edges, 12544 markings/sec, 500 secs
lola: 5903904 markings, 32088705 edges, 12992 markings/sec, 505 secs
lola: 5964169 markings, 32407453 edges, 12053 markings/sec, 510 secs
lola: 6020725 markings, 32728239 edges, 11311 markings/sec, 515 secs
lola: 6075522 markings, 33046506 edges, 10959 markings/sec, 520 secs
lola: 6132252 markings, 33369519 edges, 11346 markings/sec, 525 secs
lola: 6189900 markings, 33703042 edges, 11530 markings/sec, 530 secs
lola: 6247510 markings, 34045469 edges, 11522 markings/sec, 535 secs
lola: 6304985 markings, 34404283 edges, 11495 markings/sec, 540 secs
lola: 6370551 markings, 34725170 edges, 13113 markings/sec, 545 secs
lola: 6434713 markings, 35058824 edges, 12832 markings/sec, 550 secs
lola: 6494852 markings, 35395245 edges, 12028 markings/sec, 555 secs
lola: 6557630 markings, 35739119 edges, 12556 markings/sec, 560 secs
lola: 6618064 markings, 36089706 edges, 12087 markings/sec, 565 secs
lola: 6678004 markings, 36433462 edges, 11988 markings/sec, 570 secs
lola: 6737767 markings, 36777981 edges, 11953 markings/sec, 575 secs
lola: 6800990 markings, 37126730 edges, 12645 markings/sec, 580 secs
lola: 6863084 markings, 37483214 edges, 12419 markings/sec, 585 secs
lola: 6922426 markings, 37849917 edges, 11868 markings/sec, 590 secs
lola: 6985094 markings, 38204887 edges, 12534 markings/sec, 595 secs
lola: 7045100 markings, 38567916 edges, 12001 markings/sec, 600 secs
lola: 7104043 markings, 38937695 edges, 11789 markings/sec, 605 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 7124989 markings, 39084443 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-8-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 739 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((P-done_6_0 + P-done_6_1 + P-done_6_2 + P-done_6_3 + P-done_6_4 + P-done_6_5 + P-done_6_6 + P-done_6_7 + P-done_6_8 + P-done_7_0 + P-done_7_1 + P-done_7_2 + P-done_7_3 + P-done_7_4 + P-done_7_5 + P-done_7_6 + P-done_7_7 + P-done_7_8 + P-done_8_0 + P-done_8_1 + P-done_8_2 + P-done_8_3 + P-done_8_4 + P-done_8_5 + P-done_8_6 + P-done_8_7 + P-done_8_8 + P-done_0_8 + P-done_0_7 + P-done_0_6 + P-d... (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: (P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 + P-CS_21_5 + P-CS_21_6 + P-CS_21_7 + P-CS_21_8 + 1 <= P-done_6_0 + P-done_6_1 + P-done_6_2 + P-done_6_3 + P-done_6_4 + P-done_6_5 + P-done_6_6 + P-done_6_7 + P-done_6_8 + P-done_7_0 + P-done_7_1 + P-done_7_2 + P-done_7_3 + P-done_7_4 + P-done_7_5 + P-done_7_6 + P-done_7_7 + P-done_7_8 + P-done_8_0 + P-done_8_1 + P-done_8_2 + P-done_8_3 + ... (shortened)
lola: processed formula length: 1165
lola: 33 rewrites
lola: closed formula file LamportFastMutEx-PT-8-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-8-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 986 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4 + P-ify0_4_5 + P-ify0_4_6 + P-ify0_4_7 + P-ify0_4_8 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 + P-CS_21_5 + P-CS_21_6 + P-CS_21_7 + P-CS_21_8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4 + P-ify0_4_5 + P-ify0_4_6 + P-ify0_4_7 + P-ify0_4_8 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 + P-CS_21_5 + P-CS_21_6 + P-CS_21_7 + P-CS_21_8))))
lola: processed formula length: 237
lola: 31 rewrites
lola: closed formula file LamportFastMutEx-PT-8-LTLCardinality.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: 79 markings, 84 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-8-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1479 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + P-setbi_5_3 + P-setbi_5_4 + P-setbi_5_5 + P-setbi_5_6 + P-setbi_5_7 + P-setbi_5_8 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 + P-ifyi_15_5 + P-ifyi_15_6 + P-ifyi_15_7 + P-ifyi_15_8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + P-setbi_5_3 + P-setbi_5_4 + P-setbi_5_5 + P-setbi_5_6 + P-setbi_5_7 + P-setbi_5_8 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 + P-ifyi_15_5 + P-ifyi_15_6 + P-ifyi_15_7 + P-ifyi_15_8))))
lola: processed formula length: 264
lola: 31 rewrites
lola: closed formula file LamportFastMutEx-PT-8-LTLCardinality.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: 80 markings, 81 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-8-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 2958 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((F ((3 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 + P-ifxi_10_5 + P-ifxi_10_6 + P-ifxi_10_7 + P-ifxi_10_8)) AND ((1 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 + P-CS_21_5 + P-CS_21_6 + P-CS_21_7 + P-CS_21_8) OR (3 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 + P-ifxi_10_5 + P-ifxi_10_6 + P-ifxi_10_7 + P-ifxi_10_8)))))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((3 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 + P-ifxi_10_5 + P-ifxi_10_6 + P-ifxi_10_7 + P-ifxi_10_8)) AND ((1 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 + P-CS_21_5 + P-CS_21_6 + P-CS_21_7 + P-CS_21_8) OR (3 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 + P-ifxi_10_5 + P-ifxi_10_6 + P-ifxi_10_7 + P-ifxi_10_8)))))... (shortened)
lola: processed formula length: 401
lola: 31 rewrites
lola: closed formula file LamportFastMutEx-PT-8-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 34 markings, 35 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-8-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no yes yes yes yes no yes yes yes no yes yes
lola:
preliminary result: no no no no no yes yes yes yes no yes yes yes no yes yes
lola: memory consumption: 20448 KB
lola: time consumption: 612 seconds

BK_STOP 1527430525751

--------------------
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="LamportFastMutEx-PT-8"
export BK_EXAMINATION="LTLCardinality"
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/LamportFastMutEx-PT-8.tgz
mv LamportFastMutEx-PT-8 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 LamportFastMutEx-PT-8, examination is LTLCardinality"
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-152732582700043"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;