fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r187-csrt-155344544200015
Last Updated
Apr 15, 2019

About the Execution of 2018-Gold for BART-PT-030

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
220.130 93065.00 97633.00 44.10 FFFFFFFTFFFFFFFF 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-155344544200015.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-030, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r187-csrt-155344544200015
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.2M
-rw-r--r-- 1 mcc users 3.8K Mar 10 19:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 10 19:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 10 19:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 10 19:11 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 3.0K Mar 10 19:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 10 19:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 10 19:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Mar 10 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 10 17:46 NewModel
-rw-r--r-- 1 mcc users 3.7K Mar 10 19:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K 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.4K Mar 10 19:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 10 19:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 7.0M 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-030-LTLFireability-00
FORMULA_NAME BART-PT-030-LTLFireability-01
FORMULA_NAME BART-PT-030-LTLFireability-02
FORMULA_NAME BART-PT-030-LTLFireability-03
FORMULA_NAME BART-PT-030-LTLFireability-04
FORMULA_NAME BART-PT-030-LTLFireability-05
FORMULA_NAME BART-PT-030-LTLFireability-06
FORMULA_NAME BART-PT-030-LTLFireability-07
FORMULA_NAME BART-PT-030-LTLFireability-08
FORMULA_NAME BART-PT-030-LTLFireability-09
FORMULA_NAME BART-PT-030-LTLFireability-10
FORMULA_NAME BART-PT-030-LTLFireability-11
FORMULA_NAME BART-PT-030-LTLFireability-12
FORMULA_NAME BART-PT-030-LTLFireability-13
FORMULA_NAME BART-PT-030-LTLFireability-14
FORMULA_NAME BART-PT-030-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1553692954149

