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-155246598300041.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-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r099-smll-155246598300041
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.5K Feb 11 22:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 11 22:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 7 23:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 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.5K Feb 5 00:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 00:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.9K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 4 06:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 06:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Jan 31 23:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 38K 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-2-LTLCardinality-00
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-01
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-02
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-03
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-04
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-05
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-06
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-07
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-08
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-09
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-10
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-11
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-12
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-13
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-14
FORMULA_NAME LamportFastMutEx-COL-2-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552763646890

info: Time: 3600 - MCC
===========================================================================================
prep: translating LamportFastMutEx-COL-2 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-2 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ LamportFastMutEx-COL-2 @ 3569 seconds
lola: LoLA will run for 3569 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-COL-2-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (3 <= p6 + p8 + p10 + p11 + p9 + p7)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= p0 + p1 + p2)
lola: after: (p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (p0 + p1 + p2 <= p18 + p19 + p20)
lola: after: (1 <= p18 + p19 + p20)
lola: place invariant simplifies atomic proposition
lola: before: (p56 + p55 + p54 <= p0 + p1 + p2)
lola: after: (p56 + p55 + p54 <= 1)
lola: LP says that atomic proposition is always false: (3 <= p39 + p40 + p41)
lola: LP says that atomic proposition is always false: (3 <= p12 + p13 + p14)
lola: LP says that atomic proposition is always false: (3 <= p3 + p4 + p5)
lola: A (F (X (G ((3 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68))))) : A (FALSE) : A ((G ((3 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50)) U (p12 + p13 + p14 <= p3 + p4 + p5))) : A (F ((G ((p3 + p4 + p5 <= p24 + p25 + p26)) U F ((p56 + p55 + p54 <= p53 + p52 + p51))))) : A (X (G (X (G ((p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= 1)))))) : A ((1 <= p18 + p19 + p20)) : A ((p56 + p55 + p54 <= 1)) : A (G ((FALSE U (p24 + p25 + p26 <= p39 + p40 + p41)))) : A ((3 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50)) : A (X (F ((FALSE U (1 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50))))) : A (G (G (X (G ((p36 + p37 + p38 <= p33 + p34 + p35)))))) : A (F (X (G (F ((p12 + p13 + p14 <= p18 + p19 + p20)))))) : A (F (X (G (X (FALSE))))) : A (F (G (((1 <= p36 + p37 + p38) U (p12 + p13 + p14 <= p15 + p16 + p17))))) : A ((p3 + p4 + p5 <= p53 + p52 + p51)) : A (F (X (((p15 + p16 + p17 <= p30 + p31 + p32) U (1 <= p3 + p4 + p5)))))
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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: 33 rewrites
lola: closed formula file LamportFastMutEx-COL-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-COL-2-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p18 + p19 + p20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p18 + p19 + p20)
lola: processed formula length: 22
lola: 33 rewrites
lola: closed formula file LamportFastMutEx-COL-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

FORMULA LamportFastMutEx-COL-2-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p56 + p55 + p54 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p56 + p55 + p54 <= 1)
lola: processed formula length: 22
lola: 33 rewrites
lola: closed formula file LamportFastMutEx-COL-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

FORMULA LamportFastMutEx-COL-2-LTLCardinality-6 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: (3 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50)
lola: processed formula length: 58
lola: 33 rewrites
lola: closed formula file LamportFastMutEx-COL-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-COL-2-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 33 rewrites
lola: closed formula file LamportFastMutEx-COL-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-COL-2-LTLCardinality-12 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: (p3 + p4 + p5 <= p53 + p52 + p51)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p3 + p4 + p5 <= p53 + p52 + p51)
lola: processed formula length: 33
lola: 33 rewrites
lola: closed formula file LamportFastMutEx-COL-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-COL-2-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((p36 + p37 + p38 <= p33 + p34 + p35))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p36 + p37 + p38 <= p33 + p34 + p35))))
lola: processed formula length: 48
lola: 33 rewrites
lola: closed formula file LamportFastMutEx-COL-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
lola: ========================================

