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 244K
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K 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.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K 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 46K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is LamportFastMutEx-PT-2, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469100110
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527014953116

info: Time: 3600 - MCC
===========================================================================================
prep: translating LamportFastMutEx-PT-2 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating LamportFastMutEx-PT-2 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ LamportFastMutEx-PT-2 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 165/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 69
lola: finding significant places
lola: 69 places, 96 transitions, 52 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 137 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-PT-2-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (3 <= P-start_1_0 + P-start_1_1 + P-start_1_2)
lola: place invariant simplifies atomic proposition
lola: before: (P-b_1_true + P-b_2_false + P-b_0_false + P-b_2_true + P-b_1_false + P-b_0_true <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0)
lola: after: (2 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0)
lola: place invariant simplifies atomic proposition
lola: before: (3 <= x_0 + x_1 + x_2)
lola: after: (2 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (1 <= x_0 + x_1 + x_2)
lola: after: (0 <= 0)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= P-await_13_0 + P-await_13_1 + P-await_13_2)
lola: LP says that atomic proposition is always false: (3 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2)
lola: LP says that atomic proposition is always true: (P-await_13_0 <= P-ifxi_10_1)
lola: LP says that atomic proposition is always false: (2 <= P-wait_1_0)
lola: LP says that atomic proposition is always true: (P-setbi_24_0 <= P-awaity_0)
lola: LP says that atomic proposition is always false: (3 <= x_2)
lola: LP says that atomic proposition is always false: (1 <= P-ify0_4_0)
lola: LP says that atomic proposition is always true: (P-done_0_1 <= P-setbi_5_1)
lola: LP says that atomic proposition is always true: (P-ifyi_15_0 <= P-ify0_4_2)
lola: LP says that atomic proposition is always true: (P-wait_2_0 <= P-setx_3_0)
lola: LP says that atomic proposition is always false: (3 <= P-b_0_false)
lola: LP says that atomic proposition is always false: (3 <= P-awaity_1)
lola: LP says that atomic proposition is always true: (P-wait_1_0 <= P-setx_3_1)
lola: LP says that atomic proposition is always true: (P-setbi_11_0 <= P-b_2_true)
lola: LP says that atomic proposition is always true: (P-done_0_1 <= y_1)
lola: LP says that atomic proposition is always false: (2 <= P-wait_0_0)
lola: LP says that atomic proposition is always true: (P-b_0_false <= P-done_1_0)
lola: E (F ((P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + 1 <= P-awaity_0 + P-awaity_1 + P-awaity_2))) : E (F ((1 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1))) : A (G (((P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + 1 <= P-start_1_0 + P-start_1_1 + P-start_1_2) AND ((2 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0) OR (2 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1)) AND ((2 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2) OR ((P-awaity_0 + P-awaity_1 + P-awaity_2 <= P-start_1_0 + P-start_1_1 + P-start_1_2) AND (2 <= P-setx_3_0 + P-setx_3_1 + P-setx_3_2)))))) : A (G ((P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2))) : E (F (TRUE)) : E (F (((P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + 1 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1) AND (P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + 1 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2) AND (P-sety_9_0 + P-sety_9_1 + P-sety_9_2 <= 0) AND (P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2 <= 0)))) : A (G (((3 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2) OR (P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1 <= P-start_1_0 + P-start_1_1 + P-start_1_2)))) : E (F (())) : E (F (((P-wait_0_2 + 1 <= P-ifyi_15_2) AND (P-wait_1_1 <= P-done_0_2) AND (P-setx_3_1 <= P-awaity_1)))) : E (F (())) : A (G (((P-setbi_24_1 + 1 <= P-ify0_4_1)))) : E (F (TRUE)) : E (F (TRUE)) : E (F (())) : A (G (())) : E (F (()))
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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: 24 rewrites
lola: closed formula file LamportFastMutEx-PT-2-ReachabilityCardinality.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-2-ReachabilityCardinality-4 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: 24 rewrites
lola: closed formula file LamportFastMutEx-PT-2-ReachabilityCardinality.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-2-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 24 rewrites
lola: closed formula file LamportFastMutEx-PT-2-ReachabilityCardinality.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-2-ReachabilityCardinality-9 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: 24 rewrites
lola: closed formula file LamportFastMutEx-PT-2-ReachabilityCardinality.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-2-ReachabilityCardinality-11 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 24 rewrites
lola: closed formula file LamportFastMutEx-PT-2-ReachabilityCardinality.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

FORMULA LamportFastMutEx-PT-2-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
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: 24 rewrites
lola: closed formula file LamportFastMutEx-PT-2-ReachabilityCardinality.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

