About the Execution of 2018-Gold for LamportFastMutEx-PT-2
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
147.960 | 426.00 | 138.00 | 0.00 | FFTTFFTFTFTTTTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2019-input.r099-smll-155246598300062.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
Input is LamportFastMutEx-PT-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r099-smll-155246598300062
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 5.1K Feb 11 22:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 11 22:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 7 23:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 7 23:31 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 108 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 346 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.5K Feb 5 00:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 5 00:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Feb 4 06:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 4 06:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jan 31 23:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Jan 31 23:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 46K 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 LamportFastMutEx-PT-2-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-PT-2-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552778931467
info: Time: 3600 - MCC
===========================================================================================
prep: translating LamportFastMutEx-PT-2 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating LamportFastMutEx-PT-2 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ LamportFastMutEx-PT-2 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 165/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 69
lola: finding significant places
lola: 69 places, 96 transitions, 52 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 137 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-PT-2-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (3 <= P-b_1_true + P-b_2_false + P-b_0_false + P-b_2_true + P-b_1_false + P-b_0_true)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1 <= x_0 + x_1 + x_2)
lola: after: (P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (x_0 + x_1 + x_2 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2)
lola: after: (1 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2)
lola: place invariant simplifies atomic proposition
lola: before: (P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 <= x_0 + x_1 + x_2)
lola: after: (P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 <= 1)
lola: LP says that atomic proposition is always false: (3 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2)
lola: LP says that atomic proposition is always true: (P-setbi_5_0 <= P-ify0_4_0)
lola: LP says that atomic proposition is always true: (P-start_1_0 <= P-done_1_1)
lola: LP says that atomic proposition is always true: (P-awaity_0 <= P-wait_1_0)
lola: LP says that atomic proposition is always true: (P-setbi_24_0 <= P-done_1_2)
lola: LP says that atomic proposition is always true: (P-b_0_false <= P-wait_2_2)
lola: LP says that atomic proposition is always true: (P-start_1_0 <= P-sety_9_0)
lola: LP says that atomic proposition is always true: (P-done_0_0 <= P-done_1_2)
lola: LP says that atomic proposition is always true: (P-done_0_1 <= P-setbi_5_2)
lola: LP says that atomic proposition is always true: (P-start_1_0 <= P-CS_21_2)
lola: LP says that atomic proposition is always true: (P-wait_0_0 <= P-done_2_1)
lola: A (F (X (G ((3 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2))))) : A (FALSE) : A ((G ((3 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1)) U (P-sety_9_0 + P-sety_9_1 + P-sety_9_2 <= P-start_1_0 + P-start_1_1 + P-start_1_2))) : A (F ((G ((P-start_1_0 + P-start_1_1 + P-start_1_2 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0)) U F ((P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 <= P-awaity_0 + P-awaity_1 + P-awaity_2))))) : A (X (G (X (G ((P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1 <= 1)))))) : A ((1 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2)) : A ((P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 <= 1)) : A (G ((FALSE U (P-CS_21_2 + P-CS_21_1 + P-CS_21_0 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2)))) : A (((TRUE U TRUE) U (TRUE U TRUE))) : A (X ((P-b_2_true <= P-CS_21_0))) : A (TRUE) : A (G (X (F (F (TRUE))))) : A (X (G (F (X (TRUE))))) : A (G (X (G (F ((P-setx_3_1 <= P-ify0_4_2)))))) : A (F ((G ((P-awaity_2 <= P-ifyi_15_1)) U X (TRUE)))) : A ((F (TRUE) U ((P-b_1_false <= P-ify0_4_0) U TRUE)))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 50 rewrites
lola: closed formula file LamportFastMutEx-PT-2-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA LamportFastMutEx-PT-2-LTLCardinality-1 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: (1 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2)
lola: processed formula length: 46
lola: 50 rewrites
lola: closed formula file LamportFastMutEx-PT-2-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 LamportFastMutEx-PT-2-LTLCardinality-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: (P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 <= 1)
lola: processed formula length: 49
lola: 50 rewrites
lola: closed formula file LamportFastMutEx-PT-2-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 LamportFastMutEx-PT-2-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 50 rewrites
lola: closed formula file LamportFastMutEx-PT-2-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA LamportFastMutEx-PT-2-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 50 rewrites
lola: closed formula file LamportFastMutEx-PT-2-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA LamportFastMutEx-PT-2-LTLCardinality-10 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 50 rewrites
lola: closed formula file LamportFastMutEx-PT-2-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA LamportFastMutEx-PT-2-LTLCardinality-15 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 (X (G ((P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1 <= 1)))))
lola: processed formula length: 137
lola: 50 rewrites
lola: closed formula file LamportFastMutEx-PT-2-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 19 markings, 19 edges
FORMULA LamportFastMutEx-PT-2-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 50 rewrites
lola: closed formula file LamportFastMutEx-PT-2-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: 3 markings, 2 edges
lola: ========================================
FORMULA LamportFastMutEx-PT-2-LTLCardinality-11 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 (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 50 rewrites
lola: closed formula file LamportFastMutEx-PT-2-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: 3 markings, 2 edges
lola: ========================================
FORMULA LamportFastMutEx-PT-2-LTLCardinality-12 TRUE 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 ((X (TRUE) OR (G ((P-awaity_2 <= P-ifyi_15_1)) AND X (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X (TRUE) OR (G ((P-awaity_2 <= P-ifyi_15_1)) AND X (TRUE)))))
lola: processed formula length: 68
lola: 50 rewrites
lola: closed formula file LamportFastMutEx-PT-2-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: 5 markings, 4 edges
lola: ========================================
FORMULA LamportFastMutEx-PT-2-LTLCardinality-14 TRUE 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 (X ((P-b_2_true <= P-CS_21_0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((P-b_2_true <= P-CS_21_0)))
lola: processed formula length: 33
lola: 50 rewrites
lola: closed formula file LamportFastMutEx-PT-2-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 19 markings, 19 edges
FORMULA LamportFastMutEx-PT-2-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((P-CS_21_2 + P-CS_21_1 + P-CS_21_0 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((P-CS_21_2 + P-CS_21_1 + P-CS_21_0 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2)))
lola: processed formula length: 86
lola: 52 rewrites
lola: closed formula file LamportFastMutEx-PT-2-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: 6 markings, 5 edges
lola: ========================================
FORMULA LamportFastMutEx-PT-2-LTLCardinality-7 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 ((P-setx_3_1 <= P-ify0_4_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((P-setx_3_1 <= P-ify0_4_2))))
lola: processed formula length: 38
lola: 50 rewrites
lola: closed formula file LamportFastMutEx-PT-2-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 392 markings, 698 edges
FORMULA LamportFastMutEx-PT-2-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((3 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((3 <= P-done_0_0 + P-done_0_1 + P-done_0_2 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_2_0 + P-done_2_1 + P-done_2_2))))
lola: processed formula length: 133
lola: 50 rewrites
lola: closed formula file LamportFastMutEx-PT-2-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: 11 markings, 12 edges
FORMULA LamportFastMutEx-PT-2-LTLCardinality-0 FALSE 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 (F ((F ((P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 <= P-awaity_0 + P-awaity_1 + P-awaity_2)) OR (G ((P-start_1_0 + P-start_1_1 + P-start_1_2 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0)) AND F ((P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 <= P-awaity_0 + P-awaity_1 + P-awaity_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 <= P-awaity_0 + P-awaity_1 + P-awaity_2)) OR (G ((P-start_1_0 + P-start_1_1 + P-start_1_2 <= P-CS_21_2 + P-CS_21_1 + P-CS_21_0)) AND F ((P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 <= P-awaity_0 + P-awaity_1 + P-awaity_2))))))
lola: processed formula length: 279
lola: 50 rewrites
lola: closed formula file LamportFastMutEx-PT-2-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: 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: 1 markings, 0 edges
FORMULA LamportFastMutEx-PT-2-LTLCardinality-3 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 (((P-sety_9_0 + P-sety_9_1 + P-sety_9_2 <= P-start_1_0 + P-start_1_1 + P-start_1_2) OR (G ((3 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1)) AND F ((P-sety_9_0 + P-sety_9_1 + P-sety_9_2 <= P-start_1_0 + P-start_1_1 + P-start_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((P-sety_9_0 + P-sety_9_1 + P-sety_9_2 <= P-start_1_0 + P-start_1_1 + P-start_1_2) OR (G ((3 <= P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_2_2 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_2_0 + P-wait_2_1)) AND F ((P-sety_9_0 + P-sety_9_1 + P-sety_9_2 <= P-start_1_0 + P-start_1_1 + P-start_1_2)))))
lola: processed formula length: 308
lola: 50 rewrites
lola: closed formula file LamportFastMutEx-PT-2-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: 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: 1 markings, 0 edges
lola: ========================================
FORMULA LamportFastMutEx-PT-2-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes no no yes no yes no yes yes yes yes yes yes
lola:
preliminary result: no no yes yes no no yes no yes no yes yes yes yes yes yes
lola: memory consumption: 19160 KB
lola: time consumption: 0 seconds
BK_STOP 1552778931893
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-PT-2"
export BK_EXAMINATION="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-3957"
echo " Executing tool win2018"
echo " Input is LamportFastMutEx-PT-2, 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 r099-smll-155246598300062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-PT-2.tgz
mv LamportFastMutEx-PT-2 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 '
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 ;