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 472K
-rw-r--r-- 1 mcc users 11K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 37K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K 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 5.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 114K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is DatabaseWithMutex-PT-04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649936700047
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526609594528

info: Time: 3600 - MCC
===========================================================================================
prep: translating DatabaseWithMutex-PT-04 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating DatabaseWithMutex-PT-04 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ DatabaseWithMutex-PT-04 @ 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: 268/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4480
lola: finding significant places
lola: 140 places, 128 transitions, 112 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 176 transition conflict sets
lola: TASK
lola: reading formula from DatabaseWithMutex-PT-04-ReachabilityCardinality.task
lola: always true
lola: always true
lola: always true
lola: LP says that atomic proposition is always false: (3 <= Acknowledge_3_3)
lola: LP says that atomic proposition is always false: (2 <= Message_4_3)
lola: LP says that atomic proposition is always false: (3 <= Acknowledge_3_3)
lola: LP says that atomic proposition is always false: (2 <= updating_3_1)
lola: LP says that atomic proposition is always false: (2 <= Active_1_3)
lola: LP says that atomic proposition is always false: (2 <= RecBuff_2_1)
lola: LP says that atomic proposition is always false: (2 <= Active_2_4)
lola: LP says that atomic proposition is always false: (3 <= Message_1_1)
lola: LP says that atomic proposition is always false: (3 <= Modify_2_4)
lola: LP says that atomic proposition is always false: (2 <= Message_4_3)
lola: LP says that atomic proposition is always false: (3 <= Acknowledge_3_3)
lola: LP says that atomic proposition is always false: (3 <= WaitMutex_1_3)
lola: LP says that atomic proposition is always false: (2 <= RecBuff_4_1)
lola: LP says that atomic proposition is always false: (2 <= updating_4_2)
lola: LP says that atomic proposition is always false: (2 <= Message_4_2)
lola: LP says that atomic proposition is always false: (2 <= Message_2_3)
lola: LP says that atomic proposition is always false: (2 <= Modify_1_4)
lola: LP says that atomic proposition is always false: (3 <= Modify_1_4)
lola: LP says that atomic proposition is always false: (3 <= Mutex_2)
lola: A (G ((Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4 <= all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4))) : E (F (((((1 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Acknowledge_2_4 + Acknowledge_3_1 + Acknowledge_3_2 + Acknowledge_3_3 + Acknowledge_3_4 + Acknowledge_4_1 + Acknowledge_4_2 + Acknowledge_4_3 + Acknowledge_4_4) AND (2 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_3 + Message_2_4 + Message_3_1 + Message_3_2 + Message_3_3 + Message_3_4 + Message_4_1 + Message_4_2 + Message_4_3 + Message_4_4)) OR (Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= 1)) AND ((Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= all_active_4 + all_active_3 + all_active_2 + all_active_1) OR (2 <= Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4) OR (1 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_3 + Message_2_4 + Message_3_1 + Message_3_2 + Message_3_3 + Message_3_4 + Message_4_1 + Message_4_2 + Message_4_3 + Message_4_4))))) : E (F (((2 <= Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4) AND ((RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 + RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + RecBuff_2_1 + RecBuff_2_2 + RecBuff_2_3 + RecBuff_2_4 + 1 <= all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4) OR (Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= 0))))) : A (G (((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + MesBuffReply_2_4 + MesBuffReply_3_1 + MesBuffReply_3_2 + MesBuffReply_3_3 + MesBuffReply_3_4 + MesBuffReply_4_1 + MesBuffReply_4_2 + MesBuffReply_4_3 + MesBuffReply_4_4 <= all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4) OR ((WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_1_3 + WaitMutex_1_4 + WaitMutex_2_1 + WaitMutex_2_2 + WaitMutex_2_3 + WaitMutex_2_4 + WaitMutex_3_1 + WaitMutex_3_2 + WaitMutex_3_3 + WaitMutex_3_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_4_4 <= 0))))) : A (G (((1 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4) OR (2 <= updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4) OR (1 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_1_3 + WaitMutex_1_4 + WaitMutex_2_1 + WaitMutex_2_2 + WaitMutex_2_3 + WaitMutex_2_4 + WaitMutex_3_1 + WaitMutex_3_2 + WaitMutex_3_3 + WaitMutex_3_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_4_4) OR ((3 <= all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4) AND (3 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_1_3 + WaitMutex_1_4 + WaitMutex_2_1 + WaitMutex_2_2 + WaitMutex_2_3 + WaitMutex_2_4 + WaitMutex_3_1 + WaitMutex_3_2 + WaitMutex_3_3 + WaitMutex_3_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_4_4)) OR ((Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 <= MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + MesBuffReply_2_4 + MesBuffReply_3_1 + MesBuffReply_3_2 + MesBuffReply_3_3 + MesBuffReply_3_4 + MesBuffReply_4_1 + MesBuffReply_4_2 + MesBuffReply_4_3 + MesBuffReply_4_4) AND (3 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_3 + Message_2_4 + Message_3_1 + Message_3_2 + Message_3_3 + Message_3_4 + Message_4_1 + Message_4_2 + Message_4_3 + Message_4_4))))) : E (F ((((3 <= RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 + RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + RecBuff_2_1 + RecBuff_2_2 + RecBuff_2_3 + RecBuff_2_4)) OR ((3 <= Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4) AND (1 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_3 + Message_2_4 + Message_3_1 + Message_3_2 + Message_3_3 + Message_3_4 + Message_4_1 + Message_4_2 + Message_4_3 + Message_4_4) AND (2 <= updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4))))) : E (F (((Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4) AND (2 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Acknowledge_2_4 + Acknowledge_3_1 + Acknowledge_3_2 + Acknowledge_3_3 + Acknowledge_3_4 + Acknowledge_4_1 + Acknowledge_4_2 + Acknowledge_4_3 + Acknowledge_4_4) AND ((Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4 <= Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4) OR (Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4 <= Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4)) AND (all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4 <= MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + MesBuffReply_2_4 + MesBuffReply_3_1 + MesBuffReply_3_2 + MesBuffReply_3_3 + MesBuffReply_3_4 + MesBuffReply_4_1 + MesBuffReply_4_2 + MesBuffReply_4_3 + MesBuffReply_4_4)))) : A (G (())) : E (F (())) : A (G (())) : E (F (())) : E (F (())) : A (G (())) : E (F (())) : E (F (((RecBuff_3_4 + 1 <= Message_2_1) AND (Active_2_3 + 1 <= Acknowledge_2_3) AND (Message_4_3 + 1 <= Message_1_3)))) : A (G (((Message_2_1 <= WaitMutex_2_3) OR (MesBuffReply_4_2 <= Active_3_1) OR (all_active_4 <= WaitMutex_4_2) OR (updating_3_2 <= 0))))
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: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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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: 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: 21 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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 DatabaseWithMutex-PT-04-ReachabilityCardinality-7 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: 21 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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 DatabaseWithMutex-PT-04-ReachabilityCardinality-8 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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 DatabaseWithMutex-PT-04-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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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 DatabaseWithMutex-PT-04-ReachabilityCardinality-10 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: 21 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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 DatabaseWithMutex-PT-04-ReachabilityCardinality-11 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: 21 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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 DatabaseWithMutex-PT-04-ReachabilityCardinality-12 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: 21 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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 DatabaseWithMutex-PT-04-ReachabilityCardinality-13 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: E (F (((RecBuff_3_4 + 1 <= Message_2_1) AND (Active_2_3 + 1 <= Acknowledge_2_3) AND (Message_4_3 + 1 <= Message_1_3))))
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 (((RecBuff_3_4 + 1 <= Message_2_1) AND (Active_2_3 + 1 <= Acknowledge_2_3) AND (Message_4_3 + 1 <= Message_1_3))))
lola: processed formula length: 119
lola: 22 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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: ((RecBuff_3_4 + 1 <= Message_2_1) AND (Active_2_3 + 1 <= Acknowledge_2_3) AND (Message_4_3 + 1 <= Message_1_3))
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: 11 markings, 10 edges
lola: state equation: write sara problem file to DatabaseWithMutex-PT-04-ReachabilityCardinality-7-0.sara

