About the Execution of 2018-Gold for LamportFastMutEx-COL-3
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
175.020 | 1377.00 | 1074.00 | 37.30 | TFTFFFFFFFTFFFTT | 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-155246598300044.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-COL-3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r099-smll-155246598300044
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.7K Feb 11 22:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 11 22:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 7 23:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Feb 7 23:32 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 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 5 00:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 4 06:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 4 06:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Jan 31 23:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Jan 31 23:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 39K 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-COL-3-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-COL-3-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552763702390
info: Time: 3600 - MCC
===========================================================================================
prep: translating LamportFastMutEx-COL-3 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating LamportFastMutEx-COL-3 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ LamportFastMutEx-COL-3 @ 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: 256/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 100
lola: finding significant places
lola: 100 places, 156 transitions, 74 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 222 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-COL-3-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (p4 + p5 + p6 + p7 <= p91 + p90 + p89 + p88)
lola: after: (1 <= p91 + p90 + p89 + p88)
lola: A (G (F ((1 <= p91 + p90 + p89 + p88)))) : A ((G (F ((1 <= p96 + p97 + p98 + p99))) U F (G ((p87 + p86 + p85 + p84 <= p64 + p65 + p66 + p67))))) : A ((F ((p44 + p45 + p46 + p47 <= p16 + p17 + p18 + p19)) U ((1 <= p87 + p86 + p85 + p84) U (p0 + p1 + p2 + p3 <= p60 + p61 + p62 + p63)))) : A (X (X ((p44 + p45 + p46 + p47 <= p0 + p1 + p2 + p3)))) : A ((X (X ((2 <= p16 + p17 + p18 + p19))) U (3 <= p91 + p90 + p89 + p88))) : A (G ((p16 + p17 + p18 + p19 <= p44 + p45 + p46 + p47))) : A (X (G (((1 <= p60 + p61 + p62 + p63) U (1 <= p12 + p13 + p14 + p15))))) : A (G (X ((2 <= p64 + p65 + p66 + p67)))) : A (F (X (G (F ((p92 + p93 + p94 + p95 <= p16 + p17 + p18 + p19)))))) : A (F (F (((3 <= p8 + p9 + p10 + p11) U (2 <= p60 + p61 + p62 + p63))))) : A (F (X (F ((p64 + p65 + p66 + p67 <= p20 + p21 + p22 + p23))))) : A (X (((p8 + p9 + p10 + p11 <= p87 + p86 + p85 + p84) U G ((p0 + p1 + p2 + p3 <= p12 + p13 + p14 + p15))))) : A (F ((F ((1 <= p44 + p45 + p46 + p47)) U (2 <= p96 + p97 + p98 + p99)))) : A ((3 <= p64 + p65 + p66 + p67)) : A ((p0 + p1 + p2 + p3 <= p16 + p17 + p18 + p19)) : A (X (X ((p20 + p21 + p22 + p23 <= p12 + p13 + p14 + p15))))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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: (3 <= p64 + p65 + p66 + p67)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p64 + p65 + p66 + p67)
lola: processed formula length: 28
lola: 14 rewrites
lola: closed formula file LamportFastMutEx-COL-3-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-COL-3-LTLCardinality-13 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: (p0 + p1 + p2 + p3 <= p16 + p17 + p18 + p19)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 + p1 + p2 + p3 <= p16 + p17 + p18 + p19)
lola: processed formula length: 44
lola: 14 rewrites
lola: closed formula file LamportFastMutEx-COL-3-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-COL-3-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((1 <= p12 + p13 + p14 + p15)) AND ((1 <= p60 + p61 + p62 + p63) OR (1 <= p12 + p13 + p14 + p15))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((1 <= p12 + p13 + p14 + p15)) AND ((1 <= p60 + p61 + p62 + p63) OR (1 <= p12 + p13 + p14 + p15))))))
lola: processed formula length: 113
lola: 14 rewrites
lola: closed formula file LamportFastMutEx-COL-3-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: 1460 markings, 3302 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-3-LTLCardinality-6 FALSE 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 (G ((2 <= p64 + p65 + p66 + p67))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((2 <= p64 + p65 + p66 + p67))))
lola: processed formula length: 40
lola: 14 rewrites
lola: closed formula file LamportFastMutEx-COL-3-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: 25 markings, 25 edges
FORMULA LamportFastMutEx-COL-3-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p64 + p65 + p66 + p67 <= p20 + p21 + p22 + p23))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p64 + p65 + p66 + p67 <= p20 + p21 + p22 + p23))))
lola: processed formula length: 60
lola: 14 rewrites
lola: closed formula file LamportFastMutEx-COL-3-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: 4 markings, 3 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-3-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: A (X (((p8 + p9 + p10 + p11 <= p87 + p86 + p85 + p84) U G ((p0 + p1 + p2 + p3 <= p12 + p13 + p14 + p15)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p8 + p9 + p10 + p11 <= p87 + p86 + p85 + p84) U G ((p0 + p1 + p2 + p3 <= p12 + p13 + p14 + p15)))))
lola: processed formula length: 107
lola: 14 rewrites
lola: closed formula file LamportFastMutEx-COL-3-LTLCardinality.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: 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: 54 markings, 59 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-3-LTLCardinality-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 (X (X ((p44 + p45 + p46 + p47 <= p0 + p1 + p2 + p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((p44 + p45 + p46 + p47 <= p0 + p1 + p2 + p3))))
lola: processed formula length: 56
lola: 14 rewrites
lola: closed formula file LamportFastMutEx-COL-3-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: 25 markings, 25 edges
FORMULA LamportFastMutEx-COL-3-LTLCardinality-3 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 (X ((2 <= p16 + p17 + p18 + p19))) U (3 <= p91 + p90 + p89 + p88)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((2 <= p16 + p17 + p18 + p19))) U (3 <= p91 + p90 + p89 + p88)))
lola: processed formula length: 73
lola: 14 rewrites
lola: closed formula file LamportFastMutEx-COL-3-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: 25 markings, 25 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-3-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((p20 + p21 + p22 + p23 <= p12 + p13 + p14 + p15))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((p20 + p21 + p22 + p23 <= p12 + p13 + p14 + p15))))
lola: processed formula length: 60
lola: 14 rewrites
lola: closed formula file LamportFastMutEx-COL-3-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: 10 markings, 12 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-3-LTLCardinality-15 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 (G ((p16 + p17 + p18 + p19 <= p44 + p45 + p46 + p47)))
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 ((p16 + p17 + p18 + p19 <= p44 + p45 + p46 + p47)))
lola: processed formula length: 56
lola: 16 rewrites
lola: closed formula file LamportFastMutEx-COL-3-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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p44 + p45 + p46 + p47 + 1 <= p16 + p17 + p18 + p19)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-3-LTLCardinality-9-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-3-LTLCardinality-5 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 ((2 <= p96 + p97 + p98 + p99)))
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: (p96 + p97 + p98 + p99 <= 1)
lola: processed formula length: 28
lola: 16 rewrites
lola: closed formula file LamportFastMutEx-COL-3-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: 10 markings, 10 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-3-LTLCardinality-12 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 (F ((2 <= p60 + p61 + p62 + p63)))
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: (p60 + p61 + p62 + p63 <= 1)
lola: processed formula length: 28
lola: 16 rewrites
lola: closed formula file LamportFastMutEx-COL-3-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: 22 markings, 22 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-3-LTLCardinality-9 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 ((1 <= p91 + p90 + p89 + p88))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= p91 + p90 + p89 + p88))))
lola: processed formula length: 40
lola: 14 rewrites
lola: closed formula file LamportFastMutEx-COL-3-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: 36069 markings, 127090 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-3-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p92 + p93 + p94 + p95 <= p16 + p17 + p18 + p19))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p92 + p93 + p94 + p95 <= p16 + p17 + p18 + p19))))
lola: processed formula length: 60
lola: 14 rewrites
lola: closed formula file LamportFastMutEx-COL-3-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: 284 markings, 385 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-3-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((p87 + p86 + p85 + p84 <= p64 + p65 + p66 + p67))) OR (G (F ((1 <= p96 + p97 + p98 + p99))) AND F (G ((p87 + p86 + p85 + p84 <= p64 + p65 + p66 + p67))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G ((p87 + p86 + p85 + p84 <= p64 + p65 + p66 + p67))) OR (G (F ((1 <= p96 + p97 + p98 + p99))) AND F (G ((p87 + p86 + p85 + p84 <= p64 + p65 + p66 + p67))))))
lola: processed formula length: 165
lola: 14 rewrites
lola: closed formula file LamportFastMutEx-COL-3-LTLCardinality.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: 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: 562 markings, 639 edges
lola: ========================================
FORMULA LamportFastMutEx-COL-3-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((p44 + p45 + p46 + p47 <= p16 + p17 + p18 + p19)) U ((1 <= p87 + p86 + p85 + p84) U (p0 + p1 + p2 + p3 <= p60 + p61 + p62 + p63))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((p44 + p45 + p46 + p47 <= p16 + p17 + p18 + p19)) U ((1 <= p87 + p86 + p85 + p84) U (p0 + p1 + p2 + p3 <= p60 + p61 + p62 + p63))))
lola: processed formula length: 138
lola: 14 rewrites
lola: closed formula file LamportFastMutEx-COL-3-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: 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-COL-3-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no no no no no no no yes no no no yes yes
lola:
preliminary result: yes no yes no no no no no no no yes no no no yes yes
lola: memory consumption: 19528 KB
lola: time consumption: 1 seconds
BK_STOP 1552763703767
--------------------
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-COL-3"
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-COL-3, 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-155246598300044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-3.tgz
mv LamportFastMutEx-COL-3 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 ;