About the Execution of LoLA for AirplaneLD-PT-0100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
273.220 | 41661.00 | 22600.00 | 7007.60 | 1 200 1 1 1 1 100 1 1 1 1 1 1 1 1 1 | normal |
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 1.4M
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K 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.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 27K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 124K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 17K 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 5 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 754K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is AirplaneLD-PT-0100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-qhx2-152646133800093
=====================================================================
--------------------
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 AirplaneLD-PT-0100-UpperBounds-00
FORMULA_NAME AirplaneLD-PT-0100-UpperBounds-01
FORMULA_NAME AirplaneLD-PT-0100-UpperBounds-02
FORMULA_NAME AirplaneLD-PT-0100-UpperBounds-03
FORMULA_NAME AirplaneLD-PT-0100-UpperBounds-04
FORMULA_NAME AirplaneLD-PT-0100-UpperBounds-05
FORMULA_NAME AirplaneLD-PT-0100-UpperBounds-06
FORMULA_NAME AirplaneLD-PT-0100-UpperBounds-07
FORMULA_NAME AirplaneLD-PT-0100-UpperBounds-08
FORMULA_NAME AirplaneLD-PT-0100-UpperBounds-09
FORMULA_NAME AirplaneLD-PT-0100-UpperBounds-10
FORMULA_NAME AirplaneLD-PT-0100-UpperBounds-11
FORMULA_NAME AirplaneLD-PT-0100-UpperBounds-12
FORMULA_NAME AirplaneLD-PT-0100-UpperBounds-13
FORMULA_NAME AirplaneLD-PT-0100-UpperBounds-14
FORMULA_NAME AirplaneLD-PT-0100-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1526582194569
info: Time: 3600 - MCC
===========================================================================================
prep: translating AirplaneLD-PT-0100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating AirplaneLD-PT-0100 formula UpperBounds into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking UpperBounds @ AirplaneLD-PT-0100 @ 3564 seconds
lola: LoLA will run for 3564 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1527/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: Size of bit vector: 23008
lola: finding significant places
lola: 719 places, 808 transitions, 414 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 615 transition conflict sets
lola: TASK
lola: reading formula from AirplaneLD-PT-0100-UpperBounds.task
lola: place invariant simplifies atomic proposition
lola: before: (AltitudePossibleVal_200 + AltitudePossibleVal_199 + AltitudePossibleVal_198 + AltitudePossibleVal_197 + AltitudePossibleVal_196 + AltitudePossibleVal_195 + AltitudePossibleVal_194 + AltitudePossibleVal_193 + AltitudePossibleVal_192 + AltitudePossibleVal_191 + AltitudePossibleVal_190 + AltitudePossibleVal_189 + AltitudePossibleVal_188 + AltitudePossibleVal_187 + AltitudePossibleVal_186 + AltitudePossibleVal_185 + AltitudePossibleVal_184 + AltitudePossibleVal_183 + AltitudePossibleVal_182 + AltitudePossibleVal_181 + AltitudePossibleVal_180 + AltitudePossibleVal_179 + AltitudePossibleVal_178 + AltitudePossibleVal_177 + AltitudePossibleVal_176 + AltitudePossibleVal_175 + AltitudePossibleVal_174 + AltitudePossibleVal_173 + AltitudePossibleVal_172 + AltitudePossibleVal_171 + AltitudePossibleVal_170 + AltitudePossibleVal_169 + AltitudePossibleVal_168 + AltitudePossibleVal_167 + AltitudePossibleVal_166 + AltitudePossibleVal_165 + AltitudePossibleVal_164 + AltitudePossibleVal_163 + AltitudePossibleVal_162 + AltitudePossibleVal_161 + AltitudePossibleVal_160 + AltitudePossibleVal_159 + AltitudePossibleVal_158 + AltitudePossibleVal_157 + AltitudePossibleVal_156 + AltitudePossibleVal_155 + AltitudePossibleVal_154 + AltitudePossibleVal_153 + AltitudePossibleVal_152 + AltitudePossibleVal_151 + AltitudePossibleVal_150 + AltitudePossibleVal_149 + AltitudePossibleVal_148 + AltitudePossibleVal_147 + AltitudePossibleVal_146 + AltitudePossibleVal_145 + AltitudePossibleVal_144 + AltitudePossibleVal_143 + AltitudePossibleVal_142 + AltitudePossibleVal_141 + AltitudePossibleVal_140 + AltitudePossibleVal_139 + AltitudePossibleVal_138 + AltitudePossibleVal_137 + AltitudePossibleVal_136 + AltitudePossibleVal_135 + AltitudePossibleVal_134 + AltitudePossibleVal_133 + AltitudePossibleVal_132 + AltitudePossibleVal_131 + AltitudePossibleVal_130 + AltitudePossibleVal_129 + AltitudePossibleVal_128 + AltitudePossibleVal_127 + AltitudePossibleVal_126 + AltitudePossibleVal_125 + AltitudePossibleVal_124 + AltitudePossibleVal_123 + AltitudePossibleVal_122 + AltitudePossibleVal_121 + AltitudePossibleVal_120 + AltitudePossibleVal_119 + AltitudePossibleVal_118 + AltitudePossibleVal_117 + AltitudePossibleVal_116 + AltitudePossibleVal_115 + AltitudePossibleVal_114 + AltitudePossibleVal_113 + AltitudePossibleVal_112 + AltitudePossibleVal_111 + AltitudePossibleVal_110 + AltitudePossibleVal_109 + AltitudePossibleVal_108 + AltitudePossibleVal_107 + AltitudePossibleVal_106 + AltitudePossibleVal_105 + AltitudePossibleVal_104 + AltitudePossibleVal_103 + AltitudePossibleVal_102 + AltitudePossibleVal_101 + AltitudePossibleVal_100 + AltitudePossibleVal_9 + AltitudePossibleVal_8 + AltitudePossibleVal_7 + AltitudePossibleVal_6 + AltitudePossibleVal_5 + AltitudePossibleVal_4 + AltitudePossibleVal_3 + AltitudePossibleVal_2 + AltitudePossibleVal_1 + AltitudePossibleVal_10 + AltitudePossibleVal_11 + AltitudePossibleVal_12 + AltitudePossibleVal_13 + AltitudePossibleVal_14 + AltitudePossibleVal_15 + AltitudePossibleVal_16 + AltitudePossibleVal_17 + AltitudePossibleVal_18 + AltitudePossibleVal_19 + AltitudePossibleVal_20 + AltitudePossibleVal_21 + AltitudePossibleVal_22 + AltitudePossibleVal_23 + AltitudePossibleVal_24 + AltitudePossibleVal_25 + AltitudePossibleVal_26 + AltitudePossibleVal_27 + AltitudePossibleVal_28 + AltitudePossibleVal_29 + AltitudePossibleVal_30 + AltitudePossibleVal_31 + AltitudePossibleVal_32 + AltitudePossibleVal_33 + AltitudePossibleVal_34 + AltitudePossibleVal_35 + AltitudePossibleVal_36 + AltitudePossibleVal_37 + AltitudePossibleVal_38 + AltitudePossibleVal_39 + AltitudePossibleVal_40 + AltitudePossibleVal_41 + AltitudePossibleVal_42 + AltitudePossibleVal_43 + AltitudePossibleVal_44 + AltitudePossibleVal_45 + AltitudePossibleVal_46 + AltitudePossibleVal_47 + AltitudePossibleVal_48 + AltitudePossibleVal_49 + AltitudePossibleVal_50 + AltitudePossibleVal_51 + AltitudePossibleVal_52 + AltitudePossibleVal_53 + AltitudePossibleVal_54 + AltitudePossibleVal_55 + AltitudePossibleVal_56 + AltitudePossibleVal_57 + AltitudePossibleVal_58 + AltitudePossibleVal_59 + AltitudePossibleVal_60 + AltitudePossibleVal_61 + AltitudePossibleVal_62 + AltitudePossibleVal_63 + AltitudePossibleVal_64 + AltitudePossibleVal_65 + AltitudePossibleVal_66 + AltitudePossibleVal_67 + AltitudePossibleVal_68 + AltitudePossibleVal_69 + AltitudePossibleVal_70 + AltitudePossibleVal_71 + AltitudePossibleVal_72 + AltitudePossibleVal_73 + AltitudePossibleVal_74 + AltitudePossibleVal_75 + AltitudePossibleVal_76 + AltitudePossibleVal_77 + AltitudePossibleVal_78 + AltitudePossibleVal_79 + AltitudePossibleVal_80 + AltitudePossibleVal_81 + AltitudePossibleVal_82 + AltitudePossibleVal_83 + AltitudePossibleVal_84 + AltitudePossibleVal_85 + AltitudePossibleVal_86 + AltitudePossibleVal_87 + AltitudePossibleVal_88 + AltitudePossibleVal_89 + AltitudePossibleVal_90 + AltitudePossibleVal_91 + AltitudePossibleVal_92 + AltitudePossibleVal_93 + AltitudePossibleVal_94 + AltitudePossibleVal_95 + AltitudePossibleVal_96 + AltitudePossibleVal_97 + AltitudePossibleVal_98 + AltitudePossibleVal_99 <= 0)
lola: after: (200 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (SpeedPossibleVal_5 + SpeedPossibleVal_6 + SpeedPossibleVal_7 + SpeedPossibleVal_8 + SpeedPossibleVal_9 + SpeedPossibleVal_4 + SpeedPossibleVal_3 + SpeedPossibleVal_2 + SpeedPossibleVal_1 + SpeedPossibleVal_100 + SpeedPossibleVal_10 + SpeedPossibleVal_11 + SpeedPossibleVal_12 + SpeedPossibleVal_13 + SpeedPossibleVal_14 + SpeedPossibleVal_15 + SpeedPossibleVal_16 + SpeedPossibleVal_17 + SpeedPossibleVal_18 + SpeedPossibleVal_19 + SpeedPossibleVal_20 + SpeedPossibleVal_21 + SpeedPossibleVal_22 + SpeedPossibleVal_23 + SpeedPossibleVal_24 + SpeedPossibleVal_25 + SpeedPossibleVal_26 + SpeedPossibleVal_27 + SpeedPossibleVal_28 + SpeedPossibleVal_29 + SpeedPossibleVal_30 + SpeedPossibleVal_31 + SpeedPossibleVal_32 + SpeedPossibleVal_33 + SpeedPossibleVal_34 + SpeedPossibleVal_35 + SpeedPossibleVal_36 + SpeedPossibleVal_37 + SpeedPossibleVal_38 + SpeedPossibleVal_39 + SpeedPossibleVal_40 + SpeedPossibleVal_41 + SpeedPossibleVal_42 + SpeedPossibleVal_43 + SpeedPossibleVal_44 + SpeedPossibleVal_45 + SpeedPossibleVal_46 + SpeedPossibleVal_47 + SpeedPossibleVal_48 + SpeedPossibleVal_49 + SpeedPossibleVal_50 + SpeedPossibleVal_51 + SpeedPossibleVal_52 + SpeedPossibleVal_53 + SpeedPossibleVal_54 + SpeedPossibleVal_55 + SpeedPossibleVal_56 + SpeedPossibleVal_57 + SpeedPossibleVal_58 + SpeedPossibleVal_59 + SpeedPossibleVal_60 + SpeedPossibleVal_61 + SpeedPossibleVal_62 + SpeedPossibleVal_63 + SpeedPossibleVal_64 + SpeedPossibleVal_65 + SpeedPossibleVal_66 + SpeedPossibleVal_67 + SpeedPossibleVal_68 + SpeedPossibleVal_69 + SpeedPossibleVal_70 + SpeedPossibleVal_71 + SpeedPossibleVal_72 + SpeedPossibleVal_73 + SpeedPossibleVal_74 + SpeedPossibleVal_75 + SpeedPossibleVal_76 + SpeedPossibleVal_77 + SpeedPossibleVal_78 + SpeedPossibleVal_79 + SpeedPossibleVal_80 + SpeedPossibleVal_81 + SpeedPossibleVal_82 + SpeedPossibleVal_83 + SpeedPossibleVal_84 + SpeedPossibleVal_85 + SpeedPossibleVal_86 + SpeedPossibleVal_87 + SpeedPossibleVal_88 + SpeedPossibleVal_89 + SpeedPossibleVal_90 + SpeedPossibleVal_91 + SpeedPossibleVal_92 + SpeedPossibleVal_93 + SpeedPossibleVal_94 + SpeedPossibleVal_95 + SpeedPossibleVal_96 + SpeedPossibleVal_97 + SpeedPossibleVal_98 + SpeedPossibleVal_99 <= 0)
lola: after: (100 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (SpeedPossibleVal_48 <= 0)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (SpeedPossibleVal_46 <= 0)
lola: after: (1 <= 0)
lola: always false
lola: place invariant simplifies atomic proposition
lola: before: (AltitudePossibleVal_122 <= 0)
lola: after: (1 <= 0)
lola: always false
lola: MAX(stp5) : MAX(0) : MAX(stp1) : MAX(P4) : MAX(P4) : MAX(stp4) : MAX(0) : MAX(stp2) : MAX(TheAltitude_74) : MAX(0) : MAX(TheAltitude_113) : MAX(0) : MAX(TheAltitude_22) : MAX(TheAltitude_53) : MAX(TheAltitude_80) : 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 AirplaneLD-PT-0100-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: 200
lola: SUBRESULT
lola: result: 200
lola: produced by: state space
lola: The maximum value of the given expression is 200
lola: 0 markings, 0 edges
lola: ========================================
FORMULA AirplaneLD-PT-0100-UpperBounds-1 200 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 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 AirplaneLD-PT-0100-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: 100
lola: SUBRESULT
lola: result: 100
lola: produced by: state space
lola: The maximum value of the given expression is 100
lola: 0 markings, 0 edges
lola: ========================================
FORMULA AirplaneLD-PT-0100-UpperBounds-6 100 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 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 AirplaneLD-PT-0100-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 AirplaneLD-PT-0100-UpperBounds-9 1 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: 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 AirplaneLD-PT-0100-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 AirplaneLD-PT-0100-UpperBounds-11 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 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 AirplaneLD-PT-0100-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 AirplaneLD-PT-0100-UpperBounds-15 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(stp4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(stp4)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file AirplaneLD-PT-0100-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 AirplaneLD-PT-0100-UpperBounds-5 1 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: MAX(stp5)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(stp5)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file AirplaneLD-PT-0100-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 AirplaneLD-PT-0100-UpperBounds-0 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(stp2)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(stp2)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file AirplaneLD-PT-0100-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 AirplaneLD-PT-0100-UpperBounds-7 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TheAltitude_74)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(TheAltitude_74)
lola: processed formula length: 19
lola: 0 rewrites
lola: closed formula file AirplaneLD-PT-0100-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: 2 markings, 1 edges
lola: ========================================
FORMULA AirplaneLD-PT-0100-UpperBounds-8 1 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: MAX(stp1)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(stp1)
lola: processed formula length: 9
lola: 0 rewrites
lola: closed formula file AirplaneLD-PT-0100-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 AirplaneLD-PT-0100-UpperBounds-2 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TheAltitude_113)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(TheAltitude_113)
lola: processed formula length: 20
lola: 0 rewrites
lola: closed formula file AirplaneLD-PT-0100-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: 2 markings, 1 edges
lola: ========================================
FORMULA AirplaneLD-PT-0100-UpperBounds-10 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(P4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P4)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file AirplaneLD-PT-0100-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: 7 markings, 6 edges
lola: ========================================
FORMULA AirplaneLD-PT-0100-UpperBounds-3 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TheAltitude_22)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(TheAltitude_22)
lola: processed formula length: 19
lola: 0 rewrites
lola: closed formula file AirplaneLD-PT-0100-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: 2 markings, 1 edges
lola: ========================================
FORMULA AirplaneLD-PT-0100-UpperBounds-12 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1187 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: MAX(TheAltitude_53)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(TheAltitude_53)
lola: processed formula length: 19
lola: 0 rewrites
lola: closed formula file AirplaneLD-PT-0100-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: 2 markings, 1 edges
lola: ========================================
FORMULA AirplaneLD-PT-0100-UpperBounds-13 1 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: MAX(TheAltitude_80)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(TheAltitude_80)
lola: processed formula length: 19
lola: 0 rewrites
lola: closed formula file AirplaneLD-PT-0100-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: 2 markings, 1 edges
lola: ========================================
FORMULA AirplaneLD-PT-0100-UpperBounds-14 1 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: MAX(P4)
lola: ========================================
lola: SUBTASK
lola: computing bound of an expression
lola: processed formula: MAX(P4)
lola: processed formula length: 7
lola: 0 rewrites
lola: closed formula file AirplaneLD-PT-0100-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: 7 markings, 6 edges
lola: ========================================
FORMULA AirplaneLD-PT-0100-UpperBounds-4 1 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: 1 200 1 1 1 1 100 1 1 1 1 1 1 1 1 1
lola:
preliminary result: 1 200 1 1 1 1 100 1 1 1 1 1 1 1 1 1
lola: memory consumption: 18684 KB
lola: time consumption: 2 seconds
BK_STOP 1526582236230
--------------------
content from stderr:
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AirplaneLD-PT-0100"
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/AirplaneLD-PT-0100.tgz
mv AirplaneLD-PT-0100 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 AirplaneLD-PT-0100, 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 r004-qhx2-152646133800093"
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 '
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 ;