FORMULA LamportFastMutEx-COL-2-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50 <= 1)))))
lola: processed formula length: 74
lola: 33 rewrites
lola: closed formula file LamportFastMutEx-COL-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: 47 markings, 50 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-2-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 (F ((1 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50))))
lola: processed formula length: 70
lola: 33 rewrites
lola: closed formula file LamportFastMutEx-COL-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: 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
lola: ========================================

FORMULA LamportFastMutEx-COL-2-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= p3 + p4 + p5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= p3 + p4 + p5))))
lola: processed formula length: 31
lola: 33 rewrites
lola: closed formula file LamportFastMutEx-COL-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: 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-COL-2-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p24 + p25 + p26 <= p39 + p40 + p41)))
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 ((p24 + p25 + p26 <= p39 + p40 + p41)))
lola: processed formula length: 44
lola: 35 rewrites
lola: closed formula file LamportFastMutEx-COL-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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p39 + p40 + p41 + 1 <= p24 + p25 + p26)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: state equation: write sara problem file to LamportFastMutEx-COL-2-LTLCardinality-10-0.sara

FORMULA LamportFastMutEx-COL-2-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p12 + p13 + p14 <= p18 + p19 + p20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p12 + p13 + p14 <= p18 + p19 + p20))))
lola: processed formula length: 48
lola: 33 rewrites
lola: closed formula file LamportFastMutEx-COL-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: 81 markings, 90 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-2-LTLCardinality-11 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 (G ((3 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
sara: try reading problem file LamportFastMutEx-COL-2-LTLCardinality-10-0.sara.
lola: processed formula: A (F (G ((3 <= p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68))))
lola: processed formula length: 70
lola: 33 rewrites
lola: closed formula file LamportFastMutEx-COL-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
lola: ========================================

FORMULA LamportFastMutEx-COL-2-LTLCardinality-0 FALSE 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 (F (G ((F ((p12 + p13 + p14 <= p15 + p16 + p17)) AND ((1 <= p36 + p37 + p38) OR (p12 + p13 + p14 <= p15 + p16 + p17))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((F ((p12 + p13 + p14 <= p15 + p16 + p17)) AND ((1 <= p36 + p37 + p38) OR (p12 + p13 + p14 <= p15 + p16 + p17))))))
lola: processed formula length: 123
lola: 33 rewrites
lola: closed formula file LamportFastMutEx-COL-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: 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: 41 markings, 42 edges
lola: ========================================

FORMULA LamportFastMutEx-COL-2-LTLCardinality-13 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 ((F ((p56 + p55 + p54 <= p53 + p52 + p51)) OR (G ((p3 + p4 + p5 <= p24 + p25 + p26)) AND F ((p56 + p55 + p54 <= p53 + p52 + p51))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((p56 + p55 + p54 <= p53 + p52 + p51)) OR (G ((p3 + p4 + p5 <= p24 + p25 + p26)) AND F ((p56 + p55 + p54 <= p53 + p52 + p51))))))
lola: processed formula length: 138
lola: 33 rewrites
lola: closed formula file LamportFastMutEx-COL-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-COL-2-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: ...considering subproblem: A (((p12 + p13 + p14 <= p3 + p4 + p5) OR (G ((3 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50)) AND F ((p12 + p13 + p14 <= p3 + p4 + p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p12 + p13 + p14 <= p3 + p4 + p5) OR (G ((3 <= p42 + p43 + p44 + p45 + p46 + p47 + p48 + p49 + p50)) AND F ((p12 + p13 + p14 <= p3 + p4 + p5)))))
lola: processed formula length: 149
lola: 33 rewrites
lola: closed formula file LamportFastMutEx-COL-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-COL-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 no no no no no no no yes
lola:
preliminary result: no no yes yes no no yes no no no no no no no no yes

lola: memory consumption: 18172 KB
lola: time consumption: 0 seconds

BK_STOP 1552763647299

--------------------
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-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-COL-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-155246598300041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-2.tgz
mv LamportFastMutEx-COL-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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;