FORMULA DatabaseWithMutex-PT-04-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Message_2_1 <= WaitMutex_2_3) OR (MesBuffReply_4_2 <= Active_3_1) OR (all_active_4 <= WaitMutex_4_2) OR (updating_3_2 <= 0))))
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 (((Message_2_1 <= WaitMutex_2_3) OR (MesBuffReply_4_2 <= Active_3_1) OR (all_active_4 <= WaitMutex_4_2) OR (updating_3_2 <= 0))))
lola: processed formula length: 137
lola: 23 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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: ((WaitMutex_2_3 + 1 <= Message_2_1) AND (Active_3_1 + 1 <= MesBuffReply_4_2) AND (WaitMutex_4_2 + 1 <= all_active_4) AND (1 <= updating_3_2))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DatabaseWithMutex-PT-04-ReachabilityCardinality-8-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: 5909 markings, 6537 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-ReachabilityCardinality-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: A (G ((Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4 <= all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4)))
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 ((Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4 <= all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4)))
lola: processed formula length: 280
lola: 23 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-ReachabilityCardinality-0 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: A (G (((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + MesBuffReply_2_4 + MesBuffReply_3_1 + MesBuffReply_3_2 + MesBuffReply_3_3 + MesBuffReply_3_4 + MesBuffReply_4_1 + MesBuffReply_4_2 + MesBuffReply_4_3 + MesBuffReply_4_4 <= all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4) OR ((WaitMutex_1_1 + Wa... (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 (((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + MesBuffReply_2_4 + MesBuffReply_3_1 + MesBuffReply_3_2 + MesBuffReply_3_3 + MesBuffReply_3_4 + MesBuffReply_4_1 + MesBuffReply_4_2 + MesBuffReply_4_3 + MesBuffReply_4_4 <= all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4) OR ((WaitMutex_1_1 + Wa... (shortened)
lola: processed formula length: 645
lola: 23 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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: ((all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4 + 1 <= MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + MesBuffReply_2_4 + MesBuffReply_3_1 + MesBuffReply_3_2 + MesBuffReply_3_3 + MesBuffReply_3_4 + MesBuffReply_4_1 + MesBuffReply_4_2 + MesBuffReply_4_3 + MesBuffReply_4_4) AND ((1 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_1_3 + WaitMutex_1_4 + WaitMutex_2_1 + WaitMutex_2_2 + WaitMutex_2_3 + WaitMutex_2_4 + WaitMutex_3_1 + WaitMutex_3_2 + WaitMutex_3_3 + WaitMutex_3_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_4_4)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges

FORMULA DatabaseWithMutex-PT-04-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: write sara problem file to DatabaseWithMutex-PT-04-ReachabilityCardinality-10-0.sara
lola: ========================================
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4) AND ((RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 + RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + RecBuf... (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 (((2 <= Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4) AND ((RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 + RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + RecBuf... (shortened)
lola: processed formula length: 570
lola: 22 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola:
FORMULA DatabaseWithMutex-PT-04-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((((1 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Acknowledge_2_4 + Acknowledge_3_1 + Acknowledge_3_2 + Acknowledge_3_3 + Acknowledge_3_4 + Acknowledge_4_1 + Acknowledge_4_2 + Acknowledge_4_3 + Acknowledge_4_4) AND (2 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Mess... (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 (((((1 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Acknowledge_2_4 + Acknowledge_3_1 + Acknowledge_3_2 + Acknowledge_3_3 + Acknowledge_3_4 + Acknowledge_4_1 + Acknowledge_4_2 + Acknowledge_4_3 + Acknowledge_4_4) AND (2 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Mess... (shortened)
lola: processed formula length: 1145
lola: 22 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Acknowledge_2_4 + Acknowledge_3_1 + Acknowledge_3_2 + Acknowledge_3_3 + Acknowledge_3_4 + Acknowledge_4_1 + Acknowledge_4_2 + Acknowledge_4_3 + Acknowledge_4_4) AND (2 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_3 + Message_2_4 + Message_3_1 + Message_3_2 + Message_3_3 + Message_3_4 + Message_4_1 + Message_4_2 + Message_4_3 + Message_4_4)) OR (Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= 1)) AND ((Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= all_active_4 + all_active_3 + all_active_2 + all_active_1) OR (2 <= Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4) OR (1 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_3 + Message_2_4 + Message_3_1 + Message_3_2 + Message_3_3 + Message_3_4 + Message_4_1 + Message_4_2 + Message_4_3 + Message_4_4)))
lola: state equation: Generated DNF with 15 literals and 6 conjunctive subformulas
formula 0: ((2 <= Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4) AND ((RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 + RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + RecBuff_2_1 + RecBuff_2_2 + RecBuff_2_3 + RecBuff_2_4 + 1 <= all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4) OR (Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= 0)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DatabaseWithMutex-PT-04-ReachabilityCardinality-11-0.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: state equation: write sara problem file to DatabaseWithMutex-PT-04-ReachabilityCardinality-12-0.sara

FORMULA DatabaseWithMutex-PT-04-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 + RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + RecBuff_2_1 + RecBuff_2_2 + RecBuff_2_3 + RecBuff_2_4)) OR ((3 <= Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3... (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 ((((3 <= RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 + RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + RecBuff_2_1 + RecBuff_2_2 + RecBuff_2_3 + RecBuff_2_4)) OR ((3 <= Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3... (shortened)
lola: processed formula length: 941
lola: sara: try reading problem file DatabaseWithMutex-PT-04-ReachabilityCardinality-12-0.sara.
22 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-ReachabilityCardinality.task
lola: STOREsara: try reading problem file DatabaseWithMutex-PT-04-ReachabilityCardinality-11-0.sara.

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: (((3 <= RecBuff_3_1 + RecBuff_3_2 + RecBuff_3_3 + RecBuff_3_4 + RecBuff_4_1 + RecBuff_4_2 + RecBuff_4_3 + RecBuff_4_4 + RecBuff_1_1 + RecBuff_1_2 + RecBuff_1_3 + RecBuff_1_4 + RecBuff_2_1 + RecBuff_2_2 + RecBuff_2_3 + RecBuff_2_4)) OR ((3 <= Modify_1_1 + Modify_1_2 + Modify_1_3 + Modify_1_4 + Modify_2_1 + Modify_2_2 + Modify_2_3 + Modify_2_4 + Modify_3_1 + Modify_3_2 + Modify_3_3 + Modify_3_4 + Modify_4_1 + Modify_4_2 + Modify_4_3 + Modify_4_4) AND (1 <= Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_3 + Message_2_4 + Message_3_1 + Message_3_2 + Message_3_3 + Message_3_4 + Message_4_1 + Message_4_2 + Message_4_3 + Message_4_4) AND (2 <= updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: state equation: write sara problem file to DatabaseWithMutex-PT-04-ReachabilityCardinality-13-0.sara

FORMULA DatabaseWithMutex-PT-04-ReachabilityCardinality-5 TRUE 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: state equation: calling and running sara
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (((Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4) AND (2 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Acknowle... (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 (((Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4) AND (2 <= Acknowledge_1_1 + Acknowledge_1_2 + Acknowledge_1_3 + Acknowledge_1_4 + Acknowledge_2_1 + Acknowledge_2_2 + Acknowledge_2_3 + Acknowle... (shortened)
lola: processed formula length: 1772
lola: 22 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 25 markings, 24 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-ReachabilityCardinality-6 TRUE 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 (G (((1 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4) OR (2 <= updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4) OR (1 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_1_3 + WaitMutex_1_4 + WaitMutex_2_1 + WaitMutex... (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 (((1 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4) OR (2 <= updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4) OR (1 <= WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_1_3 + WaitMutex_1_4 + WaitMutex_2_1 + WaitMutex... (shortened)
lola: processed formula length: 1660
lola: 23 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-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: ((Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4 <= 0) AND (updating_1_1 + updating_1_2 + updating_1_3 + updating_3_3 + updating_3_2 + updating_3_1 + updating_2_1 + updating_2_2 + updating_2_3 + updating_2_4 + updating_1_4 + updating_3_4 + updating_4_1 + updating_4_2 + updating_4_3 + updating_4_4 <= 1) AND (WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_1_3 + WaitMutex_1_4 + WaitMutex_2_1 + WaitMutex_2_2 + WaitMutex_2_3 + WaitMutex_2_4 + WaitMutex_3_1 + WaitMutex_3_2 + WaitMutex_3_3 + WaitMutex_3_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_4_4 <= 0) AND ((all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4 <= 2) OR (WaitMutex_1_1 + WaitMutex_1_2 + WaitMutex_1_3 + WaitMutex_1_4 + WaitMutex_2_1 + WaitMutex_2_2 + WaitMutex_2_3 + WaitMutex_2_4 + WaitMutex_3_1 + WaitMutex_3_2 + WaitMutex_3_3 + WaitMutex_3_4 + WaitMutex_4_3 + WaitMutex_4_2 + WaitMutex_4_1 + WaitMutex_4_4 <= 2)) AND ((MesBuffReply_1_1 + MesBuffReply_1_2 + MesBuffReply_1_3 + MesBuffReply_1_4 + MesBuffReply_2_1 + MesBuffReply_2_2 + MesBuffReply_2_3 + MesBuffReply_2_4 + MesBuffReply_3_1 + MesBuffReply_3_2 + MesBuffReply_3_3 + MesBuffReply_3_4 + MesBuffReply_4_1 + MesBuffReply_4_2 + MesBuffReply_4_3 + MesBuffReply_4_4 + 1 <= Active_2_1 + Active_2_2 + Active_2_3 + Active_2_4 + Active_3_1 + Active_3_2 + Active_3_3 + Active_3_4 + Active_4_1 + Active_4_2 + Active_4_3 + Active_4_4 + Active_1_1 + Active_1_2 + Active_1_3 + Active_1_4) OR (Message_1_1 + Message_1_2 + Message_1_3 + Message_1_4 + Message_2_1 + Message_2_2 + Message_2_3 + Message_2_4 + Message_3_1 + Message_3_2 + Message_3_3 + Message_3_4 + Message_4_1 + Message_4_2 + Message_4_3 + Message_4_4 <= 2)))
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DatabaseWithMutex-PT-04-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file DatabaseWithMutex-PT-04-ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no no yes yes yes no yes no no yes no yes no
lola:
preliminary result: no yes yes no no yes yes yes no yes no no yes no yes no
sara: try reading problem file DatabaseWithMutex-PT-04-ReachabilityCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: memory consumption: 27464 KB
lola: time consumption: 1 seconds


BK_STOP 1526609595065

--------------------
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="DatabaseWithMutex-PT-04"
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/DatabaseWithMutex-PT-04.tgz
mv DatabaseWithMutex-PT-04 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 DatabaseWithMutex-PT-04, 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 r076-blw3-152649936700047"
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 ;