fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r055-oct2-155234418800272
Last Updated
Apr 15, 2019

About the Execution of 2018-Gold for DatabaseWithMutex-PT-04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
145.330 471.00 189.00 0.00 TTTTFFFFFTFTFFTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2019-input.r055-oct2-155234418800272.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is DatabaseWithMutex-PT-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r055-oct2-155234418800272
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 9.5K Feb 10 20:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Feb 10 20:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 6 15:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Feb 6 15:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 4.3K Feb 4 23:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 4 23:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 3 06:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 34K Feb 3 06:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jan 30 22:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Jan 30 22:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.6K Feb 4 22:19 UpperBounds.xml

-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 114K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1552708181062

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 LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ 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-LTLCardinality.task
lola: A ((1 <= all_active_4 + all_active_3 + all_active_2 + all_active_1)) : A ((F (X ((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 <= 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))) U (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 <= all_active_4 + all_active_3 + all_active_2 + all_active_1))) : A (F (X (X ((2 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4))))) : A (X (X (F (X ((2 <= all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4)))))) : A (G ((2 <= 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))) : A (G ((F ((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)) U (2 <= all_active_4 + all_active_3 + all_active_2 + all_active_1)))) : A (X (X (G (F ((2 <= 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)))))) : A (X (G (F (F ((2 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4)))))) : A ((all_passive_2 <= Acknowledge_2_3)) : A ((updating_4_4 <= all_passive_4)) : A (F ((Mutex_1 <= WaitMutex_4_1))) : A (F ((Active_2_3 <= Message_1_1))) : A (X (F ((all_passive_1 <= updating_2_1)))) : A ((G (X ((RecBuff_3_3 <= Active_1_4))) U G (F ((WaitMutex_1_4 <= Active_1_3))))) : A (X (F (F (F ((Active_4_3 <= Active_4_2)))))) : A (G ((X ((MesBuffReply_1_2 <= Modify_1_1)) U F ((updating_4_3 <= updating_1_4)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= all_active_4 + all_active_3 + all_active_2 + all_active_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= all_active_4 + all_active_3 + all_active_2 + all_active_1)
lola: processed formula length: 64
lola: 19 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-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: (all_passive_2 <= Acknowledge_2_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (all_passive_2 <= Acknowledge_2_3)
lola: processed formula length: 34
lola: 19 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.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 DatabaseWithMutex-PT-04-LTLCardinality-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: (updating_4_4 <= all_passive_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (updating_4_4 <= all_passive_4)
lola: processed formula length: 31
lola: 19 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-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: A (X (X (X (F ((2 <= all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((2 <= all_passive_1 + all_passive_2 + all_passive_3 + all_passive_4))))))
lola: processed formula length: 88
lola: 19 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 593 markings, 1392 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-3 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: A ((X (F ((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 <= 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 + Wait... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((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 <= 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 + Wait... (shortened)
lola: processed formula length: 845
lola: 19 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((2 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((2 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4)))))
lola: processed formula length: 60
lola: 19 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 129 markings, 224 edges
lola: ========================================

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

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-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: A (X (F ((Active_4_3 <= Active_4_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((Active_4_3 <= Active_4_2))))
lola: processed formula length: 38
lola: 19 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 17 markings, 16 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= 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)))
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 ((2 <= 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)))
lola: processed formula length: 236
lola: 21 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (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)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-4 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 (F ((Mutex_1 <= WaitMutex_4_1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (WaitMutex_4_1 + 1 <= Mutex_1)
lola: processed formula length: 30
lola: 21 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 19 markings, 19 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-10 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 (F ((Active_2_3 <= Message_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (Message_1_1 + 1 <= Active_2_3)
lola: processed formula length: 31
lola: 21 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((WaitMutex_1_4 <= Active_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((WaitMutex_1_4 <= Active_1_3))))
lola: processed formula length: 41
lola: 19 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 273 markings, 280 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((updating_4_3 <= updating_1_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((updating_4_3 <= updating_1_4))))
lola: processed formula length: 42
lola: 19 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5702 markings, 6018 edges
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-15 FALSE 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 (F ((2 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= Mutex_1 + Mutex_2 + Mutex_3 + Mutex_4))))
lola: processed formula length: 56
lola: 19 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 76924 markings, 100433 edges
lola: ========================================

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

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((2 <= all_active_4 + all_active_3 + all_active_2 + all_active_1)))) AND A (G ((F ((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)) OR (2 <= all_active_4 + all_active_3 + all_active_2 + all_active_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= all_active_4 + all_active_3 + all_active_2 + all_active_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= all_active_4 + all_active_3 + all_active_2 + all_active_1))))
lola: processed formula length: 76
lola: 19 rewrites
lola: closed formula file DatabaseWithMutex-PT-04-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 84 markings, 85 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA DatabaseWithMutex-PT-04-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no no no no yes no yes no no yes no
lola:
preliminary result: yes yes yes yes no no no no no yes no yes no no yes no
lola: memory consumption: 18908 KB
lola: time consumption: 0 seconds

BK_STOP 1552708181533

--------------------
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="LTLCardinality"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool win2018"
echo " Input is DatabaseWithMutex-PT-04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r055-oct2-155234418800272"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-PT-04.tgz
mv DatabaseWithMutex-PT-04 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;