info: Time: 3600 - MCC
===========================================================================================
prep: translating BART-PT-030 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-030 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ BART-PT-030 @ 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: 10230/65536 symbol table entries, 791 collisions
lola: preprocessing...
lola: Size of bit vector: 4170
lola: finding significant places
lola: 4170 places, 6060 transitions, 3930 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3927 transition conflict sets
lola: TASK
lola: reading formula from BART-PT-030-LTLFireability.task
lola: A (F ((F (X (FIREABLE(TrainStable_1_22_1_31_30_29_3))) U G (X (FIREABLE(AtStation_21_30)))))) : A (F (X (FIREABLE(TrainAcc_1_28_22_21_20_3)))) : A (FIREABLE(TrainAcc_3_30_32_29_28_10)) : A (FIREABLE(TrainStable_4_3_10_26_22_21_15)) : A (F (F (G (F (X (FIREABLE(TrainStable_1_6_1_10_9_8_3))))))) : A ((X (G (F (FIREABLE(TrainAcc_2_12_12_10_9_6)))) U (G (FIREABLE(TrainAcc_2_16_23_21_20_6)) U X (FIREABLE(TrainStable_1_25_1_3_2_1_3))))) : A (G (X (X (G (G (FIREABLE(TrainAcc_1_26_6_5_4_3))))))) : A (F (FIREABLE(AtStation_9_22))) : A ((FIREABLE(TrainStable_1_13_1_36_35_34_3) U (F (FIREABLE(TrainStable_1_1_1_3_2_1_3)) U X (FIREABLE(TrainStable_1_13_1_11_10_9_3))))) : A (F (F ((G (FIREABLE(TrainAcc_1_9_31_30_29_3)) U G (FIREABLE(TrainAcc_2_24_20_18_17_6)))))) : A ((X ((FIREABLE(TrainAcc_1_17_37_36_35_3) U FIREABLE(AtStation_24_39))) U FIREABLE(TrainStable_1_11_1_10_9_8_3))) : A ((F (G (F (FIREABLE(TrainAcc_2_15_24_22_21_6)))) U G (FIREABLE(AtStation_28_15)))) : A (((X (FIREABLE(TrainStable_1_28_1_23_22_21_3)) U G (FIREABLE(TrainAcc_1_2_9_8_7_3))) U F (X (X (FIREABLE(TrainStable_1_2_1_37_36_35_3)))))) : A (F (X (F (F (FIREABLE(TrainAcc_2_3_20_18_17_6)))))) : A (FIREABLE(TrainStable_1_13_1_28_27_26_3)) : A (F (F ((G (FIREABLE(TrainStable_4_27_10_34_30_29_15)) U FIREABLE(TrainStable_1_20_1_28_27_26_3)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:350
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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(TrainAcc_3_30_32_29_28_10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(TrainAcc_3_30_32_29_28_10)
lola: processed formula length: 35
lola: 35 rewrites
lola: closed formula file BART-PT-030-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-030-LTLFireability-2 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: FIREABLE(TrainStable_4_3_10_26_22_21_15)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(TrainStable_4_3_10_26_22_21_15)
lola: processed formula length: 40
lola: 35 rewrites
lola: closed formula file BART-PT-030-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-030-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(TrainStable_1_13_1_28_27_26_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(TrainStable_1_13_1_28_27_26_3)
lola: processed formula length: 39
lola: 35 rewrites
lola: closed formula file BART-PT-030-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-030-LTLFireability-14 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: A ((X (FIREABLE(TrainStable_1_25_1_3_2_1_3)) OR ((G (FIREABLE(TrainAcc_2_16_23_21_20_6)) AND X (F (FIREABLE(TrainStable_1_25_1_3_2_1_3)))) OR (G (F (FIREABLE(TrainAcc_2_12_12_10_9_6))) AND F ((X (FIREABLE(TrainStable_1_25_1_3_2_1_3)) OR (G (FIREABLE(TrainAcc_2_16_23_21_20_6)) AND X (F (FIREABLE(TrainStable_1_25_1_3_2_1_3))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (FIREABLE(TrainStable_1_25_1_3_2_1_3)) OR ((G (FIREABLE(TrainAcc_2_16_23_21_20_6)) AND X (F (FIREABLE(TrainStable_1_25_1_3_2_1_3)))) OR (G (F (FIREABLE(TrainAcc_2_12_12_10_9_6))) AND F ((X (FIREABLE(TrainStable_1_25_1_3_2_1_3)) OR (G (FIREABLE(TrainAcc_2_16_23_21_20_6)) AND X (F (FIREABLE(TrainStable_1_25_1_3_2_1_3))))))))))
lola: processed formula length: 332
lola: 35 rewrites
lola: closed formula file BART-PT-030-LTLFireability.task
lola: the resulting Büchi automaton has 35 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: 138 markings, 138 edges
lola: ========================================

FORMULA BART-PT-030-LTLFireability-5 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: A (X (X (G (FIREABLE(TrainAcc_1_26_6_5_4_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G (FIREABLE(TrainAcc_1_26_6_5_4_3)))))
lola: processed formula length: 47
lola: 35 rewrites
lola: closed formula file BART-PT-030-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: 138 markings, 138 edges

FORMULA BART-PT-030-LTLFireability-6 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 ((FIREABLE(TrainStable_1_13_1_36_35_34_3) U (F (FIREABLE(TrainStable_1_1_1_3_2_1_3)) U X (FIREABLE(TrainStable_1_13_1_11_10_9_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(TrainStable_1_13_1_36_35_34_3) U (F (FIREABLE(TrainStable_1_1_1_3_2_1_3)) U X (FIREABLE(TrainStable_1_13_1_11_10_9_3)))))
lola: processed formula length: 134
lola: 35 rewrites
lola: closed formula file BART-PT-030-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: ========================================
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: 138 markings, 138 edges
lola: ========================================

FORMULA BART-PT-030-LTLFireability-8 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 ((FIREABLE(TrainAcc_1_17_37_36_35_3) U FIREABLE(AtStation_24_39))) U FIREABLE(TrainStable_1_11_1_10_9_8_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((FIREABLE(TrainAcc_1_17_37_36_35_3) U FIREABLE(AtStation_24_39))) U FIREABLE(TrainStable_1_11_1_10_9_8_3)))
lola: processed formula length: 114
lola: 35 rewrites
lola: closed formula file BART-PT-030-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: 147 markings, 147 edges
lola:
========================================
FORMULA BART-PT-030-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((X (FIREABLE(TrainStable_1_28_1_23_22_21_3)) U G (FIREABLE(TrainAcc_1_2_9_8_7_3))) U X (X (F (FIREABLE(TrainStable_1_2_1_37_36_35_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((X (FIREABLE(TrainStable_1_28_1_23_22_21_3)) U G (FIREABLE(TrainAcc_1_2_9_8_7_3))) U X (X (F (FIREABLE(TrainStable_1_2_1_37_36_35_3))))))
lola: processed formula length: 141
lola: 35 rewrites
lola: closed formula file BART-PT-030-LTLFireability.task
lola: the resulting Büchi automaton has 12 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: 138 markings, 138 edges
lola: ========================================

FORMULA BART-PT-030-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (FIREABLE(TrainAcc_2_3_20_18_17_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(TrainAcc_2_3_20_18_17_6))))
lola: processed formula length: 45
lola: 35 rewrites
lola: closed formula file BART-PT-030-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: 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: 138 markings, 138 edges
lola: ========================================

FORMULA BART-PT-030-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (FIREABLE(TrainAcc_1_28_22_21_20_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(TrainAcc_1_28_22_21_20_3))))
lola: processed formula length: 46
lola: 35 rewrites
lola: closed formula file BART-PT-030-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: 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: 138 markings, 138 edges
lola: ========================================

FORMULA BART-PT-030-LTLFireability-1 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 (FIREABLE(AtStation_9_22)))
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(AtStation_9_22)
lola: processed formula length: 28
lola: 37 rewrites
lola: closed formula file BART-PT-030-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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA BART-PT-030-LTLFireability-7 TRUE 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 (G (FIREABLE(AtStation_21_30))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(AtStation_21_30))))
lola: processed formula length: 37
lola: 35 rewrites
lola: closed formula file BART-PT-030-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: 90 markings, 91 edges

FORMULA BART-PT-030-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(TrainStable_1_6_1_10_9_8_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(TrainStable_1_6_1_10_9_8_3))))
lola: processed formula length: 48
lola: 35 rewrites
lola: closed formula file BART-PT-030-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: ========================================
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: 89 markings, 89 edges

FORMULA BART-PT-030-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G (FIREABLE(AtStation_28_15)) OR (G (F (FIREABLE(TrainAcc_2_15_24_22_21_6))) AND F (G (FIREABLE(AtStation_28_15))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (FIREABLE(AtStation_28_15)) OR (G (F (FIREABLE(TrainAcc_2_15_24_22_21_6))) AND F (G (FIREABLE(AtStation_28_15))))))
lola: processed formula length: 121
lola: 35 rewrites
lola: closed formula file BART-PT-030-LTLFireability.task
lola: the resulting Büchi automaton has 8 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: 607 markings, 826 edges, 121 markings/sec, 0 secs
lola: 1607 markings, 2791 edges, 200 markings/sec, 5 secs
lola: 2697 markings, 5161 edges, 218 markings/sec, 10 secs
lola: 3780 markings, 7709 edges, 217 markings/sec, 15 secs
lola: 4793 markings, 9679 edges, 203 markings/sec, 20 secs
lola: 5774 markings, 11903 edges, 196 markings/sec, 25 secs
lola: 6775 markings, 14132 edges, 200 markings/sec, 30 secs
lola: 7766 markings, 16393 edges, 198 markings/sec, 35 secs
lola: 11554 markings, 24589 edges, 758 markings/sec, 40 secs
lola: 12678 markings, 27171 edges, 225 markings/sec, 45 secs
lola: 13598 markings, 29467 edges, 184 markings/sec, 50 secs
lola: 17284 markings, 37804 edges, 737 markings/sec, 55 secs
lola: 18514 markings, 40537 edges, 246 markings/sec, 60 secs
lola: 19550 markings, 42960 edges, 207 markings/sec, 65 secs
lola: 23519 markings, 51431 edges, 794 markings/sec, 70 secs
lola: 24493 markings, 53734 edges, 195 markings/sec, 75 secs
lola: 25951 markings, 57220 edges, 292 markings/sec, 80 secs
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: 29058 markings, 64312 edges
lola: ========================================

FORMULA BART-PT-030-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1739 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((G (FIREABLE(TrainAcc_2_24_20_18_17_6)) OR (G (FIREABLE(TrainAcc_1_9_31_30_29_3)) AND F (G (FIREABLE(TrainAcc_2_24_20_18_17_6)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G (FIREABLE(TrainAcc_2_24_20_18_17_6)) OR (G (FIREABLE(TrainAcc_1_9_31_30_29_3)) AND F (G (FIREABLE(TrainAcc_2_24_20_18_17_6)))))))
lola: processed formula length: 138
lola: 35 rewrites
lola: closed formula file BART-PT-030-LTLFireability.task
lola: the resulting Büchi automaton has 11 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: 89 markings, 89 edges

FORMULA BART-PT-030-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3478 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(TrainStable_1_20_1_28_27_26_3) OR (G (FIREABLE(TrainStable_4_27_10_34_30_29_15)) AND F (FIREABLE(TrainStable_1_20_1_28_27_26_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((FIREABLE(TrainStable_1_20_1_28_27_26_3) OR (G (FIREABLE(TrainStable_4_27_10_34_30_29_15)) AND F (FIREABLE(TrainStable_1_20_1_28_27_26_3))))))
lola: processed formula length: 148
lola: 35 rewrites
lola: closed formula file BART-PT-030-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: 89 markings, 89 edges
lola: ========================================

FORMULA BART-PT-030-LTLFireability-15 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 yes no no no no no no no no
lola:
preliminary result: no no no no no no no yes no no no no no no no no
lola: memory consumption: 36936 KB
lola: time consumption: 93 seconds

BK_STOP 1553693047214

--------------------
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-030"
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-030, 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-155344544200015"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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