About the Execution of 2018-Gold for AirplaneLD-PT-0010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
148.570 | 450.00 | 70.00 | 2.50 | FTTFFFTFTFFFTFTF | 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.r011-smll-155225030100092.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 AirplaneLD-PT-0010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-smll-155225030100092
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 7.4K Feb 9 05:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 9 05:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 5 02:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K Feb 5 02:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 105 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 343 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 4.2K Feb 4 22:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 4 22:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K Feb 4 22:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 1 23:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 1 23:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Jan 29 09:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Jan 29 09:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 4 22:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 85K 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 AirplaneLD-PT-0010-LTLCardinality-00
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-01
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-02
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-03
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-04
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-05
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-06
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-07
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-08
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-09
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-10
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-11
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-12
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-13
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-14
FORMULA_NAME AirplaneLD-PT-0010-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552338984604
info: Time: 3600 - MCC
===========================================================================================
prep: translating AirplaneLD-PT-0010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating AirplaneLD-PT-0010 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ AirplaneLD-PT-0010 @ 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: 177/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2848
lola: finding significant places
lola: 89 places, 88 transitions, 54 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 75 transition conflict sets
lola: TASK
lola: reading formula from AirplaneLD-PT-0010-LTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= P4)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= AltitudePossibleVal_9 + AltitudePossibleVal_8 + AltitudePossibleVal_7 + AltitudePossibleVal_6 + AltitudePossibleVal_5 + AltitudePossibleVal_4 + AltitudePossibleVal_3 + AltitudePossibleVal_2 + AltitudePossibleVal_1 + AltitudePossibleVal_10 + AltitudePossibleVal_11 + AltitudePossibleVal_12 + AltitudePossibleVal_13 + AltitudePossibleVal_14 + AltitudePossibleVal_15 + AltitudePossibleVal_16 + AltitudePossibleVal_17 + AltitudePossibleVal_18 + AltitudePossibleVal_19 + AltitudePossibleVal_20)
lola: after: (0 <= 18)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (stp4 <= WeightPossibleVal_on + WeightPossibleVal_off)
lola: after: (stp4 <= 2)
lola: LP says that atomic proposition is always true: (stp4 <= 2)
lola: place invariant simplifies atomic proposition
lola: before: (stp4 <= SpeedPossibleVal_5 + SpeedPossibleVal_6 + SpeedPossibleVal_7 + SpeedPossibleVal_8 + SpeedPossibleVal_9 + SpeedPossibleVal_4 + SpeedPossibleVal_3 + SpeedPossibleVal_2 + SpeedPossibleVal_1 + SpeedPossibleVal_10)
lola: after: (stp4 <= 10)
lola: LP says that atomic proposition is always true: (stp4 <= 10)
lola: LP says that atomic proposition is always false: (2 <= Speed_Right_Wheel_10 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 + Speed_Right_Wheel_4 + Speed_Right_Wheel_5 + Speed_Right_Wheel_6 + Speed_Right_Wheel_7 + Speed_Right_Wheel_8 + Speed_Right_Wheel_9)
lola: LP says that atomic proposition is always false: (3 <= stp4)
lola: LP says that atomic proposition is always false: (3 <= TheAltitude_10 + TheAltitude_11 + TheAltitude_12 + TheAltitude_13 + TheAltitude_14 + TheAltitude_15 + TheAltitude_16 + TheAltitude_17 + TheAltitude_18 + TheAltitude_19 + TheAltitude_20 + TheAltitude_1 + TheAltitude_2 + TheAltitude_3 + TheAltitude_4 + TheAltitude_5 + TheAltitude_6 + TheAltitude_7 + TheAltitude_8 + TheAltitude_9)
lola: place invariant simplifies atomic proposition
lola: before: (Speed_Right_Wheel_5 <= SpeedPossibleVal_4)
lola: after: (Speed_Right_Wheel_5 <= 1)
lola: LP says that atomic proposition is always true: (Speed_Right_Wheel_5 <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (AltitudePossibleVal_19 <= Speed_Left_Wheel_3)
lola: after: (1 <= Speed_Left_Wheel_3)
lola: place invariant simplifies atomic proposition
lola: before: (WeightPossibleVal_on <= Speed_Left_Wheel_4)
lola: after: (1 <= Speed_Left_Wheel_4)
lola: place invariant simplifies atomic proposition
lola: before: (AltitudePossibleVal_19 <= Speed_Left_Wheel_10)
lola: after: (1 <= Speed_Left_Wheel_10)
lola: place invariant simplifies atomic proposition
lola: before: (AltitudePossibleVal_12 <= AltitudePossibleVal_17)
lola: after: (0 <= 0)
lola: always true
lola: place invariant simplifies atomic proposition
lola: before: (Plane_On_Ground_Signal_no_F <= WeightPossibleVal_off)
lola: after: (Plane_On_Ground_Signal_no_F <= 1)
lola: LP says that atomic proposition is always true: (Plane_On_Ground_Signal_no_F <= 1)
lola: place invariant simplifies atomic proposition
lola: before: (SpeedPossibleVal_10 <= Speed_Right_Wheel_8)
lola: after: (1 <= Speed_Right_Wheel_8)
lola: A (G (X ((FALSE U (stp4 <= Speed_Right_Wheel_10 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 + Speed_Right_Wheel_4 + Speed_Right_Wheel_5 + Speed_Right_Wheel_6 + Speed_Right_Wheel_7 + Speed_Right_Wheel_8 + Speed_Right_Wheel_9))))) : A (X (TRUE)) : A (X (G ((TRUE U TRUE)))) : A (((FALSE U (1 <= Weight_Left_Wheel_on + Weight_Left_Wheel_off)) U G (G (FALSE)))) : A (X (X (((1 <= P6) U (1 <= P3))))) : A (X ((G (FALSE) U G ((1 <= P4))))) : A (F (F (((Weight_Left_Wheel_on + Weight_Left_Wheel_off <= P6) U (P1 <= P5))))) : A (G (G (F (F ((1 <= stp3)))))) : A (X (TRUE)) : A ((1 <= Speed_Left_Wheel_3)) : A (X (X (F ((1 <= Speed_Left_Wheel_4))))) : A (X (F (X (G ((1 <= Speed_Left_Wheel_10)))))) : A (F (TRUE)) : A (G (G (G (X ((Speed_Right_Wheel_1 <= Speed_Right_Wheel_3)))))) : A (TRUE) : A (X (G (X (X ((1 <= Speed_Right_Wheel_8))))))
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:180
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:185
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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: 40 rewrites
lola: closed formula file AirplaneLD-PT-0010-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 AirplaneLD-PT-0010-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= Speed_Left_Wheel_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= Speed_Left_Wheel_3)
lola: processed formula length: 25
lola: 40 rewrites
lola: closed formula file AirplaneLD-PT-0010-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 AirplaneLD-PT-0010-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 40 rewrites
lola: closed formula file AirplaneLD-PT-0010-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 AirplaneLD-PT-0010-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 40 rewrites
lola: closed formula file AirplaneLD-PT-0010-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 AirplaneLD-PT-0010-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 (X (((1 <= P6) U (1 <= P3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((1 <= P6) U (1 <= P3)))))
lola: processed formula length: 35
lola: 40 rewrites
lola: closed formula file AirplaneLD-PT-0010-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: 7 markings, 7 edges
lola: ========================================
FORMULA AirplaneLD-PT-0010-LTLCardinality-4 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: A (X (G ((1 <= P4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((1 <= P4))))
lola: processed formula length: 21
lola: 40 rewrites
lola: closed formula file AirplaneLD-PT-0010-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: 7 markings, 7 edges
lola:
FORMULA AirplaneLD-PT-0010-LTLCardinality-5 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 (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 40 rewrites
lola: closed formula file AirplaneLD-PT-0010-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: 45 markings, 44 edges
lola: ========================================
FORMULA AirplaneLD-PT-0010-LTLCardinality-8 TRUE 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 (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 40 rewrites
lola: closed formula file AirplaneLD-PT-0010-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: 45 markings, 44 edges
lola: ========================================
FORMULA AirplaneLD-PT-0010-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((1 <= Speed_Left_Wheel_4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((1 <= Speed_Left_Wheel_4)))))
lola: processed formula length: 41
lola: 40 rewrites
lola: closed formula file AirplaneLD-PT-0010-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: 7 markings, 7 edges
lola: ========================================
FORMULA AirplaneLD-PT-0010-LTLCardinality-10 FALSE 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 (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 40 rewrites
lola: closed formula file AirplaneLD-PT-0010-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: 45 markings, 44 edges
lola:
FORMULA AirplaneLD-PT-0010-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((Speed_Right_Wheel_1 <= Speed_Right_Wheel_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((Speed_Right_Wheel_1 <= Speed_Right_Wheel_3))))
lola: processed formula length: 56
lola: 40 rewrites
lola: closed formula file AirplaneLD-PT-0010-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: 64 markings, 121 edges
lola:
FORMULA AirplaneLD-PT-0010-LTLCardinality-13 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 (X (G ((stp4 <= Speed_Right_Wheel_10 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 + Speed_Right_Wheel_4 + Speed_Right_Wheel_5 + Speed_Right_Wheel_6 + Speed_Right_Wheel_7 + Speed_Right_Wheel_8 + Speed_Right_Wheel_9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((stp4 <= Speed_Right_Wheel_10 + Speed_Right_Wheel_1 + Speed_Right_Wheel_2 + Speed_Right_Wheel_3 + Speed_Right_Wheel_4 + Speed_Right_Wheel_5 + Speed_Right_Wheel_6 + Speed_Right_Wheel_7 + Speed_Right_Wheel_8 + Speed_Right_Wheel_9))))
lola: processed formula length: 240
lola: 40 rewrites
lola: closed formula file AirplaneLD-PT-0010-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: 7 markings, 7 edges
FORMULA AirplaneLD-PT-0010-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((1 <= Speed_Right_Wheel_8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((1 <= Speed_Right_Wheel_8))))))
lola: processed formula length: 46
lola: 40 rewrites
lola: closed formula file AirplaneLD-PT-0010-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: 7 markings, 7 edges
lola: ========================================
FORMULA AirplaneLD-PT-0010-LTLCardinality-15 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 ((P1 <= P5)))
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: (P5 + 1 <= P1)
lola: processed formula length: 14
lola: 42 rewrites
lola: closed formula file AirplaneLD-PT-0010-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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 8489 markings, 8892 edges
lola: ========================================
FORMULA AirplaneLD-PT-0010-LTLCardinality-6 TRUE 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 (G (F ((1 <= stp3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= stp3))))
lola: processed formula length: 23
lola: 40 rewrites
lola: closed formula file AirplaneLD-PT-0010-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: 9 markings, 9 edges
lola: ========================================
FORMULA AirplaneLD-PT-0010-LTLCardinality-7 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 (G ((1 <= Speed_Left_Wheel_10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= Speed_Left_Wheel_10))))
lola: processed formula length: 38
lola: 40 rewrites
lola: closed formula file AirplaneLD-PT-0010-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: 9 markings, 10 edges
lola: ========================================
FORMULA AirplaneLD-PT-0010-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no no no yes no yes no no no yes no yes no
lola:
preliminary result: no yes yes no no no yes no yes no no no yes no yes no
lola: memory consumption: 18084 KB
lola: time consumption: 1 seconds
BK_STOP 1552338985054
--------------------
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="AirplaneLD-PT-0010"
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 AirplaneLD-PT-0010, 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 r011-smll-155225030100092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AirplaneLD-PT-0010.tgz
mv AirplaneLD-PT-0010 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 ;