Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...................
/home/mcc/execution
total 29M
-rw-r--r-- 1 mcc users 522K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.3M May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.0M May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 698K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.7M May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 411K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 852K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 353K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 829K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 102 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 340 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 1.1M May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.7M May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 23K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 43K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 14M May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BART-PT-060, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-ebro-152646306100107
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BART-PT-060-UpperBounds-00
FORMULA_NAME BART-PT-060-UpperBounds-01
FORMULA_NAME BART-PT-060-UpperBounds-02
FORMULA_NAME BART-PT-060-UpperBounds-03
FORMULA_NAME BART-PT-060-UpperBounds-04
FORMULA_NAME BART-PT-060-UpperBounds-05
FORMULA_NAME BART-PT-060-UpperBounds-06
FORMULA_NAME BART-PT-060-UpperBounds-07
FORMULA_NAME BART-PT-060-UpperBounds-08
FORMULA_NAME BART-PT-060-UpperBounds-09
FORMULA_NAME BART-PT-060-UpperBounds-10
FORMULA_NAME BART-PT-060-UpperBounds-11
FORMULA_NAME BART-PT-060-UpperBounds-12
FORMULA_NAME BART-PT-060-UpperBounds-13
FORMULA_NAME BART-PT-060-UpperBounds-14
FORMULA_NAME BART-PT-060-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1526519115394