FORMULA LamportFastMutEx-PT-2-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
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: 24 rewrites
lola: closed formula file LamportFastMutEx-PT-2-ReachabilityCardinality.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-2-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 24 rewrites
lola: closed formula file LamportFastMutEx-PT-2-ReachabilityCardinality.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-2-ReachabilityCardinality-15 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 (G (((P-setbi_24_1 + 1 <= P-ify0_4_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((P-setbi_24_1 + 1 <= P-ify0_4_1))))
lola: processed formula length: 42
lola: 26 rewrites
lola: closed formula file LamportFastMutEx-PT-2-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-2-ReachabilityCardinality-10 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 (G ((P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2)))
lola: processed formula length: 98
lola: 26 rewrites
lola: closed formula file LamportFastMutEx-PT-2-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + 1 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-2-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-2-ReachabilityCardinality-3 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 (((P-wait_0_2 + 1 <= P-ifyi_15_2) AND (P-wait_1_1 <= P-done_0_2) AND (P-setx_3_1 <= P-awaity_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((P-wait_0_2 + 1 <= P-ifyi_15_2) AND (P-wait_1_1 <= P-done_0_2) AND (P-setx_3_1 <= P-awaity_1))))
lola: processed formula length: 103
lola: 25 rewrites
lola: closed formula file LamportFastMutEx-PT-2-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((P-wait_0_2 + 1 <= P-ifyi_15_2) AND (P-wait_1_1 <= P-done_0_2) AND (P-setx_3_1 <= P-awaity_1))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges

FORMULA LamportFastMutEx-PT-2-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + 1 <= P-awaity_0 + P-awaity_1 + P-awaity_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + 1 <= P-awaity_0 + P-awaity_1 + P-awaity_2)))
lola: processed formula length: 93
lola: 25 rewrites
lola: closed formula file LamportFastMutEx-PT-2-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + 1 <= P-awaity_0 + P-awaity_1 + P-awaity_2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-2-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 30 markings, 31 edges

FORMULA LamportFastMutEx-PT-2-ReachabilityCardinality-0 TRUE 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: E (F ((1 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((1 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1)))
lola: processed formula length: 129
lola: 25 rewrites
lola: closed formula file LamportFastMutEx-PT-2-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (1 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-2-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-2-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2) OR (P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1 <= P-start_1_0 + P-start_1_1 + P-start_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((3 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2) OR (P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1 <= P-start_1_0 + P-start_1_1 + P-start_1_2))))
lola: processed formula length: 295
lola: 26 rewrites
lola: closed formula file LamportFastMutEx-PT-2-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2 <= 2) AND (P-start_1_0 + P-start_1_1 + P-start_1_2 + 1 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-2-ReachabilityCardinality-13-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-2-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + 1 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1) AND (P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + 1 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2) AND (P-sety_9_0 + P-sety_9_1 + P-sety_9_2 <= 0) AND (P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-don... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + 1 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1) AND (P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + 1 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2) AND (P-sety_9_0 + P-sety_9_1 + P-sety_9_2 <= 0) AND (P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-don... (shortened)
lola: processed formula length: 440
lola: 25 rewrites
lola: closed formula file LamportFastMutEx-PT-2-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + 1 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1) AND (P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + 1 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2) AND (P-sety_9_0 + P-sety_9_1 + P-sety_9_2 <= 0) AND (P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2 <= 0))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-2-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges

FORMULA LamportFastMutEx-PT-2-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + 1 <= P-start_1_0 + P-start_1_1 + P-start_1_2) AND ((2 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0) OR (2 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1)) AND ((2 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + 1 <= P-start_1_0 + P-start_1_1 + P-start_1_2) AND ((2 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0) OR (2 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1)) AND ((2 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2) OR ... (shortened)
lola: processed formula length: 535
lola: 26 rewrites
lola: closed formula file LamportFastMutEx-PT-2-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((P-start_1_0 + P-start_1_1 + P-start_1_2 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2) OR ((P-CS_21_2 + P-CS_21_1 + P-CS_21_0 <= 1) AND (P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1 <= 1)) OR ((P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2 <= 1) AND ((P-start_1_0 + P-start_1_1 + P-start_1_2 + 1 <= P-awaity_0 + P-awaity_1 + P-awaity_2) OR (P-setx_3_0 + P-setx_3_1 + P-setx_3_2 <= 1))))
lola: state equation: Generated DNF with 7 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-2-ReachabilityCardinality-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA LamportFastMutEx-PT-2-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no no yes yes no yes yes yes no yes yes yes no no
lola:
preliminary result: yes yes no no yes yes no yes yes yes no yes yes yes no no
lola: memory consumption: 23176 KB
lola: time consumption: 0 seconds

BK_STOP 1527016745416

--------------------
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-2"
export BK_EXAMINATION="ReachabilityCardinality"
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-2.tgz
mv LamportFastMutEx-PT-2 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is LamportFastMutEx-PT-2, examination is ReachabilityCardinality"
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-152666469100110"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;