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 312K
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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 2.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 6.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18: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 75K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is LamportFastMutEx-PT-3, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469100115
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527015888209

info: Time: 3600 - MCC
===========================================================================================
prep: translating LamportFastMutEx-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 LamportFastMutEx-PT-3 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ LamportFastMutEx-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: 256/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 100
lola: finding significant places
lola: 100 places, 156 transitions, 74 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 222 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-PT-3-CTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 <= P-b_1_true + P-b_3_false + P-b_2_false + P-b_0_false + P-b_2_true + P-b_1_false + P-b_0_true + P-b_3_true)
lola: after: (P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 <= 3)
lola: LP says that atomic proposition is always true: (P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 <= 3)
lola: place invariant simplifies atomic proposition
lola: before: (P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 <= P-b_1_true + P-b_3_false + P-b_2_false + P-b_0_false + P-b_2_true + P-b_1_false + P-b_0_true + P-b_3_true)
lola: after: (P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 <= 3)
lola: LP says that atomic proposition is always true: (P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 <= 3)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (x_0 + x_1 + x_2 + x_3 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3)
lola: after: (1 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= y_0 + y_1 + y_2 + y_3)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 <= x_0 + x_1 + x_2 + x_3)
lola: after: (P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 <= 1)
lola: LP says that atomic proposition is always true: (P-done_0_1 <= P-wait_0_0)
lola: LP says that atomic proposition is always false: (3 <= P-ifyi_15_3)
lola: LP says that atomic proposition is always false: (3 <= P-start_1_2)
lola: LP says that atomic proposition is always true: (P-setbi_5_0 <= P-wait_1_3)
lola: LP says that atomic proposition is always true: (P-ify0_4_0 <= y_2)
lola: LP says that atomic proposition is always false: (3 <= P-b_0_true)
lola: LP says that atomic proposition is always true: (P-done_0_0 <= P-CS_21_2)
lola: LP says that atomic proposition is always false: (3 <= P-wait_2_1)
lola: LP says that atomic proposition is always false: (3 <= P-setx_3_1)
lola: LP says that atomic proposition is always false: (3 <= P-awaity_1)
lola: LP says that atomic proposition is always false: (2 <= P-done_0_3)
lola: LP says that atomic proposition is always true: (P-wait_1_0 <= P-CS_21_1)
lola: LP says that atomic proposition is always false: (2 <= P-b_2_true)
lola: LP says that atomic proposition is always true: (P-CS_21_0 <= P-setbi_24_1)
lola: LP says that atomic proposition is always false: (3 <= P-fordo_12_0)
lola: LP says that atomic proposition is always false: (3 <= P-done_3_3)
lola: LP says that atomic proposition is always false: (2 <= P-CS_21_1)
lola: LP says that atomic proposition is always false: (2 <= P-wait_2_1)
lola: LP says that atomic proposition is always true: (P-awaity_0 <= P-awaity_1)
lola: LP says that atomic proposition is always false: (3 <= P-ify0_4_1)
lola: A (G (E (F (TRUE)))) : E (F ((((P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3)) AND A (G ((P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3)))))) : E (G (NOT(A (G (TRUE))))) : (NOT(E (((2 <= P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3) U (1 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3)))) AND (P-setx_3_0 + P-setx_3_1 + P-setx_3_2 + P-setx_3_3 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3)) : E ((A (G ((P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 <= P-wait_3_3 + P-wait_3_2 + P-wait_3_1 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_3_0 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3))) U E (G ((1 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3))))) : E (F (A (G (((1 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3)))))) : A (G ((A (F ((P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 <= P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3))) OR E (G ((P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 <= 1)))))) : E (F (NOT(E (F ((2 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + P-setbi_5_3)))))) : (E (X (TRUE)) AND E (F (FALSE))) : (((P-ifxi_10_3 + 1 <= P-ifyi_15_2)) OR E (F (()))) : (E ((() U ())) AND E (F (()))) : A (G (TRUE)) : NOT(NOT(E (F (())))) : (E ((FALSE U (P-fordo_12_3 + 1 <= P-done_2_3))) OR E (F (A (G ((P-setx_3_2 <= P-wait_2_3)))))) : E ((E (X ((P-setx_3_3 <= P-ifxi_10_0))) U ())) : (E (G (())) OR E (F (A (G (FALSE)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:326
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:130
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 59 rewrites
lola: closed formula file LamportFastMutEx-PT-3-CTLCardinality.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-3-CTLCardinality-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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 59 rewrites
lola: closed formula file LamportFastMutEx-PT-3-CTLCardinality.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 LamportFastMutEx-PT-3-CTLCardinality-2 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 59 rewrites
lola: closed formula file LamportFastMutEx-PT-3-CTLCardinality.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

FORMULA LamportFastMutEx-PT-3-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((P-ifxi_10_3 + 1 <= P-ifyi_15_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((P-ifxi_10_3 + 1 <= P-ifyi_15_2))
lola: processed formula length: 34
lola: 59 rewrites
lola: closed formula file LamportFastMutEx-PT-3-CTLCardinality.task
lola: processed formula with 1 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 LamportFastMutEx-PT-3-CTLCardinality-9 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 59 rewrites
lola: closed formula file LamportFastMutEx-PT-3-CTLCardinality.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 LamportFastMutEx-PT-3-CTLCardinality-10 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 59 rewrites
lola: closed formula file LamportFastMutEx-PT-3-CTLCardinality.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-3-CTLCardinality-11 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 59 rewrites
lola: closed formula file LamportFastMutEx-PT-3-CTLCardinality.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 LamportFastMutEx-PT-3-CTLCardinality-12 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 59 rewrites
lola: closed formula file LamportFastMutEx-PT-3-CTLCardinality.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 LamportFastMutEx-PT-3-CTLCardinality-14 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 59 rewrites
lola: closed formula file LamportFastMutEx-PT-3-CTLCardinality.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 LamportFastMutEx-PT-3-CTLCardinality-15 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: E (F (A (G ((P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + P-setbi_5_3 <= 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:695
lola: processed formula: (2 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + P-setbi_5_3)
lola: processed formula length: 60
lola: 61 rewrites
lola: closed formula file LamportFastMutEx-PT-3-CTLCardinality.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: 19330 markings, 51620 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-3-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3))))))
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: ((P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 <= 0))
lola: processed formula length: 62
lola: 61 rewrites
lola: closed formula file LamportFastMutEx-PT-3-CTLCardinality.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: 19582 markings, 56098 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-3-CTLCardinality-5 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: E (F ((((P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3)) AND A (G ((P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3))))))
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 (((P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3)) AND NOT(E(TRUE U (P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 + 1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3)))))
lola: processed formula length: 274
lola: 62 rewrites
lola: closed formula file LamportFastMutEx-PT-3-CTLCardinality.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: 19742 markings, 90288 edges

FORMULA LamportFastMutEx-PT-3-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 <= P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3))) OR E (G ((P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:312
lola: processed formula: NOT(E(TRUE U (NOT(A(TRUE U (P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 <= P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3))) AND A(TRUE U (2 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3)))))
lola: processed formula length: 203
lola: 65 rewrites
lola: closed formula file LamportFastMutEx-PT-3-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 19742 markings, 87163 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-3-CTLCardinality-6 TRUE 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: E ((A (G ((P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 <= P-wait_3_3 + P-wait_3_2 + P-wait_3_1 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_3_0 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3))) U E (G ((1 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E(NOT(E(TRUE U (P-wait_3_3 + P-wait_3_2 + P-wait_3_1 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_3_0 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + 1 <= P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3))) U NOT(A(TRUE U (P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 <= 0))))
lola: processed formula length: 360
lola: 64 rewrites
lola: closed formula file LamportFastMutEx-PT-3-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 106 markings, 119 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-3-CTLCardinality-4 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: ((P-fordo_12_3 + 1 <= P-done_2_3) OR E (F (A (G ((P-setx_3_2 <= P-wait_2_3))))))
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: (P-fordo_12_3 + 1 <= P-done_2_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-fordo_12_3 + 1 <= P-done_2_3)
lola: processed formula length: 32
lola: 59 rewrites
lola: closed formula file LamportFastMutEx-PT-3-CTLCardinality.task
lola: processed formula with 1 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 15 will run for 3569 seconds at most (--localtimelimit=0)
========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((P-setx_3_2 <= P-wait_2_3)))))
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: (P-wait_2_3 + 1 <= P-setx_3_2)
lola: processed formula length: 30
lola: 61 rewrites
lola: closed formula file LamportFastMutEx-PT-3-CTLCardinality.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: 19066 markings, 50513 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA LamportFastMutEx-PT-3-CTLCardinality-13 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 (((P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 <= 1) R (P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 <= 0))) AND (P-setx_3_0 + P-setx_3_1 + P-setx_3_2 + P-setx_3_3 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3))
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: (P-setx_3_0 + P-setx_3_1 + P-setx_3_2 + P-setx_3_3 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-setx_3_0 + P-setx_3_1 + P-setx_3_2 + P-setx_3_3 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3)
lola: processed formula length: 104
lola: 59 rewrites
lola: closed formula file LamportFastMutEx-PT-3-CTLCardinality.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: ========================================
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: (A (((P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 <= 1) R (P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 <= 0))) AND (P-setx_3_0 + P-setx_3_1 + P-setx_3_2 + P-setx_3_3 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (P-setx_3_0 + P-setx_3_1 + P-setx_3_2 + P-setx_3_3 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-setx_3_0 + P-setx_3_1 + P-setx_3_2 + P-setx_3_3 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3)
lola: processed formula length: 104
lola: 59 rewrites
lola: closed formula file LamportFastMutEx-PT-3-CTLCardinality.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: ========================================
lola: ========================================
lola: ...considering subproblem: A (((P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 <= 1) R (P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking universal release
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:647
lola: rewrite Frontend/Parser/formula_rewrite.k:607
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (((P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 <= 1) R (P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 <= 0)))
lola: processed formula length: 133
lola: 65 rewrites
lola: closed formula file LamportFastMutEx-PT-3-CTLCardinality.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: (1 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-3-CTLCardinality-17-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: Predicate Phi releases Predicate Psi on all paths.
lola: 31 markings, 39 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA LamportFastMutEx-PT-3-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes no no yes no no no no yes no no no no
lola:
preliminary result: yes no no yes no no yes no no no no yes no no no no
lola: memory consumption: 22668 KB
lola: time consumption: 1 seconds

BK_STOP 1527015889532

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