info: Time: 3600 - MCC
===========================================================================================
prep: translating BART-PT-060 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-060 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ BART-PT-060 @ 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: 20250/65536 symbol table entries, 2117 collisions
lola: preprocessing...
lola: Size of bit vector: 8130
lola: finding significant places
lola: 8130 places, 12120 transitions, 7860 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 7767 transition conflict sets
lola: TASK
lola: reading formula from BART-PT-060-UpperBounds.task
lola: place invariant simplifies atomic proposition
lola: before: (NewDistTable_34_2_32 + NewDistTable_20_5_15 + NewDistTable_5_1_4 + NewDistTable_29_2_27 + NewDistTable_35_4_31 + NewDistTable_15_5_10 + NewDistTable_37_3_34 + NewDistTable_10_1_9 + NewDistTable_14_3_11 + NewDistTable_36_1_35 + NewDistTable_13_1_12 + NewDistTable_26_1_25 + NewDistTable_10_2_8 + NewDistTable_22_4_18 + NewDistTable_12_5_7 + NewDistTable_2_2_0 + NewDistTable_21_2_19 + NewDistTable_30_5_25 + NewDistTable_7_4_3 + NewDistTable_17_4_13 + NewDistTable_39_2_37 + NewDistTable_16_2_14 + NewDistTable_25_5_20 + NewDistTable_24_3_21 + NewDistTable_12_4_8 + NewDistTable_2_1_1 + NewDistTable_23_1_22 + NewDistTable_32_4_28 + NewDistTable_31_2_29 + NewDistTable_7_3_4 + NewDistTable_19_3_16 + NewDistTable_18_1_17 + NewDistTable_27_4_23 + NewDistTable_26_2_24 + NewDistTable_34_3_31 + NewDistTable_12_3_9 + NewDistTable_33_1_32 + NewDistTable_7_2_5 + NewDistTable_29_3_26 + NewDistTable_28_1_27 + NewDistTable_37_4_33 + NewDistTable_14_4_10 + NewDistTable_36_2_34 + NewDistTable_13_2_11 + NewDistTable_22_5_17 + NewDistTable_21_3_18 + NewDistTable_4_3_1 + NewDistTable_20_1_19 + NewDistTable_7_1_6 + NewDistTable_17_5_12 + NewDistTable_39_3_36 + NewDistTable_16_3_13 + NewDistTable_38_1_37 + NewDistTable_15_1_14 + NewDistTable_24_4_20 + NewDistTable_23_2_21 + NewDistTable_32_5_27 + NewDistTable_14_5_9 + NewDistTable_4_2_2 + NewDistTable_31_3_28 + NewDistTable_19_4_15 + NewDistTable_30_1_29 + NewDistTable_9_4_5 + NewDistTable_18_2_16 + NewDistTable_27_5_22 + NewDistTable_26_3_23 + NewDistTable_25_1_24 + NewDistTable_34_4_30 + NewDistTable_33_2_31 + NewDistTable_4_1_3 + NewDistTable_29_4_25 + NewDistTable_40_1_39 + NewDistTable_9_3_6 + NewDistTable_28_2_26 + NewDistTable_36_3_33 + NewDistTable_13_3_10 + NewDistTable_11_5_6 + NewDistTable_35_1_34 + NewDistTable_12_1_11 + NewDistTable_21_4_17 + NewDistTable_20_2_18 + NewDistTable_9_2_7 + NewDistTable_16_4_12 + NewDistTable_38_2_36 + NewDistTable_15_2_13 + NewDistTable_24_5_19 + NewDistTable_11_4_7 + NewDistTable_23_3_20 + NewDistTable_22_1_21 + NewDistTable_31_4_27 + NewDistTable_6_3_3 + NewDistTable_19_5_14 + NewDistTable_30_2_28 + NewDistTable_9_1_8 + NewDistTable_18_3_15 + NewDistTable_17_1_16 + NewDistTable_26_4_22 + NewDistTable_25_2_23 + NewDistTable_34_5_29 + NewDistTable_11_3_8 + NewDistTable_33_3_30 + NewDistTable_32_1_31 + NewDistTable_6_2_4 + NewDistTable_29_5_24 + NewDistTable_40_2_38 + NewDistTable_27_3_24 + NewDistTable_28_3_25 + NewDistTable_27_1_26 + NewDistTable_36_4_32 + NewDistTable_11_2_9 + NewDistTable_35_2_33 + NewDistTable_12_2_10 + NewDistTable_21_5_16 + NewDistTable_20_3_17 + NewDistTable_6_1_5 + NewDistTable_16_5_11 + NewDistTable_38_3_35 + NewDistTable_15_3_12 + NewDistTable_37_1_36 + NewDistTable_14_1_13 + NewDistTable_23_4_19 + NewDistTable_22_2_20 + NewDistTable_13_5_8 + NewDistTable_3_2_1 + NewDistTable_31_5_26 + NewDistTable_30_3_27 + NewDistTable_18_4_14 + NewDistTable_8_4_4 + NewDistTable_17_2_15 + NewDistTable_26_5_21 + NewDistTable_25_3_22 + NewDistTable_24_1_23 + NewDistTable_33_4_29 + NewDistTable_13_4_9 + NewDistTable_3_1_2 + NewDistTable_32_2_30 + NewDistTable_8_3_5 + NewDistTable_19_1_18 + NewDistTable_28_4_24 + NewDistTable_27_2_25 + NewDistTable_35_3_32 + NewDistTable_34_1_33 + NewDistTable_11_1_10 + NewDistTable_20_4_16 + NewDistTable_8_2_6 + NewDistTable_29_1_28 + NewDistTable_15_4_11 + NewDistTable_37_2_35 + NewDistTable_14_2_12 + NewDistTable_10_4_6 + NewDistTable_23_5_18 + NewDistTable_22_3_19 + NewDistTable_21_1_20 + NewDistTable_30_4_26 + NewDistTable_5_3_2 + NewDistTable_8_1_7 + NewDistTable_18_5_13 + NewDistTable_17_3_14 + NewDistTable_39_1_38 + NewDistTable_16_1_15 + NewDistTable_25_4_21 + NewDistTable_10_3_7 + NewDistTable_28_5_23 + NewDistTable_24_2_22 + NewDistTable_33_5_28 + NewDistTable_32_3_29 + NewDistTable_5_2_3 + NewDistTable_31_1_30 + NewDistTable_19_2_17 <= 0)
lola: after: (169 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (NewDistTable_34_2_32 + NewDistTable_20_5_15 + NewDistTable_5_1_4 + NewDistTable_29_2_27 + NewDistTable_35_4_31 + NewDistTable_15_5_10 + NewDistTable_37_3_34 + NewDistTable_10_1_9 + NewDistTable_14_3_11 + NewDistTable_36_1_35 + NewDistTable_13_1_12 + NewDistTable_26_1_25 + NewDistTable_10_2_8 + NewDistTable_22_4_18 + NewDistTable_12_5_7 + NewDistTable_2_2_0 + NewDistTable_21_2_19 + NewDistTable_30_5_25 + NewDistTable_7_4_3 + NewDistTable_17_4_13 + NewDistTable_39_2_37 + NewDistTable_16_2_14 + NewDistTable_25_5_20 + NewDistTable_24_3_21 + NewDistTable_12_4_8 + NewDistTable_2_1_1 + NewDistTable_23_1_22 + NewDistTable_32_4_28 + NewDistTable_31_2_29 + NewDistTable_7_3_4 + NewDistTable_19_3_16 + NewDistTable_18_1_17 + NewDistTable_27_4_23 + NewDistTable_26_2_24 + NewDistTable_34_3_31 + NewDistTable_12_3_9 + NewDistTable_33_1_32 + NewDistTable_7_2_5 + NewDistTable_29_3_26 + NewDistTable_28_1_27 + NewDistTable_37_4_33 + NewDistTable_14_4_10 + NewDistTable_36_2_34 + NewDistTable_13_2_11 + NewDistTable_22_5_17 + NewDistTable_21_3_18 + NewDistTable_4_3_1 + NewDistTable_20_1_19 + NewDistTable_7_1_6 + NewDistTable_17_5_12 + NewDistTable_39_3_36 + NewDistTable_16_3_13 + NewDistTable_38_1_37 + NewDistTable_15_1_14 + NewDistTable_24_4_20 + NewDistTable_23_2_21 + NewDistTable_32_5_27 + NewDistTable_14_5_9 + NewDistTable_4_2_2 + NewDistTable_31_3_28 + NewDistTable_19_4_15 + NewDistTable_30_1_29 + NewDistTable_9_4_5 + NewDistTable_18_2_16 + NewDistTable_27_5_22 + NewDistTable_26_3_23 + NewDistTable_25_1_24 + NewDistTable_34_4_30 + NewDistTable_33_2_31 + NewDistTable_4_1_3 + NewDistTable_29_4_25 + NewDistTable_40_1_39 + NewDistTable_9_3_6 + NewDistTable_28_2_26 + NewDistTable_36_3_33 + NewDistTable_13_3_10 + NewDistTable_11_5_6 + NewDistTable_35_1_34 + NewDistTable_12_1_11 + NewDistTable_21_4_17 + NewDistTable_20_2_18 + NewDistTable_9_2_7 + NewDistTable_16_4_12 + NewDistTable_38_2_36 + NewDistTable_15_2_13 + NewDistTable_24_5_19 + NewDistTable_11_4_7 + NewDistTable_23_3_20 + NewDistTable_22_1_21 + NewDistTable_31_4_27 + NewDistTable_6_3_3 + NewDistTable_19_5_14 + NewDistTable_30_2_28 + NewDistTable_9_1_8 + NewDistTable_18_3_15 + NewDistTable_17_1_16 + NewDistTable_26_4_22 + NewDistTable_25_2_23 + NewDistTable_34_5_29 + NewDistTable_11_3_8 + NewDistTable_33_3_30 + NewDistTable_32_1_31 + NewDistTable_6_2_4 + NewDistTable_29_5_24 + NewDistTable_40_2_38 + NewDistTable_27_3_24 + NewDistTable_28_3_25 + NewDistTable_27_1_26 + NewDistTable_36_4_32 + NewDistTable_11_2_9 + NewDistTable_35_2_33 + NewDistTable_12_2_10 + NewDistTable_21_5_16 + NewDistTable_20_3_17 + NewDistTable_6_1_5 + NewDistTable_16_5_11 + NewDistTable_38_3_35 + NewDistTable_15_3_12 + NewDistTable_37_1_36 + NewDistTable_14_1_13 + NewDistTable_23_4_19 + NewDistTable_22_2_20 + NewDistTable_13_5_8 + NewDistTable_3_2_1 + NewDistTable_31_5_26 + NewDistTable_30_3_27 + NewDistTable_18_4_14 + NewDistTable_8_4_4 + NewDistTable_17_2_15 + NewDistTable_26_5_21 + NewDistTable_25_3_22 + NewDistTable_24_1_23 + NewDistTable_33_4_29 + NewDistTable_13_4_9 + NewDistTable_3_1_2 + NewDistTable_32_2_30 + NewDistTable_8_3_5 + NewDistTable_19_1_18 + NewDistTable_28_4_24 + NewDistTable_27_2_25 + NewDistTable_35_3_32 + NewDistTable_34_1_33 + NewDistTable_11_1_10 + NewDistTable_20_4_16 + NewDistTable_8_2_6 + NewDistTable_29_1_28 + NewDistTable_15_4_11 + NewDistTable_37_2_35 + NewDistTable_14_2_12 + NewDistTable_10_4_6 + NewDistTable_23_5_18 + NewDistTable_22_3_19 + NewDistTable_21_1_20 + NewDistTable_30_4_26 + NewDistTable_5_3_2 + NewDistTable_8_1_7 + NewDistTable_18_5_13 + NewDistTable_17_3_14 + NewDistTable_39_1_38 + NewDistTable_16_1_15 + NewDistTable_25_4_21 + NewDistTable_10_3_7 + NewDistTable_28_5_23 + NewDistTable_24_2_22 + NewDistTable_33_5_28 + NewDistTable_32_3_29 + NewDistTable_5_2_3 + NewDistTable_31_1_30 + NewDistTable_19_2_17 <= 0)
lola: after: (169 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (StopTable_4_10 + StopTable_5_15 + StopTable_3_6 + StopTable_2_3 + StopTable_1_1 <= 0)
lola: after: (5 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (NewDistTable_34_2_32 + NewDistTable_20_5_15 + NewDistTable_5_1_4 + NewDistTable_29_2_27 + NewDistTable_35_4_31 + NewDistTable_15_5_10 + NewDistTable_37_3_34 + NewDistTable_10_1_9 + NewDistTable_14_3_11 + NewDistTable_36_1_35 + NewDistTable_13_1_12 + NewDistTable_26_1_25 + NewDistTable_10_2_8 + NewDistTable_22_4_18 + NewDistTable_12_5_7 + NewDistTable_2_2_0 + NewDistTable_21_2_19 + NewDistTable_30_5_25 + NewDistTable_7_4_3 + NewDistTable_17_4_13 + NewDistTable_39_2_37 + NewDistTable_16_2_14 + NewDistTable_25_5_20 + NewDistTable_24_3_21 + NewDistTable_12_4_8 + NewDistTable_2_1_1 + NewDistTable_23_1_22 + NewDistTable_32_4_28 + NewDistTable_31_2_29 + NewDistTable_7_3_4 + NewDistTable_19_3_16 + NewDistTable_18_1_17 + NewDistTable_27_4_23 + NewDistTable_26_2_24 + NewDistTable_34_3_31 + NewDistTable_12_3_9 + NewDistTable_33_1_32 + NewDistTable_7_2_5 + NewDistTable_29_3_26 + NewDistTable_28_1_27 + NewDistTable_37_4_33 + NewDistTable_14_4_10 + NewDistTable_36_2_34 + NewDistTable_13_2_11 + NewDistTable_22_5_17 + NewDistTable_21_3_18 + NewDistTable_4_3_1 + NewDistTable_20_1_19 + NewDistTable_7_1_6 + NewDistTable_17_5_12 + NewDistTable_39_3_36 + NewDistTable_16_3_13 + NewDistTable_38_1_37 + NewDistTable_15_1_14 + NewDistTable_24_4_20 + NewDistTable_23_2_21 + NewDistTable_32_5_27 + NewDistTable_14_5_9 + NewDistTable_4_2_2 + NewDistTable_31_3_28 + NewDistTable_19_4_15 + NewDistTable_30_1_29 + NewDistTable_9_4_5 + NewDistTable_18_2_16 + NewDistTable_27_5_22 + NewDistTable_26_3_23 + NewDistTable_25_1_24 + NewDistTable_34_4_30 + NewDistTable_33_2_31 + NewDistTable_4_1_3 + NewDistTable_29_4_25 + NewDistTable_40_1_39 + NewDistTable_9_3_6 + NewDistTable_28_2_26 + NewDistTable_36_3_33 + NewDistTable_13_3_10 + NewDistTable_11_5_6 + NewDistTable_35_1_34 + NewDistTable_12_1_11 + NewDistTable_21_4_17 + NewDistTable_20_2_18 + NewDistTable_9_2_7 + NewDistTable_16_4_12 + NewDistTable_38_2_36 + NewDistTable_15_2_13 + NewDistTable_24_5_19 + NewDistTable_11_4_7 + NewDistTable_23_3_20 + NewDistTable_22_1_21 + NewDistTable_31_4_27 + NewDistTable_6_3_3 + NewDistTable_19_5_14 + NewDistTable_30_2_28 + NewDistTable_9_1_8 + NewDistTable_18_3_15 + NewDistTable_17_1_16 + NewDistTable_26_4_22 + NewDistTable_25_2_23 + NewDistTable_34_5_29 + NewDistTable_11_3_8 + NewDistTable_33_3_30 + NewDistTable_32_1_31 + NewDistTable_6_2_4 + NewDistTable_29_5_24 + NewDistTable_40_2_38 + NewDistTable_27_3_24 + NewDistTable_28_3_25 + NewDistTable_27_1_26 + NewDistTable_36_4_32 + NewDistTable_11_2_9 + NewDistTable_35_2_33 + NewDistTable_12_2_10 + NewDistTable_21_5_16 + NewDistTable_20_3_17 + NewDistTable_6_1_5 + NewDistTable_16_5_11 + NewDistTable_38_3_35 + NewDistTable_15_3_12 + NewDistTable_37_1_36 + NewDistTable_14_1_13 + NewDistTable_23_4_19 + NewDistTable_22_2_20 + NewDistTable_13_5_8 + NewDistTable_3_2_1 + NewDistTable_31_5_26 + NewDistTable_30_3_27 + NewDistTable_18_4_14 + NewDistTable_8_4_4 + NewDistTable_17_2_15 + NewDistTable_26_5_21 + NewDistTable_25_3_22 + NewDistTable_24_1_23 + NewDistTable_33_4_29 + NewDistTable_13_4_9 + NewDistTable_3_1_2 + NewDistTable_32_2_30 + NewDistTable_8_3_5 + NewDistTable_19_1_18 + NewDistTable_28_4_24 + NewDistTable_27_2_25 + NewDistTable_35_3_32 + NewDistTable_34_1_33 + NewDistTable_11_1_10 + NewDistTable_20_4_16 + NewDistTable_8_2_6 + NewDistTable_29_1_28 + NewDistTable_15_4_11 + NewDistTable_37_2_35 + NewDistTable_14_2_12 + NewDistTable_10_4_6 + NewDistTable_23_5_18 + NewDistTable_22_3_19 + NewDistTable_21_1_20 + NewDistTable_30_4_26 + NewDistTable_5_3_2 + NewDistTable_8_1_7 + NewDistTable_18_5_13 + NewDistTable_17_3_14 + NewDistTable_39_1_38 + NewDistTable_16_1_15 + NewDistTable_25_4_21 + NewDistTable_10_3_7 + NewDistTable_28_5_23 + NewDistTable_24_2_22 + NewDistTable_33_5_28 + NewDistTable_32_3_29 + NewDistTable_5_2_3 + NewDistTable_31_1_30 + NewDistTable_19_2_17 <= 0)
lola: after: (169 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (DistStation_40 + DistStation_39 + DistStation_38 + DistStation_37 + DistStation_36 + DistStation_35 + DistStation_34 + DistStation_33 + DistStation_32 + DistStation_31 + DistStation_30 + DistStation_29 + DistStation_28 + DistStation_27 + DistStation_26 + DistStation_25 + DistStation_24 + DistStation_23 + DistStation_22 + DistStation_21 + DistStation_20 + DistStation_19 + DistStation_18 + DistStation_17 + DistStation_16 + DistStation_15 + DistStation_14 + DistStation_13 + DistStation_12 + DistStation_11 + DistStation_10 + DistStation_9 + DistStation_8 + DistStation_7 + DistStation_6 + DistStation_5 <= 0)
lola: after: (36 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (NewDistTable_34_2_32 + NewDistTable_20_5_15 + NewDistTable_5_1_4 + NewDistTable_29_2_27 + NewDistTable_35_4_31 + NewDistTable_15_5_10 + NewDistTable_37_3_34 + NewDistTable_10_1_9 + NewDistTable_14_3_11 + NewDistTable_36_1_35 + NewDistTable_13_1_12 + NewDistTable_26_1_25 + NewDistTable_10_2_8 + NewDistTable_22_4_18 + NewDistTable_12_5_7 + NewDistTable_2_2_0 + NewDistTable_21_2_19 + NewDistTable_30_5_25 + NewDistTable_7_4_3 + NewDistTable_17_4_13 + NewDistTable_39_2_37 + NewDistTable_16_2_14 + NewDistTable_25_5_20 + NewDistTable_24_3_21 + NewDistTable_12_4_8 + NewDistTable_2_1_1 + NewDistTable_23_1_22 + NewDistTable_32_4_28 + NewDistTable_31_2_29 + NewDistTable_7_3_4 + NewDistTable_19_3_16 + NewDistTable_18_1_17 + NewDistTable_27_4_23 + NewDistTable_26_2_24 + NewDistTable_34_3_31 + NewDistTable_12_3_9 + NewDistTable_33_1_32 + NewDistTable_7_2_5 + NewDistTable_29_3_26 + NewDistTable_28_1_27 + NewDistTable_37_4_33 + NewDistTable_14_4_10 + NewDistTable_36_2_34 + NewDistTable_13_2_11 + NewDistTable_22_5_17 + NewDistTable_21_3_18 + NewDistTable_4_3_1 + NewDistTable_20_1_19 + NewDistTable_7_1_6 + NewDistTable_17_5_12 + NewDistTable_39_3_36 + NewDistTable_16_3_13 + NewDistTable_38_1_37 + NewDistTable_15_1_14 + NewDistTable_24_4_20 + NewDistTable_23_2_21 + NewDistTable_32_5_27 + NewDistTable_14_5_9 + NewDistTable_4_2_2 + NewDistTable_31_3_28 + NewDistTable_19_4_15 + NewDistTable_30_1_29 + NewDistTable_9_4_5 + NewDistTable_18_2_16 + NewDistTable_27_5_22 + NewDistTable_26_3_23 + NewDistTable_25_1_24 + NewDistTable_34_4_30 + NewDistTable_33_2_31 + NewDistTable_4_1_3 + NewDistTable_29_4_25 + NewDistTable_40_1_39 + NewDistTable_9_3_6 + NewDistTable_28_2_26 + NewDistTable_36_3_33 + NewDistTable_13_3_10 + NewDistTable_11_5_6 + NewDistTable_35_1_34 + NewDistTable_12_1_11 + NewDistTable_21_4_17 + NewDistTable_20_2_18 + NewDistTable_9_2_7 + NewDistTable_16_4_12 + NewDistTable_38_2_36 + NewDistTable_15_2_13 + NewDistTable_24_5_19 + NewDistTable_11_4_7 + NewDistTable_23_3_20 + NewDistTable_22_1_21 + NewDistTable_31_4_27 + NewDistTable_6_3_3 + NewDistTable_19_5_14 + NewDistTable_30_2_28 + NewDistTable_9_1_8 + NewDistTable_18_3_15 + NewDistTable_17_1_16 + NewDistTable_26_4_22 + NewDistTable_25_2_23 + NewDistTable_34_5_29 + NewDistTable_11_3_8 + NewDistTable_33_3_30 + NewDistTable_32_1_31 + NewDistTable_6_2_4 + NewDistTable_29_5_24 + NewDistTable_40_2_38 + NewDistTable_27_3_24 + NewDistTable_28_3_25 + NewDistTable_27_1_26 + NewDistTable_36_4_32 + NewDistTable_11_2_9 + NewDistTable_35_2_33 + NewDistTable_12_2_10 + NewDistTable_21_5_16 + NewDistTable_20_3_17 + NewDistTable_6_1_5 + NewDistTable_16_5_11 + NewDistTable_38_3_35 + NewDistTable_15_3_12 + NewDistTable_37_1_36 + NewDistTable_14_1_13 + NewDistTable_23_4_19 + NewDistTable_22_2_20 + NewDistTable_13_5_8 + NewDistTable_3_2_1 + NewDistTable_31_5_26 + NewDistTable_30_3_27 + NewDistTable_18_4_14 + NewDistTable_8_4_4 + NewDistTable_17_2_15 + NewDistTable_26_5_21 + NewDistTable_25_3_22 + NewDistTable_24_1_23 + NewDistTable_33_4_29 + NewDistTable_13_4_9 + NewDistTable_3_1_2 + NewDistTable_32_2_30 + NewDistTable_8_3_5 + NewDistTable_19_1_18 + NewDistTable_28_4_24 + NewDistTable_27_2_25 + NewDistTable_35_3_32 + NewDistTable_34_1_33 + NewDistTable_11_1_10 + NewDistTable_20_4_16 + NewDistTable_8_2_6 + NewDistTable_29_1_28 + NewDistTable_15_4_11 + NewDistTable_37_2_35 + NewDistTable_14_2_12 + NewDistTable_10_4_6 + NewDistTable_23_5_18 + NewDistTable_22_3_19 + NewDistTable_21_1_20 + NewDistTable_30_4_26 + NewDistTable_5_3_2 + NewDistTable_8_1_7 + NewDistTable_18_5_13 + NewDistTable_17_3_14 + NewDistTable_39_1_38 + NewDistTable_16_1_15 + NewDistTable_25_4_21 + NewDistTable_10_3_7 + NewDistTable_28_5_23 + NewDistTable_24_2_22 + NewDistTable_33_5_28 + NewDistTable_32_3_29 + NewDistTable_5_2_3 + NewDistTable_31_1_30 + NewDistTable_19_2_17 <= 0)
lola: after: (169 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (NewDistTable_34_2_32 + NewDistTable_20_5_15 + NewDistTable_5_1_4 + NewDistTable_29_2_27 + NewDistTable_35_4_31 + NewDistTable_15_5_10 + NewDistTable_37_3_34 + NewDistTable_10_1_9 + NewDistTable_14_3_11 + NewDistTable_36_1_35 + NewDistTable_13_1_12 + NewDistTable_26_1_25 + NewDistTable_10_2_8 + NewDistTable_22_4_18 + NewDistTable_12_5_7 + NewDistTable_2_2_0 + NewDistTable_21_2_19 + NewDistTable_30_5_25 + NewDistTable_7_4_3 + NewDistTable_17_4_13 + NewDistTable_39_2_37 + NewDistTable_16_2_14 + NewDistTable_25_5_20 + NewDistTable_24_3_21 + NewDistTable_12_4_8 + NewDistTable_2_1_1 + NewDistTable_23_1_22 + NewDistTable_32_4_28 + NewDistTable_31_2_29 + NewDistTable_7_3_4 + NewDistTable_19_3_16 + NewDistTable_18_1_17 + NewDistTable_27_4_23 + NewDistTable_26_2_24 + NewDistTable_34_3_31 + NewDistTable_12_3_9 + NewDistTable_33_1_32 + NewDistTable_7_2_5 + NewDistTable_29_3_26 + NewDistTable_28_1_27 + NewDistTable_37_4_33 + NewDistTable_14_4_10 + NewDistTable_36_2_34 + NewDistTable_13_2_11 + NewDistTable_22_5_17 + NewDistTable_21_3_18 + NewDistTable_4_3_1 + NewDistTable_20_1_19 + NewDistTable_7_1_6 + NewDistTable_17_5_12 + NewDistTable_39_3_36 + NewDistTable_16_3_13 + NewDistTable_38_1_37 + NewDistTable_15_1_14 + NewDistTable_24_4_20 + NewDistTable_23_2_21 + NewDistTable_32_5_27 + NewDistTable_14_5_9 + NewDistTable_4_2_2 + NewDistTable_31_3_28 + NewDistTable_19_4_15 + NewDistTable_30_1_29 + NewDistTable_9_4_5 + NewDistTable_18_2_16 + NewDistTable_27_5_22 + NewDistTable_26_3_23 + NewDistTable_25_1_24 + NewDistTable_34_4_30 + NewDistTable_33_2_31 + NewDistTable_4_1_3 + NewDistTable_29_4_25 + NewDistTable_40_1_39 + NewDistTable_9_3_6 + NewDistTable_28_2_26 + NewDistTable_36_3_33 + NewDistTable_13_3_10 + NewDistTable_11_5_6 + NewDistTable_35_1_34 + NewDistTable_12_1_11 + NewDistTable_21_4_17 + NewDistTable_20_2_18 + NewDistTable_9_2_7 + NewDistTable_16_4_12 + NewDistTable_38_2_36 + NewDistTable_15_2_13 + NewDistTable_24_5_19 + NewDistTable_11_4_7 + NewDistTable_23_3_20 + NewDistTable_22_1_21 + NewDistTable_31_4_27 + NewDistTable_6_3_3 + NewDistTable_19_5_14 + NewDistTable_30_2_28 + NewDistTable_9_1_8 + NewDistTable_18_3_15 + NewDistTable_17_1_16 + NewDistTable_26_4_22 + NewDistTable_25_2_23 + NewDistTable_34_5_29 + NewDistTable_11_3_8 + NewDistTable_33_3_30 + NewDistTable_32_1_31 + NewDistTable_6_2_4 + NewDistTable_29_5_24 + NewDistTable_40_2_38 + NewDistTable_27_3_24 + NewDistTable_28_3_25 + NewDistTable_27_1_26 + NewDistTable_36_4_32 + NewDistTable_11_2_9 + NewDistTable_35_2_33 + NewDistTable_12_2_10 + NewDistTable_21_5_16 + NewDistTable_20_3_17 + NewDistTable_6_1_5 + NewDistTable_16_5_11 + NewDistTable_38_3_35 + NewDistTable_15_3_12 + NewDistTable_37_1_36 + NewDistTable_14_1_13 + NewDistTable_23_4_19 + NewDistTable_22_2_20 + NewDistTable_13_5_8 + NewDistTable_3_2_1 + NewDistTable_31_5_26 + NewDistTable_30_3_27 + NewDistTable_18_4_14 + NewDistTable_8_4_4 + NewDistTable_17_2_15 + NewDistTable_26_5_21 + NewDistTable_25_3_22 + NewDistTable_24_1_23 + NewDistTable_33_4_29 + NewDistTable_13_4_9 + NewDistTable_3_1_2 + NewDistTable_32_2_30 + NewDistTable_8_3_5 + NewDistTable_19_1_18 + NewDistTable_28_4_24 + NewDistTable_27_2_25 + NewDistTable_35_3_32 + NewDistTable_34_1_33 + NewDistTable_11_1_10 + NewDistTable_20_4_16 + NewDistTable_8_2_6 + NewDistTable_29_1_28 + NewDistTable_15_4_11 + NewDistTable_37_2_35 + NewDistTable_14_2_12 + NewDistTable_10_4_6 + NewDistTable_23_5_18 + NewDistTable_22_3_19 + NewDistTable_21_1_20 + NewDistTable_30_4_26 + NewDistTable_5_3_2 + NewDistTable_8_1_7 + NewDistTable_18_5_13 + NewDistTable_17_3_14 + NewDistTable_39_1_38 + NewDistTable_16_1_15 + NewDistTable_25_4_21 + NewDistTable_10_3_7 + NewDistTable_28_5_23 + NewDistTable_24_2_22 + NewDistTable_33_5_28 + NewDistTable_32_3_29 + NewDistTable_5_2_3 + NewDistTable_31_1_30 + NewDistTable_19_2_17 <= 0)
lola: after: (169 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (DistStation_40 + DistStation_39 + DistStation_38 + DistStation_37 + DistStation_36 + DistStation_35 + DistStation_34 + DistStation_33 + DistStation_32 + DistStation_31 + DistStation_30 + DistStation_29 + DistStation_28 + DistStation_27 + DistStation_26 + DistStation_25 + DistStation_24 + DistStation_23 + DistStation_22 + DistStation_21 + DistStation_20 + DistStation_19 + DistStation_18 + DistStation_17 + DistStation_16 + DistStation_15 + DistStation_14 + DistStation_13 + DistStation_12 + DistStation_11 + DistStation_10 + DistStation_9 + DistStation_8 + DistStation_7 + DistStation_6 + DistStation_5 <= 0)
lola: after: (36 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (NewDistTable_19_4_15 <= 0)
lola: after: (1 <= 0)
lola: always false
lola: MAX(0) : MAX(0) : MAX(0) : MAX(0) : MAX(0) : MAX(0) : MAX(0) : MAX(0) : MAX(TrainState_10_2_8) : MAX(TrainState_53_3_22) : MAX(TrainState_42_1_12) : MAX(TrainState_5_3_15) : MAX(TrainState_59_2_5) : MAX(TrainState_28_1_34) : MAX(TrainState_36_2_18) : MAX(0)
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file BART-PT-060-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 169
lola: SUBRESULT
lola: result: 169
lola: produced by: state space
lola: The maximum value of the given expression is 169
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BART-PT-060-UpperBounds-0 169 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file BART-PT-060-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 169
lola: SUBRESULT
lola: result: 169
lola: produced by: state space
lola: The maximum value of the given expression is 169
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BART-PT-060-UpperBounds-1 169 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file BART-PT-060-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 5
lola: SUBRESULT
lola: result: 5
lola: produced by: state space
lola: The maximum value of the given expression is 5
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BART-PT-060-UpperBounds-2 5 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file BART-PT-060-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 169
lola: SUBRESULT
lola: result: 169
lola: produced by: state space
lola: The maximum value of the given expression is 169
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BART-PT-060-UpperBounds-3 169 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file BART-PT-060-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 36
lola: SUBRESULT
lola: result: 36
lola: produced by: state space
lola: The maximum value of the given expression is 36
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BART-PT-060-UpperBounds-4 36 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file BART-PT-060-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 169
lola: SUBRESULT
lola: result: 169
lola: produced by: state space
lola: The maximum value of the given expression is 169
lola: 0 markings, 0 edges

FORMULA BART-PT-060-UpperBounds-5 169 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file BART-PT-060-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 169
lola: SUBRESULT
lola: result: 169
lola: produced by: state space
lola: The maximum value of the given expression is 169
lola: 0 markings, 0 edges
lola:
FORMULA BART-PT-060-UpperBounds-6 169 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 394 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file BART-PT-060-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
========================================
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 36
lola: SUBRESULT
lola: result: 36
lola: produced by: state space
lola: The maximum value of the given expression is 36
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BART-PT-060-UpperBounds-7 36 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(0)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(0)
lola: processed formula length: 6
lola: 0 rewrites
lola: closed formula file BART-PT-060-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 0 markings, 0 edges
lola: ========================================

FORMULA BART-PT-060-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TrainState_53_3_22)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(TrainState_53_3_22)
lola: processed formula length: 23
lola: 0 rewrites
lola: closed formula file BART-PT-060-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 4 markings, 3 edges

FORMULA BART-PT-060-UpperBounds-9 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TrainState_42_1_12)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(TrainState_42_1_12)
lola: processed formula length: 23
lola: 0 rewrites
lola: closed formula file BART-PT-060-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================

FORMULA BART-PT-060-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TrainState_5_3_15)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(TrainState_5_3_15)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file BART-PT-060-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 4 markings, 3 edges

FORMULA BART-PT-060-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 880 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TrainState_59_2_5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(TrainState_59_2_5)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file BART-PT-060-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 3 markings, 2 edges
lola: ========================================

FORMULA BART-PT-060-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1172 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TrainState_28_1_34)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(TrainState_28_1_34)
lola: processed formula length: 23
lola: 0 rewrites
lola: closed formula file BART-PT-060-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 2 markings, 1 edges
lola: ========================================

FORMULA BART-PT-060-UpperBounds-13 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1754 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TrainState_36_2_18)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(TrainState_36_2_18)
lola: processed formula length: 23
lola: 0 rewrites
lola: closed formula file BART-PT-060-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 3 markings, 2 edges

FORMULA BART-PT-060-UpperBounds-14 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3501 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TrainState_10_2_8)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(TrainState_10_2_8)
lola: processed formula length: 22
lola: 0 rewrites
lola: closed formula file BART-PT-060-UpperBounds.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using bound preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
lola: 0 markings, 0 edges, 0 markings/sec, 0 secs
lola: Structural Bound: 1
lola: SUBRESULT
lola: result: 1
lola: produced by: state space
lola: The maximum value of the given expression is 1
lola: 3 markings, 2 edges

FORMULA BART-PT-060-UpperBounds-8 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 169 169 5 169 36 169 169 36 1 1 1 1 1 1 1 1
lola:
preliminary result: 169 169 5 169 36 169 169 36 1 1 1 1 1 1 1 1
lola: ========================================
lola: memory consumption: 87624 KB
lola: time consumption: 75 seconds

BK_STOP 1526519191573

--------------------
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-060"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lola"
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

tar xzf /home/mcc/BenchKit/INPUTS/BART-PT-060.tgz
mv BART-PT-060 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is BART-PT-060, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r028-ebro-152646306100107"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.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 ;