About the Execution of 2018-Gold for PermAdmissibility-COL-01
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
171.970 | 23076.00 | 23786.00 | 27.40 | TFTFTTTTTFTTTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2019-input.r110-oct2-155272242300122.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is PermAdmissibility-COL-01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r110-oct2-155272242300122
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 220K
-rw-r--r-- 1 mcc users 3.6K Feb 12 04:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 12 04:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 8 03:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 8 03:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 111 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 349 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 00:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.4K Feb 5 00:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 4 07:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 4 07:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 1 02:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 1 02:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 54K 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 PermAdmissibility-COL-01-LTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-01-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1553035466954
info: Time: 3600 - MCC
===========================================================================================
prep: translating PermAdmissibility-COL-01 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PermAdmissibility-COL-01 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ PermAdmissibility-COL-01 @ 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: 1232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 6656
lola: finding significant places
lola: 208 places, 1024 transitions, 177 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1460 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-01-LTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188)
lola: LP says that atomic proposition is always false: (2 <= p120)
lola: LP says that atomic proposition is always false: (2 <= p35)
lola: LP says that atomic proposition is always false: (3 <= p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33)
lola: LP says that atomic proposition is always false: (2 <= p93)
lola: LP says that atomic proposition is always false: (3 <= p16)
lola: LP says that atomic proposition is always false: (2 <= p92)
lola: A (X (F (F ((p34 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24))))) : A (FALSE) : A (F (X ((1 <= p111)))) : A ((G (X (FALSE)) U G (F ((1 <= p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51))))) : A ((2 <= p88 + p87 + p86 + p85 + p84 + p89 + p90 + p91)) : A ((p120 <= p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155)) : A (((p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188) U X (F ((p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 <= p198))))) : A (X ((F (FALSE) U X ((2 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83))))) : A ((((p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75 <= p92) U FALSE) U X (X ((p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75 <= p120))))) : A (G (G (G (X ((2 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43)))))) : A ((p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75)) : A ((p16 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75)) : A ((p100 + p101 + p94 + p95 + p96 + p97 + p98 + p99 <= p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109)) : A (F (X (G (X (FALSE))))) : A (FALSE) : A (G (FALSE))
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:185
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:157
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k: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:151
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 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: 35 rewrites
lola: closed formula file PermAdmissibility-COL-01-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 PermAdmissibility-COL-01-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p88 + p87 + p86 + p85 + p84 + p89 + p90 + p91)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p88 + p87 + p86 + p85 + p84 + p89 + p90 + p91)
lola: processed formula length: 52
lola: 35 rewrites
lola: closed formula file PermAdmissibility-COL-01-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 PermAdmissibility-COL-01-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p120 <= p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p120 <= p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155)
lola: processed formula length: 63
lola: 35 rewrites
lola: closed formula file PermAdmissibility-COL-01-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 PermAdmissibility-COL-01-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75)
lola: processed formula length: 104
lola: 35 rewrites
lola: closed formula file PermAdmissibility-COL-01-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 PermAdmissibility-COL-01-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p16 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p16 <= p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75)
lola: processed formula length: 54
lola: 35 rewrites
lola: closed formula file PermAdmissibility-COL-01-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 PermAdmissibility-COL-01-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p100 + p101 + p94 + p95 + p96 + p97 + p98 + p99 <= p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p100 + p101 + p94 + p95 + p96 + p97 + p98 + p99 <= p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109)
lola: processed formula length: 106
lola: 35 rewrites
lola: closed formula file PermAdmissibility-COL-01-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 PermAdmissibility-COL-01-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 354 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: 35 rewrites
lola: closed formula file PermAdmissibility-COL-01-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 PermAdmissibility-COL-01-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 394 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: 35 rewrites
lola: closed formula file PermAdmissibility-COL-01-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 PermAdmissibility-COL-01-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 443 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: 35 rewrites
lola: closed formula file PermAdmissibility-COL-01-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 PermAdmissibility-COL-01-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((p34 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p34 <= p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24))))
lola: processed formula length: 66
lola: 35 rewrites
lola: closed formula file PermAdmissibility-COL-01-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: 5 markings, 4 edges
lola: ========================================
FORMULA PermAdmissibility-COL-01-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 591 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= p111))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= p111))))
lola: processed formula length: 23
lola: 35 rewrites
lola: closed formula file PermAdmissibility-COL-01-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: 9 markings, 8 edges
lola: ========================================
FORMULA PermAdmissibility-COL-01-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188) U X (F ((p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 <= p198)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 <= p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188) U X (F ((p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 <= p198)))))
lola: processed formula length: 192
lola: 35 rewrites
lola: closed formula file PermAdmissibility-COL-01-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: 5 markings, 4 edges
lola: ========================================
FORMULA PermAdmissibility-COL-01-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 886 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((2 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((2 <= p82 + p81 + p80 + p79 + p78 + p77 + p76 + p83))))
lola: processed formula length: 64
lola: 35 rewrites
lola: closed formula file PermAdmissibility-COL-01-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: 9 markings, 8 edges
lola: ========================================
FORMULA PermAdmissibility-COL-01-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1182 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75 <= p120))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((p74 + p73 + p72 + p71 + p70 + p69 + p68 + p75 <= p120))))
lola: processed formula length: 67
lola: 35 rewrites
lola: closed formula file PermAdmissibility-COL-01-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: 9 markings, 8 edges
lola: ========================================
FORMULA PermAdmissibility-COL-01-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1773 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((2 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((2 <= p36 + p37 + p38 + p39 + p40 + p41 + p42 + p43))))
lola: processed formula length: 64
lola: 35 rewrites
lola: closed formula file PermAdmissibility-COL-01-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: 17 markings, 17 edges
lola: ========================================
FORMULA PermAdmissibility-COL-01-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3546 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= p44 + p45 + p46 + p47 + p48 + p49 + p50 + p51))))
lola: processed formula length: 64
lola: 35 rewrites
lola: closed formula file PermAdmissibility-COL-01-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: 27 markings, 30 edges
lola: ========================================
FORMULA PermAdmissibility-COL-01-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no yes yes yes yes yes no yes yes yes no no no
lola:
preliminary result: yes no yes no yes yes yes yes yes no yes yes yes no no no
lola: memory consumption: 21504 KB
lola: time consumption: 23 seconds
BK_STOP 1553035490030
--------------------
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="PermAdmissibility-COL-01"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool win2018"
echo " Input is PermAdmissibility-COL-01, 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 r110-oct2-155272242300122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-01.tgz
mv PermAdmissibility-COL-01 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 ;