About the Execution of 2018-Gold for BART-PT-040
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
226.500 | 10613.00 | 10895.00 | 15.00 | FFFFFFFFFFFFFFFF | 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.r187-csrt-155344544200018.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 BART-PT-040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r187-csrt-155344544200018
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.5M
-rw-r--r-- 1 mcc users 4.2K Mar 10 19:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 10 19:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 10 19:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 10 19:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:46 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:46 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K Mar 10 19:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Mar 10 19:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 10 19:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K Mar 10 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 10 17:46 NewModel
-rw-r--r-- 1 mcc users 5.2K Mar 10 19:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 10 19:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 102 Mar 10 18:58 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 340 Mar 10 18:58 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.6K Mar 10 19:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 10 19:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 10 19:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 10 19:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 10 17:46 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 10 17:46 instance
-rw-r--r-- 1 mcc users 6 Mar 10 17:46 iscolored
-rw-r--r-- 1 mcc users 9.3M Mar 10 17:46 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 BART-PT-040-LTLFireability-00
FORMULA_NAME BART-PT-040-LTLFireability-01
FORMULA_NAME BART-PT-040-LTLFireability-02
FORMULA_NAME BART-PT-040-LTLFireability-03
FORMULA_NAME BART-PT-040-LTLFireability-04
FORMULA_NAME BART-PT-040-LTLFireability-05
FORMULA_NAME BART-PT-040-LTLFireability-06
FORMULA_NAME BART-PT-040-LTLFireability-07
FORMULA_NAME BART-PT-040-LTLFireability-08
FORMULA_NAME BART-PT-040-LTLFireability-09
FORMULA_NAME BART-PT-040-LTLFireability-10
FORMULA_NAME BART-PT-040-LTLFireability-11
FORMULA_NAME BART-PT-040-LTLFireability-12
FORMULA_NAME BART-PT-040-LTLFireability-13
FORMULA_NAME BART-PT-040-LTLFireability-14
FORMULA_NAME BART-PT-040-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1553692955954
info: Time: 3600 - MCC
===========================================================================================
prep: translating BART-PT-040 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating BART-PT-040 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ BART-PT-040 @ 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: 13570/65536 symbol table entries, 1252 collisions
lola: preprocessing...
lola: Size of bit vector: 5490
lola: finding significant places
lola: 5490 places, 8080 transitions, 5240 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5207 transition conflict sets
lola: TASK
lola: reading formula from BART-PT-040-LTLFireability.task
lola: A (G ((G (F (FIREABLE(AtStation_38_26))) U FIREABLE(TrainStable_27_1_1_35_34_33_3)))) : A (G (((FIREABLE(AtStation_36_37) U FIREABLE(TrainAcc_10_2_39_37_36_6)) U X (G (FIREABLE(TrainStable_32_1_1_12_11_10_3)))))) : A (G (X (FIREABLE(TrainAcc_5_3_37_34_33_10)))) : A (FIREABLE(TrainStable_35_4_10_27_23_22_15)) : A (FIREABLE(TrainStable_33_4_10_25_21_20_15)) : A (FIREABLE(TrainStable_26_1_1_3_2_1_3)) : A (G (X (G ((FIREABLE(TrainAcc_3_1_16_15_14_3) U FIREABLE(TrainAcc_10_1_16_15_14_3)))))) : A (X (X (F (X (G (FIREABLE(AtStation_17_31))))))) : A ((X (X (FIREABLE(TrainAcc_9_1_40_39_38_3))) U F ((FIREABLE(TrainStable_38_4_10_31_27_26_15) U FIREABLE(TrainAcc_29_2_12_10_9_6))))) : A (X ((X (G (FIREABLE(TrainStop_5))) U G (FIREABLE(TrainStable_19_3_6_11_8_7_10))))) : A (FIREABLE(TrainAcc_31_2_22_20_19_6)) : A (X (X ((F (FIREABLE(TrainDecc_23_2_3_4_2_1_6)) U X (FIREABLE(AtStation_32_13)))))) : A (F (G (F (X (FIREABLE(TrainAcc_27_2_36_34_33_6)))))) : A (G (F (G (X (G (FIREABLE(TrainAcc_7_1_33_32_31_3))))))) : A (F (X (X ((FIREABLE(TrainStable_38_4_10_16_12_11_15) U FIREABLE(TrainAcc_26_1_28_27_26_3)))))) : A (FIREABLE(TrainAcc_23_1_36_35_34_3))
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:380
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(TrainStable_35_4_10_27_23_22_15)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(TrainStable_35_4_10_27_23_22_15)
lola: processed formula length: 41
lola: 34 rewrites
lola: closed formula file BART-PT-040-LTLFireability.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
FORMULA BART-PT-040-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(TrainStable_33_4_10_25_21_20_15)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(TrainStable_33_4_10_25_21_20_15)
lola: processed formula length: 41
lola: 34 rewrites
lola: closed formula file BART-PT-040-LTLFireability.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
FORMULA BART-PT-040-LTLFireability-4 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: FIREABLE(TrainStable_26_1_1_3_2_1_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(TrainStable_26_1_1_3_2_1_3)
lola: processed formula length: 36
lola: 34 rewrites
lola: closed formula file BART-PT-040-LTLFireability.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 BART-PT-040-LTLFireability-5 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: FIREABLE(TrainAcc_31_2_22_20_19_6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(TrainAcc_31_2_22_20_19_6)
lola: processed formula length: 34
lola: 34 rewrites
lola: closed formula file BART-PT-040-LTLFireability.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 BART-PT-040-LTLFireability-10 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: FIREABLE(TrainAcc_23_1_36_35_34_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(TrainAcc_23_1_36_35_34_3)
lola: processed formula length: 34
lola: 34 rewrites
lola: closed formula file BART-PT-040-LTLFireability.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 BART-PT-040-LTLFireability-15 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 ((F (FIREABLE(TrainAcc_10_1_16_15_14_3)) AND (FIREABLE(TrainAcc_3_1_16_15_14_3) OR FIREABLE(TrainAcc_10_1_16_15_14_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F (FIREABLE(TrainAcc_10_1_16_15_14_3)) AND (FIREABLE(TrainAcc_3_1_16_15_14_3) OR FIREABLE(TrainAcc_10_1_16_15_14_3))))))
lola: processed formula length: 130
lola: 34 rewrites
lola: closed formula file BART-PT-040-LTLFireability.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: 165 markings, 165 edges
lola: ========================================
FORMULA BART-PT-040-LTLFireability-6 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 ((X (G (FIREABLE(TrainStop_5))) U G (FIREABLE(TrainStable_19_3_6_11_8_7_10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X (G (FIREABLE(TrainStop_5))) U G (FIREABLE(TrainStable_19_3_6_11_8_7_10)))))
lola: processed formula length: 84
lola: 34 rewrites
lola: closed formula file BART-PT-040-LTLFireability.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 165 markings, 165 edges
lola: ========================================
FORMULA BART-PT-040-LTLFireability-9 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 (G (FIREABLE(TrainAcc_5_3_37_34_33_10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (FIREABLE(TrainAcc_5_3_37_34_33_10))))
lola: processed formula length: 46
lola: 34 rewrites
lola: closed formula file BART-PT-040-LTLFireability.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: 165 markings, 165 edges
lola: ========================================
FORMULA BART-PT-040-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((F (FIREABLE(TrainDecc_23_2_3_4_2_1_6)) U X (FIREABLE(AtStation_32_13))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((F (FIREABLE(TrainDecc_23_2_3_4_2_1_6)) U X (FIREABLE(AtStation_32_13))))))
lola: processed formula length: 84
lola: 34 rewrites
lola: closed formula file BART-PT-040-LTLFireability.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: 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: 1131 markings, 1131 edges
lola: ========================================
FORMULA BART-PT-040-LTLFireability-11 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 (X (F (FIREABLE(TrainAcc_26_1_28_27_26_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F (FIREABLE(TrainAcc_26_1_28_27_26_3)))))
lola: processed formula length: 50
lola: 34 rewrites
lola: closed formula file BART-PT-040-LTLFireability.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: 165 markings, 165 edges
lola: ========================================
FORMULA BART-PT-040-LTLFireability-14 FALSE 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 (F (G (FIREABLE(TrainStable_32_1_1_12_11_10_3)))) AND A (G (((FIREABLE(AtStation_36_37) U FIREABLE(TrainAcc_10_2_39_37_36_6)) OR X (G (FIREABLE(TrainStable_32_1_1_12_11_10_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(TrainStable_32_1_1_12_11_10_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(TrainStable_32_1_1_12_11_10_3))))
lola: processed formula length: 51
lola: 34 rewrites
lola: closed formula file BART-PT-040-LTLFireability.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: 65 markings, 66 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA BART-PT-040-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(TrainAcc_29_2_12_10_9_6)))
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: NOT FIREABLE(TrainAcc_29_2_12_10_9_6)
lola: processed formula length: 37
lola: 36 rewrites
lola: closed formula file BART-PT-040-LTLFireability.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: 66 markings, 66 edges
FORMULA BART-PT-040-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(TrainAcc_7_1_33_32_31_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(TrainAcc_7_1_33_32_31_3))))
lola: processed formula length: 45
lola: 34 rewrites
lola: closed formula file BART-PT-040-LTLFireability.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: 65 markings, 66 edges
lola: ========================================
FORMULA BART-PT-040-LTLFireability-13 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 (FIREABLE(AtStation_17_31))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(AtStation_17_31))))
lola: processed formula length: 37
lola: 34 rewrites
lola: closed formula file BART-PT-040-LTLFireability.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: 65 markings, 66 edges
lola: ========================================
FORMULA BART-PT-040-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1781 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(TrainAcc_27_2_36_34_33_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(TrainAcc_27_2_36_34_33_6))))
lola: processed formula length: 46
lola: 34 rewrites
lola: closed formula file BART-PT-040-LTLFireability.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: 66 markings, 66 edges
lola: ========================================
FORMULA BART-PT-040-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(TrainStable_27_1_1_35_34_33_3) OR (G (F (FIREABLE(AtStation_38_26))) AND F (FIREABLE(TrainStable_27_1_1_35_34_33_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((FIREABLE(TrainStable_27_1_1_35_34_33_3) OR (G (F (FIREABLE(AtStation_38_26))) AND F (FIREABLE(TrainStable_27_1_1_35_34_33_3))))))
lola: processed formula length: 136
lola: 34 rewrites
lola: closed formula file BART-PT-040-LTLFireability.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: 64 markings, 64 edges
lola: ========================================
FORMULA BART-PT-040-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no no no no no
lola:
preliminary result: no no no no no no no no no no no no no no no no
lola: memory consumption: 49864 KB
lola: time consumption: 10 seconds
BK_STOP 1553692966567
--------------------
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="BART-PT-040"
export BK_EXAMINATION="LTLFireability"
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 BART-PT-040, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r187-csrt-155344544200018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-040.tgz
mv BART-PT-040 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 ;