About the Execution of 2018-Gold for SmallOperatingSystem-PT-MT0064DC0016
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2098.370 | 63039.00 | 66750.00 | 19.70 | FFTTFFTTTTFFTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2019-input.r165-csrt-155286442000122.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off 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 SmallOperatingSystem-PT-MT0064DC0016, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-csrt-155286442000122
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.4K Feb 12 18:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 12 18:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 9 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 9 02:05 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 123 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 361 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.1K Feb 5 01:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 5 01:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 4 20:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 4 20:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 1 20:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 1 20:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 13 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 8.2K 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 SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-00
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-01
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-02
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-03
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-04
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-05
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-06
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-07
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-08
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-09
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1553109980607
info: Time: 3600 - MCC
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT0064DC0016 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SmallOperatingSystem-PT-MT0064DC0016 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ SmallOperatingSystem-PT-MT0064DC0016 @ 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: 17/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 10 transition conflict sets
lola: TASK
lola: reading formula from SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality.task
lola: LP says that atomic proposition is always true: (CPUUnit <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (2 <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (1 <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (TaskSuspended <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (TransferToDisk <= TaskOnDisk)
lola: A (F ((F ((2 <= TransferToDisk)) U G ((DiskControllerUnit <= ExecutingTask))))) : A (X (G (X ((1 <= TaskSuspended))))) : A (TRUE) : A (X ((X ((TaskReady <= FreeMemSegment)) U X ((TaskSuspended <= FreeMemSegment))))) : A (G ((X ((FreeMemSegment <= CPUUnit)) U G ((2 <= DiskControllerUnit))))) : A (F ((G ((3 <= TaskReady)) U (1 <= ExecutingTask)))) : A (F (X ((TaskReady <= DiskControllerUnit)))) : A (F (F (TRUE))) : A (G ((G ((2 <= ExecutingTask)) U X (TRUE)))) : A ((X (X (TRUE)) U X (F ((TransferToDisk <= LoadingMem))))) : A (X (((1 <= TaskSuspended) U (2 <= LoadingMem)))) : A ((3 <= TransferToDisk)) : A (F ((F ((TaskOnDisk <= TaskReady)) U X ((3 <= FreeMemSegment))))) : A (F (F (((TransferToDisk <= FreeMemSegment) U (3 <= TaskSuspended))))) : A ((TaskReady <= FreeMemSegment)) : A (X ((TRUE U X ((TaskReady <= FreeMemSegment)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:151
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:142
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-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 SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-2 TRUE 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-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 SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-7 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: (3 <= TransferToDisk)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= TransferToDisk)
lola: processed formula length: 21
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-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 SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-11 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: (TaskReady <= FreeMemSegment)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (TaskReady <= FreeMemSegment)
lola: processed formula length: 29
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-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 SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-14 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: A (X (F ((TaskReady <= DiskControllerUnit))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((TaskReady <= DiskControllerUnit))))
lola: processed formula length: 45
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-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: 2 markings, 1 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-6 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 (X (G ((1 <= TaskSuspended)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((1 <= TaskSuspended)))))
lola: processed formula length: 36
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-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: 130 markings, 130 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-1 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 (G ((X (TRUE) OR (G ((2 <= ExecutingTask)) AND X (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X (TRUE) OR (G ((2 <= ExecutingTask)) AND X (TRUE)))))
lola: processed formula length: 61
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality.task
lola: the resulting Büchi automaton has 6 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: 2978596 markings, 7721236 edges, 595719 markings/sec, 0 secs
lola: 5542677 markings, 14843210 edges, 512816 markings/sec, 5 secs
lola: 8028059 markings, 21805018 edges, 497076 markings/sec, 10 secs
lola: 10518934 markings, 29011275 edges, 498175 markings/sec, 15 secs
lola: 12646889 markings, 36783615 edges, 425591 markings/sec, 20 secs
lola: 12654252 markings, 44226845 edges, 1473 markings/sec, 25 secs
lola: 12679134 markings, 50716245 edges, 4976 markings/sec, 30 secs
lola: 12686413 markings, 57659024 edges, 1456 markings/sec, 35 secs
lola: 12748709 markings, 65167970 edges, 12459 markings/sec, 40 secs
lola: 12773454 markings, 72795000 edges, 4949 markings/sec, 45 secs
lola: 12802873 markings, 80119555 edges, 5884 markings/sec, 50 secs
lola: 12857644 markings, 87770336 edges, 10954 markings/sec, 55 secs
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: 12902796 markings, 92156184 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 389 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((TransferToDisk <= LoadingMem))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((TransferToDisk <= LoadingMem))))
lola: processed formula length: 42
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-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: 2 markings, 1 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= TaskSuspended) U (2 <= LoadingMem))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((1 <= TaskSuspended) U (2 <= LoadingMem))))
lola: processed formula length: 50
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-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: 130 markings, 130 edges
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 501 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((TaskReady <= FreeMemSegment) U (TaskSuspended <= FreeMemSegment)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((TaskReady <= FreeMemSegment) U (TaskSuspended <= FreeMemSegment)))))
lola: processed formula length: 79
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-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: 4 markings, 3 edges
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((3 <= FreeMemSegment))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((3 <= FreeMemSegment))))
lola: processed formula length: 33
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-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: 2 markings, 1 edges
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 701 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((2 <= DiskControllerUnit)))) AND A (G ((X ((FreeMemSegment <= CPUUnit)) OR G ((2 <= DiskControllerUnit))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 701 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= DiskControllerUnit))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= DiskControllerUnit))))
lola: processed formula length: 37
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-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: 19 markings, 20 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 876 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((TaskReady <= FreeMemSegment)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((TaskReady <= FreeMemSegment)))))
lola: processed formula length: 45
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-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: 4 markings, 3 edges
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1169 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= TaskSuspended)))
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: (TaskSuspended <= 2)
lola: processed formula length: 20
lola: 34 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-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: 3 markings, 3 edges
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1753 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((DiskControllerUnit <= ExecutingTask))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((DiskControllerUnit <= ExecutingTask))))
lola: processed formula length: 49
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-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: 131 markings, 132 edges
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3507 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= ExecutingTask) OR (G ((3 <= TaskReady)) AND F ((1 <= ExecutingTask))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((1 <= ExecutingTask) OR (G ((3 <= TaskReady)) AND F ((1 <= ExecutingTask))))))
lola: processed formula length: 85
lola: 32 rewrites
lola: closed formula file SmallOperatingSystem-PT-MT0064DC0016-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 838 markings, 1559 edges
FORMULA SmallOperatingSystem-PT-MT0064DC0016-LTLCardinality-5 FALSE 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 yes yes yes no no yes no yes yes
lola:
preliminary result: no no yes yes no no yes yes yes yes no no yes no yes yes
lola: ========================================
lola: memory consumption: 19384 KB
lola: time consumption: 63 seconds
BK_STOP 1553110043646
--------------------
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="SmallOperatingSystem-PT-MT0064DC0016"
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 SmallOperatingSystem-PT-MT0064DC0016, 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 r165-csrt-155286442000122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT0064DC0016.tgz
mv SmallOperatingSystem-PT-MT0064DC0016 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 ;