About the Execution of 2018-Gold for DatabaseWithMutex-PT-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
146.320 | 249.00 | 392.00 | 0.00 | FFF?TFTTFFFFFFFF | 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-155234418800270.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-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r055-oct2-155234418800270
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 6.2K Feb 10 20:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 10 20:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 6 15:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 6 15:47 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 3.2K Feb 4 23:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 12K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 3 06:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 3 06:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Jan 30 22:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Jan 30 22:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.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 29K 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-02-LTLFireability-00
FORMULA_NAME DatabaseWithMutex-PT-02-LTLFireability-01
FORMULA_NAME DatabaseWithMutex-PT-02-LTLFireability-02
FORMULA_NAME DatabaseWithMutex-PT-02-LTLFireability-03
FORMULA_NAME DatabaseWithMutex-PT-02-LTLFireability-04
FORMULA_NAME DatabaseWithMutex-PT-02-LTLFireability-05
FORMULA_NAME DatabaseWithMutex-PT-02-LTLFireability-06
FORMULA_NAME DatabaseWithMutex-PT-02-LTLFireability-07
FORMULA_NAME DatabaseWithMutex-PT-02-LTLFireability-08
FORMULA_NAME DatabaseWithMutex-PT-02-LTLFireability-09
FORMULA_NAME DatabaseWithMutex-PT-02-LTLFireability-10
FORMULA_NAME DatabaseWithMutex-PT-02-LTLFireability-11
FORMULA_NAME DatabaseWithMutex-PT-02-LTLFireability-12
FORMULA_NAME DatabaseWithMutex-PT-02-LTLFireability-13
FORMULA_NAME DatabaseWithMutex-PT-02-LTLFireability-14
FORMULA_NAME DatabaseWithMutex-PT-02-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1552708158540
info: Time: 3600 - MCC
===========================================================================================
prep: translating DatabaseWithMutex-PT-02 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating DatabaseWithMutex-PT-02 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ DatabaseWithMutex-PT-02 @ 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: 70/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1216
lola: finding significant places
lola: 38 places, 32 transitions, 28 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 46 transition conflict sets
lola: TASK
lola: reading formula from DatabaseWithMutex-PT-02-LTLFireability.task
lola: A (G (G ((FIREABLE(Release_1_2) OR FIREABLE(Release_2_2) OR FIREABLE(Release_1_1) OR FIREABLE(Release_2_1))))) : A (X ((FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2)))) : A ((F (G ((FIREABLE(Update_1_2) OR FIREABLE(Update_2_2) OR FIREABLE(Update_1_1) OR FIREABLE(Update_2_1)))) U G ((FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2))))) : A (((FIREABLE(Release_1_2) OR FIREABLE(Release_2_2) OR FIREABLE(Release_1_1) OR FIREABLE(Release_2_1)) U F (((FIREABLE(Update_1_2) OR FIREABLE(Update_2_2) OR FIREABLE(Update_1_1) OR FIREABLE(Update_2_1)) U (FIREABLE(Start_1_1) OR FIREABLE(Start_2_1) OR FIREABLE(Start_2_2) OR FIREABLE(Start_1_2)))))) : A (G (F (F (X ((FIREABLE(SendReply_2_2) OR FIREABLE(SendReply_1_2) OR FIREABLE(SendReply_2_1) OR FIREABLE(SendReply_1_1))))))) : A (((F ((FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2))) U (FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2))) U G (G (X ((FIREABLE(SendMsg_1_1) OR FIREABLE(SendMsg_2_1) OR FIREABLE(SendMsg_2_2) OR FIREABLE(SendMsg_1_2))))))) : A (F ((G ((FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2))) U F (F ((FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2))))))) : A ((X ((FIREABLE(Change_1_1) OR FIREABLE(Change_1_2) OR FIREABLE(Change_2_2) OR FIREABLE(Change_2_1))) U F (X ((FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR FIREABLE(Acquire_2_2) OR FIREABLE(Acquire_1_2)))))) : A (F (G (G (G (F (FIREABLE(Acquire_1_2))))))) : A (G (F ((X (FIREABLE(Update_2_2)) U X (FIREABLE(Acquire_2_2)))))) : A (((F (FIREABLE(SendMsg_1_1)) U G (FIREABLE(SendMsg_2_1))) U FIREABLE(Acquire_1_2))) : A (F (FIREABLE(Update_2_1))) : A ((X (F (G (FIREABLE(Start_2_2)))) U FIREABLE(end_update_2_1))) : A (F (G (FIREABLE(SendReply_2_2)))) : A (FIREABLE(Update_2_2)) : A (F (F (FIREABLE(Acquire_1_1))))
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(Update_2_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(Update_2_2)
lola: processed formula length: 20
lola: 30 rewrites
lola: closed formula file DatabaseWithMutex-PT-02-LTLFireability.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-02-LTLFireability-14 FALSE 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: A (((F ((FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2))) U (FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2))) U X (G ((FIREABLE(SendMsg_1_1) OR FIREABLE(SendMsg_2_1) OR FIREABLE(SendMsg_2_2) OR FIREABLE(SendMsg_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F ((FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2))) U (FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2))) U X (G ((FIREABLE(SendMsg_1_1) OR FIREABLE(SendMsg_2_1) OR FIREABLE(SendMsg_2_2) OR FIREABLE(SendMsg_1_2))))))
lola: processed formula length: 353
lola: 30 rewrites
lola: closed formula file DatabaseWithMutex-PT-02-LTLFireability.task
lola: the resulting Büchi automaton has 7 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: 210 markings, 510 edges
lola: ========================================
FORMULA DatabaseWithMutex-PT-02-LTLFireability-5 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: A (X (F ((FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR FIREABLE(Acquire_2_2) OR FIREABLE(Acquire_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((FIREABLE(Acquire_2_1) OR FIREABLE(Acquire_1_1) OR FIREABLE(Acquire_2_2) OR FIREABLE(Acquire_1_2)))))
lola: processed formula length: 113
lola: 30 rewrites
lola: closed formula file DatabaseWithMutex-PT-02-LTLFireability.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: 5 markings, 4 edges
FORMULA DatabaseWithMutex-PT-02-LTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2))))
lola: processed formula length: 121
lola: 30 rewrites
lola: closed formula file DatabaseWithMutex-PT-02-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 18 markings, 18 edges
lola: ========================================
FORMULA DatabaseWithMutex-PT-02-LTLFireability-1 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: A (G ((FIREABLE(Release_1_2) OR FIREABLE(Release_2_2) OR FIREABLE(Release_1_1) OR FIREABLE(Release_2_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 ((FIREABLE(Release_1_2) OR FIREABLE(Release_2_2) OR FIREABLE(Release_1_1) OR FIREABLE(Release_2_1))))
lola: processed formula length: 109
lola: 32 rewrites
lola: closed formula file DatabaseWithMutex-PT-02-LTLFireability.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: (NOT FIREABLE(Release_1_2) AND NOT FIREABLE(Release_2_2) AND NOT FIREABLE(Release_1_1) AND NOT FIREABLE(Release_2_1))
lola: state equation: Generated DNF with 64 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to DatabaseWithMutex-PT-02-LTLFireability-4-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 DatabaseWithMutex-PT-02-LTLFireability-0 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: A (F (FIREABLE(Update_2_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: NOT FIREABLE(Update_2_1)
lola: processed formula length: 24
lola: 32 rewrites
lola: closed formula file DatabaseWithMutex-PT-02-LTLFireability.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: 9 markings, 9 edges
lola: ========================================
FORMULA DatabaseWithMutex-PT-02-LTLFireability-11 FALSE 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 (F (FIREABLE(Acquire_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: NOT FIREABLE(Acquire_1_1)
lola: processed formula length: 25
lola: 32 rewrites
lola: closed formula file DatabaseWithMutex-PT-02-LTLFireability.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: 8 markings, 8 edges
lola: ========================================
FORMULA DatabaseWithMutex-PT-02-LTLFireability-15 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 (F ((FIREABLE(Start_1_1) OR FIREABLE(Start_2_1) OR FIREABLE(Start_2_2) OR FIREABLE(Start_1_2))))
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: (NOT FIREABLE(Start_1_1) AND NOT FIREABLE(Start_2_1) AND NOT FIREABLE(Start_2_2) AND NOT FIREABLE(Start_1_2))
lola: processed formula length: 109
lola: 32 rewrites
lola: closed formula file DatabaseWithMutex-PT-02-LTLFireability.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-02-LTLFireability-3 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 (F (G (FIREABLE(SendReply_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(SendReply_2_2))))
lola: processed formula length: 35
lola: 30 rewrites
lola: closed formula file DatabaseWithMutex-PT-02-LTLFireability.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: 26 markings, 28 edges
lola: ========================================
FORMULA DatabaseWithMutex-PT-02-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(Acquire_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(Acquire_2_2))))
lola: processed formula length: 33
lola: 30 rewrites
lola: closed formula file DatabaseWithMutex-PT-02-LTLFireability.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: 9 markings, 9 edges
lola: ========================================
FORMULA DatabaseWithMutex-PT-02-LTLFireability-9 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 (F (FIREABLE(Acquire_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(Acquire_1_2))))
lola: processed formula length: 33
lola: 30 rewrites
lola: closed formula file DatabaseWithMutex-PT-02-LTLFireability.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: 9 markings, 9 edges
lola: ========================================
FORMULA DatabaseWithMutex-PT-02-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(end_update_2_1) OR (F (FIREABLE(end_update_2_1)) AND F (G (FIREABLE(Start_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(end_update_2_1) OR (F (FIREABLE(end_update_2_1)) AND F (G (FIREABLE(Start_2_2))))))
lola: processed formula length: 96
lola: 30 rewrites
lola: closed formula file DatabaseWithMutex-PT-02-LTLFireability.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: 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: 31 markings, 33 edges
lola: ========================================
FORMULA DatabaseWithMutex-PT-02-LTLFireability-12 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 (((F (FIREABLE(SendMsg_1_1)) U G (FIREABLE(SendMsg_2_1))) U FIREABLE(Acquire_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F (FIREABLE(SendMsg_1_1)) U G (FIREABLE(SendMsg_2_1))) U FIREABLE(Acquire_1_2)))
lola: processed formula length: 85
lola: 30 rewrites
lola: closed formula file DatabaseWithMutex-PT-02-LTLFireability.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 9 markings, 9 edges
lola: ========================================
FORMULA DatabaseWithMutex-PT-02-LTLFireability-10 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 (F ((F ((FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2))) OR (G ((FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2))) AND F ((FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2))) OR (G ((FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2))) AND F ((FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2)))))))
lola: processed formula length: 372
lola: 30 rewrites
lola: closed formula file DatabaseWithMutex-PT-02-LTLFireability.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: using ltl preserving stubborn set method (--stubborn)
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: 207 markings, 466 edges
FORMULA DatabaseWithMutex-PT-02-LTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((FIREABLE(SendReply_2_2) OR FIREABLE(SendReply_1_2) OR FIREABLE(SendReply_2_1) OR FIREABLE(SendReply_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((FIREABLE(SendReply_2_2) OR FIREABLE(SendReply_1_2) OR FIREABLE(SendReply_2_1) OR FIREABLE(SendReply_1_1)))))
lola: processed formula length: 121
lola: 30 rewrites
lola: closed formula file DatabaseWithMutex-PT-02-LTLFireability.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 191 markings, 340 edges
FORMULA DatabaseWithMutex-PT-02-LTLFireability-4 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 ((FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2))) OR (F (G ((FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2)))) AND F (G ((FIREABLE(Update_1_2) OR FIREABLE(Update_2_2) OR FIREABLE(Update_1_1) OR FIREABLE(Update_2_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2))) OR (F (G ((FIREABLE(end_update_2_1) OR FIREABLE(end_update_1_1) OR FIREABLE(end_update_1_2) OR FIREABLE(end_update_2_2)))) AND F (G ((FIREABLE(Update_1_2) OR FIREABLE(Update_2_2) OR FIREABLE(Update_1_1) OR FIREABLE(Update_2_1)))))))
lola: processed formula length: 360
lola: 30 rewrites
lola: closed formula file DatabaseWithMutex-PT-02-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 30 markings, 30 edges
FORMULA DatabaseWithMutex-PT-02-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes yes no yes yes no no no no no no no no
lola:
preliminary result: no no no yes yes no yes yes no no no no no no no no
lola: ========================================
lola: memory consumption: 14264 KB
lola: time consumption: 0 seconds
BK_STOP 1552708158789
--------------------
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-02"
export BK_EXAMINATION="LTLFireability"
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-02, examination is LTLFireability"
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-155234418800270"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-PT-02.tgz
mv DatabaseWithMutex-PT-02 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '
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 ;