java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AbstractInterpretationInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_search.i_5.bpl
--------------------------------------------------------------------------------
This is Ultimate 0.1.24-c30ebe1
[2018-12-17 14:42:32,085 INFO L170 SettingsManager]: Resetting all preferences to default values...
[2018-12-17 14:42:32,088 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values
[2018-12-17 14:42:32,100 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2018-12-17 14:42:32,101 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2018-12-17 14:42:32,102 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2018-12-17 14:42:32,103 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2018-12-17 14:42:32,105 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values
[2018-12-17 14:42:32,107 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2018-12-17 14:42:32,108 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2018-12-17 14:42:32,109 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2018-12-17 14:42:32,109 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values
[2018-12-17 14:42:32,110 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2018-12-17 14:42:32,111 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2018-12-17 14:42:32,112 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2018-12-17 14:42:32,113 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2018-12-17 14:42:32,114 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2018-12-17 14:42:32,116 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2018-12-17 14:42:32,118 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values
[2018-12-17 14:42:32,120 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2018-12-17 14:42:32,121 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2018-12-17 14:42:32,123 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2018-12-17 14:42:32,125 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2018-12-17 14:42:32,126 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2018-12-17 14:42:32,126 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2018-12-17 14:42:32,127 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2018-12-17 14:42:32,128 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values
[2018-12-17 14:42:32,129 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values
[2018-12-17 14:42:32,130 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values
[2018-12-17 14:42:32,131 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2018-12-17 14:42:32,131 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values
[2018-12-17 14:42:32,132 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2018-12-17 14:42:32,132 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring...
[2018-12-17 14:42:32,133 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values
[2018-12-17 14:42:32,134 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values
[2018-12-17 14:42:32,135 INFO L181 SettingsManager]: Finished resetting all preferences to default values...
[2018-12-17 14:42:32,135 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf
[2018-12-17 14:42:32,153 INFO L110 SettingsManager]: Loading preferences was successful
[2018-12-17 14:42:32,153 INFO L112 SettingsManager]: Preferences different from defaults after loading the file:
[2018-12-17 14:42:32,154 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2018-12-17 14:42:32,154 INFO L133 SettingsManager]: * Show backtranslation warnings=false
[2018-12-17 14:42:32,154 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2018-12-17 14:42:32,155 INFO L133 SettingsManager]: * User list type=DISABLED
[2018-12-17 14:42:32,155 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults:
[2018-12-17 14:42:32,155 INFO L133 SettingsManager]: * Explicit value domain=true
[2018-12-17 14:42:32,155 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain
[2018-12-17 14:42:32,156 INFO L133 SettingsManager]: * Octagon Domain=false
[2018-12-17 14:42:32,156 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain
[2018-12-17 14:42:32,156 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true
[2018-12-17 14:42:32,156 INFO L133 SettingsManager]: * Interval Domain=false
[2018-12-17 14:42:32,157 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2018-12-17 14:42:32,157 INFO L133 SettingsManager]: * Create parallel compositions if possible=false
[2018-12-17 14:42:32,158 INFO L133 SettingsManager]: * Use SBE=true
[2018-12-17 14:42:32,158 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2018-12-17 14:42:32,158 INFO L133 SettingsManager]: * sizeof long=4
[2018-12-17 14:42:32,158 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true
[2018-12-17 14:42:32,158 INFO L133 SettingsManager]: * sizeof POINTER=4
[2018-12-17 14:42:32,159 INFO L133 SettingsManager]: * Check division by zero=IGNORE
[2018-12-17 14:42:32,159 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2018-12-17 14:42:32,159 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2018-12-17 14:42:32,159 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2018-12-17 14:42:32,159 INFO L133 SettingsManager]: * sizeof long double=12
[2018-12-17 14:42:32,160 INFO L133 SettingsManager]: * Check if freed pointer was valid=false
[2018-12-17 14:42:32,160 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2018-12-17 14:42:32,160 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2018-12-17 14:42:32,160 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements
[2018-12-17 14:42:32,160 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode
[2018-12-17 14:42:32,161 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-12-17 14:42:32,161 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2018-12-17 14:42:32,161 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2018-12-17 14:42:32,161 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2018-12-17 14:42:32,161 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN
[2018-12-17 14:42:32,162 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2018-12-17 14:42:32,162 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2018-12-17 14:42:32,162 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2018-12-17 14:42:32,162 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES
[2018-12-17 14:42:32,192 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2018-12-17 14:42:32,204 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2018-12-17 14:42:32,208 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2018-12-17 14:42:32,209 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser...
[2018-12-17 14:42:32,210 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized
[2018-12-17 14:42:32,211 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_search.i_5.bpl
[2018-12-17 14:42:32,211 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/linear_search.i_5.bpl'
[2018-12-17 14:42:32,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2018-12-17 14:42:32,264 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2018-12-17 14:42:32,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2018-12-17 14:42:32,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner...
[2018-12-17 14:42:32,265 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized
[2018-12-17 14:42:32,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:42:32" (1/1) ...
[2018-12-17 14:42:32,297 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:42:32" (1/1) ...
[2018-12-17 14:42:32,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2018-12-17 14:42:32,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2018-12-17 14:42:32,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2018-12-17 14:42:32,307 INFO L276 PluginConnector]: Boogie Preprocessor initialized
[2018-12-17 14:42:32,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:42:32" (1/1) ...
[2018-12-17 14:42:32,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:42:32" (1/1) ...
[2018-12-17 14:42:32,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:42:32" (1/1) ...
[2018-12-17 14:42:32,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:42:32" (1/1) ...
[2018-12-17 14:42:32,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:42:32" (1/1) ...
[2018-12-17 14:42:32,330 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:42:32" (1/1) ...
[2018-12-17 14:42:32,331 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:42:32" (1/1) ...
[2018-12-17 14:42:32,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2018-12-17 14:42:32,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2018-12-17 14:42:32,337 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2018-12-17 14:42:32,337 INFO L276 PluginConnector]: RCFGBuilder initialized
[2018-12-17 14:42:32,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.12 02:42:32" (1/1) ...
No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2018-12-17 14:42:32,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2018-12-17 14:42:32,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2018-12-17 14:42:32,949 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2018-12-17 14:42:32,949 INFO L280 CfgBuilder]: Removed 1 assue(true) statements.
[2018-12-17 14:42:32,950 INFO L202 PluginConnector]: Adding new model linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:42:32 BoogieIcfgContainer
[2018-12-17 14:42:32,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2018-12-17 14:42:32,951 INFO L113 PluginConnector]: ------------------------Abstract Interpretation----------------------------
[2018-12-17 14:42:32,951 INFO L271 PluginConnector]: Initializing Abstract Interpretation...
[2018-12-17 14:42:32,951 INFO L276 PluginConnector]: Abstract Interpretation initialized
[2018-12-17 14:42:32,952 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "linear_search.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 02:42:32" (1/1) ...
[2018-12-17 14:42:32,989 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2)
[2018-12-17 14:42:33,921 FATAL L210 ngHoareTripleChecker]: Soundness check failed for the following hoare triple
[2018-12-17 14:42:33,921 FATAL L212 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN
[2018-12-17 14:42:33,923 FATAL L214 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3"
[2018-12-17 14:42:33,924 FATAL L218 ngHoareTripleChecker]: --
[2018-12-17 14:42:33,924 FATAL L219 ngHoareTripleChecker]: Pre: {2147483647#true}
[2018-12-17 14:42:33,938 FATAL L223 ngHoareTripleChecker]: Action: #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE := 0;havoc main_#res;havoc main_#t~nondet3, main_#t~ret5, main_~#a~7.base, main_~#a~7.offset;~SIZE := (if main_#t~nondet3 % 4294967296 < 0 && main_#t~nondet3 % 4294967296 % 2 != 0 then main_#t~nondet3 % 4294967296 / 2 + 1 else main_#t~nondet3 % 4294967296 / 2) + 1;havoc main_#t~nondet3;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := ~SIZE % 4294967296 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~7.base, main_~#a~7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;write~int_old_#memory_int := #memory_int;write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 3, main_~#a~7.base, main_~#a~7.offset + (if ~SIZE % 4294967296 < 0 && ~SIZE % 4294967296 % 2 != 0 then ~SIZE % 4294967296 / 2 + 1 else ~SIZE % 4294967296 / 2) % 4294967296 * 4, 4;havoc #memory_int;assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value];linear_search_#in~a.base, linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q := main_~#a~7.base, main_~#a~7.offset, (if ~SIZE % 4294967296 % 4294967296 <= 2147483647 then ~SIZE % 4294967296 % 4294967296 else ~SIZE % 4294967296 % 4294967296 - 4294967296), 3;havoc linear_search_#res;havoc linear_search_#t~post2, linear_search_#t~mem0, linear_search_#t~short1, linear_search_~a.base, linear_search_~a.offset, linear_search_~n, linear_search_~q, linear_search_~j~5;linear_search_~a.base, linear_search_~a.offset := linear_search_#in~a.base, linear_search_#in~a.offset;linear_search_~n := linear_search_#in~n;linear_search_~q := linear_search_#in~q;linear_search_~j~5 := 0;
[2018-12-17 14:42:33,939 FATAL L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (= 0 |c_ULTIMATE.start_#Ultimate.alloc_#res.base_primed|)) (= |c_#length_primed| (store |c_ULTIMATE.start_#Ultimate.alloc_old_#length_primed| |c_ULTIMATE.start_#Ultimate.alloc_#res.base_primed| |c_ULTIMATE.start_#Ultimate.alloc_~size_primed|)) (= |c_ULTIMATE.start_#Ultimate.alloc_old_#length_primed| |c_#length|) (= |c_ULTIMATE.start_linear_search_#in~a.offset_primed| |c_ULTIMATE.start_main_~#a~7.offset_primed|) (= c_ULTIMATE.start_linear_search_~a.base_primed |c_ULTIMATE.start_linear_search_#in~a.base_primed|) (= |c_ULTIMATE.start_write~int_old_#memory_int_primed| |c_#memory_int|) (= |c_#memory_int_primed| (store |c_ULTIMATE.start_write~int_old_#memory_int_primed| |c_ULTIMATE.start_write~int_#ptr.base_primed| (store (select |c_ULTIMATE.start_write~int_old_#memory_int_primed| |c_ULTIMATE.start_write~int_#ptr.base_primed|) |c_ULTIMATE.start_write~int_#ptr.offset_primed| |c_ULTIMATE.start_write~int_#value_primed|))) (= c_ULTIMATE.start_linear_search_~q_primed |c_ULTIMATE.start_linear_search_#in~q_primed|) (= c_ULTIMATE.start_linear_search_~a.offset_primed |c_ULTIMATE.start_linear_search_#in~a.offset_primed|) (= |c_ULTIMATE.start_write~int_#value_primed| 3) (= |c_#NULL.offset_primed| 0) (= |c_ULTIMATE.start_linear_search_#in~a.base_primed| |c_ULTIMATE.start_main_~#a~7.base_primed|) (= |c_ULTIMATE.start_write~int_#ptr.offset_primed| (+ (* 4 (mod (ite (and (not (= (mod c_~SIZE_primed 2) 0)) (< (mod c_~SIZE_primed 4294967296) 0)) (+ (div (mod c_~SIZE_primed 4294967296) 2) 1) (div (mod c_~SIZE_primed 4294967296) 2)) 4294967296)) |c_ULTIMATE.start_main_~#a~7.offset_primed|)) (= c_ULTIMATE.start_linear_search_~n_primed |c_ULTIMATE.start_linear_search_#in~n_primed|) (= |c_#NULL.base_primed| 0) (= |c_ULTIMATE.start_linear_search_#in~q_primed| 3) (= |c_ULTIMATE.start_#Ultimate.alloc_old_#valid_primed| (store |c_#valid| 0 0)) (= (store |c_ULTIMATE.start_#Ultimate.alloc_old_#valid_primed| |c_ULTIMATE.start_#Ultimate.alloc_#res.base_primed| 1) |c_#valid_primed|) (= |c_ULTIMATE.start_#Ultimate.alloc_#res.offset_primed| 0) (= 0 (select |c_ULTIMATE.start_#Ultimate.alloc_old_#valid_primed| |c_ULTIMATE.start_#Ultimate.alloc_#res.base_primed|)) (= |c_ULTIMATE.start_main_~#a~7.offset_primed| |c_ULTIMATE.start_#Ultimate.alloc_#res.offset_primed|) (= |c_ULTIMATE.start_write~int_#sizeOfWrittenType_primed| 4) (= c_ULTIMATE.start_linear_search_~j~5_primed 0) (= |c_ULTIMATE.start_write~int_#ptr.base_primed| |c_ULTIMATE.start_main_~#a~7.base_primed|) (= |c_ULTIMATE.start_linear_search_#in~n_primed| (ite (<= (mod c_~SIZE_primed 4294967296) 2147483647) (mod c_~SIZE_primed 4294967296) (+ (mod c_~SIZE_primed 4294967296) (- 4294967296)))) (= |c_ULTIMATE.start_#Ultimate.alloc_~size_primed| (* 4 (mod c_~SIZE_primed 4294967296))) (= c_~SIZE_primed (+ (ite (and (not (= (mod |c_aux_v_ULTIMATE.start_main_#t~nondet3_3| 2) 0)) (< (mod |c_aux_v_ULTIMATE.start_main_#t~nondet3_3| 4294967296) 0)) (+ (div (mod |c_aux_v_ULTIMATE.start_main_#t~nondet3_3| 4294967296) 2) 1) (div (mod |c_aux_v_ULTIMATE.start_main_#t~nondet3_3| 4294967296) 2)) 1)) (= |c_ULTIMATE.start_main_~#a~7.base_primed| |c_ULTIMATE.start_#Ultimate.alloc_#res.base_primed|))
[2018-12-17 14:42:33,940 FATAL L225 ngHoareTripleChecker]: Post: {2147483646#(exists ((v_b_6_1 Int) (v_v_24_1 Int) (v_b_7_1 Int) (v_v_43_1 (Array Int Int)) (v_v_45_1 (Array Int Int)) (v_v_30_1 Int) (v_b_19_1 Int) (v_v_48_1 Int) (v_b_11_1 Int) (v_b_16_1 Int) (v_b_18_1 Int) (v_b_17_1 Int) (v_v_8_1 (Array Int Int)) (v_b_10_1 Int)) (and (= |c_ULTIMATE.start_write~int_#sizeOfWrittenType| 4) (= |c_#NULL.base| 0) (= v_v_48_1 3) (= v_v_24_1 1) (not (= c_ULTIMATE.start_linear_search_~a.base 0)) (not (= |c_ULTIMATE.start_write~int_#ptr.base| 0)) (= c_ULTIMATE.start_linear_search_~a.offset 0) (= c_ULTIMATE.start_linear_search_~q 3) (= |c_ULTIMATE.start_main_~#a~7.offset| 0) (= (mod |c_ULTIMATE.start_#Ultimate.alloc_~size| 4) 0) (= |c_ULTIMATE.start_#Ultimate.alloc_#res.offset| 0) (= v_v_43_1 v_v_45_1) (= |c_ULTIMATE.start_write~int_#value| 3) (= |c_ULTIMATE.start_linear_search_#in~a.offset| 0) (= c_ULTIMATE.start_linear_search_~j~5 0) (not (= |c_ULTIMATE.start_#Ultimate.alloc_#res.base| 0)) (not (= |c_ULTIMATE.start_main_~#a~7.base| 0)) (= |c_ULTIMATE.start_linear_search_#in~q| 3) (= (mod |c_ULTIMATE.start_write~int_#ptr.offset| 4) 0) (not (= |c_ULTIMATE.start_linear_search_#in~a.base| 0)) (= v_v_43_1 v_v_8_1) (forall ((v_idx_7 Int) (v_idx_14 Int) (v_idx_8 Int) (v_idx_12 Int) (v_idx_9 Int) (v_idx_13 Int) (v_idx_3 Int) (v_idx_4 Int) (v_idx_2 Int) (v_idx_18 Int) (v_idx_19 Int) (v_idx_17 Int)) (or (< v_idx_8 v_b_6_1) (< v_idx_3 v_b_18_1) (<= v_b_18_1 v_idx_2) (and (= (select (select |c_#memory_int| v_idx_18) v_idx_3) 3) (= (select |c_#valid| v_idx_8) 1) (= (mod (select |c_#length| v_idx_13) 4) 0)) (<= v_b_16_1 v_idx_17) (<= v_b_19_1 v_idx_3) (<= v_b_10_1 v_idx_12) (< v_idx_13 v_b_10_1) (< v_idx_4 v_b_19_1) (<= v_b_6_1 v_idx_7) (<= v_b_11_1 v_idx_13) (< v_idx_14 v_b_11_1) (< v_idx_9 v_b_7_1) (< v_idx_18 v_b_16_1) (<= v_b_17_1 v_idx_18) (<= v_b_7_1 v_idx_8) (< v_idx_19 v_b_17_1))) (= |c_#NULL.offset| 0) (= (mod v_v_30_1 4) 0)))}
[2018-12-17 14:42:33,944 FATAL L263 ngHoareTripleChecker]: --
[2018-12-17 14:42:33,945 FATAL L264 ngHoareTripleChecker]: Simplified triple
[2018-12-17 14:42:33,962 FATAL L265 ngHoareTripleChecker]: Pre: {2147483647#true}
[2018-12-17 14:42:33,962 FATAL L269 ngHoareTripleChecker]: Action: #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE := 0;havoc main_#res;havoc main_#t~nondet3, main_#t~ret5, main_~#a~7.base, main_~#a~7.offset;~SIZE := (if main_#t~nondet3 % 4294967296 < 0 && main_#t~nondet3 % 4294967296 % 2 != 0 then main_#t~nondet3 % 4294967296 / 2 + 1 else main_#t~nondet3 % 4294967296 / 2) + 1;havoc main_#t~nondet3;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := ~SIZE % 4294967296 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_~#a~7.base, main_~#a~7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;write~int_old_#memory_int := #memory_int;write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 3, main_~#a~7.base, main_~#a~7.offset + (if ~SIZE % 4294967296 < 0 && ~SIZE % 4294967296 % 2 != 0 then ~SIZE % 4294967296 / 2 + 1 else ~SIZE % 4294967296 / 2) % 4294967296 * 4, 4;havoc #memory_int;assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value];linear_search_#in~a.base, linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q := main_~#a~7.base, main_~#a~7.offset, (if ~SIZE % 4294967296 % 4294967296 <= 2147483647 then ~SIZE % 4294967296 % 4294967296 else ~SIZE % 4294967296 % 4294967296 - 4294967296), 3;havoc linear_search_#res;havoc linear_search_#t~post2, linear_search_#t~mem0, linear_search_#t~short1, linear_search_~a.base, linear_search_~a.offset, linear_search_~n, linear_search_~q, linear_search_~j~5;linear_search_~a.base, linear_search_~a.offset := linear_search_#in~a.base, linear_search_#in~a.offset;linear_search_~n := linear_search_#in~n;linear_search_~q := linear_search_#in~q;linear_search_~j~5 := 0;
[2018-12-17 14:42:33,963 FATAL L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (= 0 |c_ULTIMATE.start_#Ultimate.alloc_#res.base_primed|)) (= |c_#length_primed| (store |c_ULTIMATE.start_#Ultimate.alloc_old_#length_primed| |c_ULTIMATE.start_#Ultimate.alloc_#res.base_primed| |c_ULTIMATE.start_#Ultimate.alloc_~size_primed|)) (= |c_ULTIMATE.start_#Ultimate.alloc_old_#length_primed| |c_#length|) (= |c_ULTIMATE.start_linear_search_#in~a.offset_primed| |c_ULTIMATE.start_main_~#a~7.offset_primed|) (= c_ULTIMATE.start_linear_search_~a.base_primed |c_ULTIMATE.start_linear_search_#in~a.base_primed|) (= |c_ULTIMATE.start_write~int_old_#memory_int_primed| |c_#memory_int|) (= |c_#memory_int_primed| (store |c_ULTIMATE.start_write~int_old_#memory_int_primed| |c_ULTIMATE.start_write~int_#ptr.base_primed| (store (select |c_ULTIMATE.start_write~int_old_#memory_int_primed| |c_ULTIMATE.start_write~int_#ptr.base_primed|) |c_ULTIMATE.start_write~int_#ptr.offset_primed| |c_ULTIMATE.start_write~int_#value_primed|))) (= c_ULTIMATE.start_linear_search_~q_primed |c_ULTIMATE.start_linear_search_#in~q_primed|) (= c_ULTIMATE.start_linear_search_~a.offset_primed |c_ULTIMATE.start_linear_search_#in~a.offset_primed|) (= |c_ULTIMATE.start_write~int_#value_primed| 3) (= |c_#NULL.offset_primed| 0) (= |c_ULTIMATE.start_linear_search_#in~a.base_primed| |c_ULTIMATE.start_main_~#a~7.base_primed|) (= |c_ULTIMATE.start_write~int_#ptr.offset_primed| (+ (* 4 (mod (ite (and (not (= (mod c_~SIZE_primed 2) 0)) (< (mod c_~SIZE_primed 4294967296) 0)) (+ (div (mod c_~SIZE_primed 4294967296) 2) 1) (div (mod c_~SIZE_primed 4294967296) 2)) 4294967296)) |c_ULTIMATE.start_main_~#a~7.offset_primed|)) (= c_ULTIMATE.start_linear_search_~n_primed |c_ULTIMATE.start_linear_search_#in~n_primed|) (= |c_#NULL.base_primed| 0) (= |c_ULTIMATE.start_linear_search_#in~q_primed| 3) (= |c_ULTIMATE.start_#Ultimate.alloc_old_#valid_primed| (store |c_#valid| 0 0)) (= (store |c_ULTIMATE.start_#Ultimate.alloc_old_#valid_primed| |c_ULTIMATE.start_#Ultimate.alloc_#res.base_primed| 1) |c_#valid_primed|) (= |c_ULTIMATE.start_#Ultimate.alloc_#res.offset_primed| 0) (= 0 (select |c_ULTIMATE.start_#Ultimate.alloc_old_#valid_primed| |c_ULTIMATE.start_#Ultimate.alloc_#res.base_primed|)) (= |c_ULTIMATE.start_main_~#a~7.offset_primed| |c_ULTIMATE.start_#Ultimate.alloc_#res.offset_primed|) (= |c_ULTIMATE.start_write~int_#sizeOfWrittenType_primed| 4) (= c_ULTIMATE.start_linear_search_~j~5_primed 0) (= |c_ULTIMATE.start_write~int_#ptr.base_primed| |c_ULTIMATE.start_main_~#a~7.base_primed|) (= |c_ULTIMATE.start_linear_search_#in~n_primed| (ite (<= (mod c_~SIZE_primed 4294967296) 2147483647) (mod c_~SIZE_primed 4294967296) (+ (mod c_~SIZE_primed 4294967296) (- 4294967296)))) (= |c_ULTIMATE.start_#Ultimate.alloc_~size_primed| (* 4 (mod c_~SIZE_primed 4294967296))) (= c_~SIZE_primed (+ (ite (and (not (= (mod |c_aux_v_ULTIMATE.start_main_#t~nondet3_3| 2) 0)) (< (mod |c_aux_v_ULTIMATE.start_main_#t~nondet3_3| 4294967296) 0)) (+ (div (mod |c_aux_v_ULTIMATE.start_main_#t~nondet3_3| 4294967296) 2) 1) (div (mod |c_aux_v_ULTIMATE.start_main_#t~nondet3_3| 4294967296) 2)) 1)) (= |c_ULTIMATE.start_main_~#a~7.base_primed| |c_ULTIMATE.start_#Ultimate.alloc_#res.base_primed|))
[2018-12-17 14:42:34,818 FATAL L271 ngHoareTripleChecker]: Post: {2147483646#(and (= |ULTIMATE.start_write~int_#sizeOfWrittenType| 4) (= |#NULL.base| 0) (not (= ULTIMATE.start_linear_search_~a.base 0)) (not (= |ULTIMATE.start_write~int_#ptr.base| 0)) (= ULTIMATE.start_linear_search_~a.offset 0) (= ULTIMATE.start_linear_search_~q 3) (= |ULTIMATE.start_main_~#a~7.offset| 0) (= (mod |ULTIMATE.start_#Ultimate.alloc_~size| 4) 0) (= |ULTIMATE.start_#Ultimate.alloc_#res.offset| 0) (= |ULTIMATE.start_write~int_#value| 3) (= |ULTIMATE.start_linear_search_#in~a.offset| 0) (= ULTIMATE.start_linear_search_~j~5 0) (not (= |ULTIMATE.start_#Ultimate.alloc_#res.base| 0)) (not (= |ULTIMATE.start_main_~#a~7.base| 0)) (= |ULTIMATE.start_linear_search_#in~q| 3) (= (mod |ULTIMATE.start_write~int_#ptr.offset| 4) 0) (not (= |ULTIMATE.start_linear_search_#in~a.base| 0)) (= |#NULL.offset| 0))}
[2018-12-17 14:43:05,782 INFO L263 AbstractInterpreter]: Some error location(s) were reachable
[2018-12-17 14:43:05,799 INFO L272 AbstractInterpreter]: Visited 6 different actions 22 times. Merged at 4 different actions 13 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables.
[2018-12-17 14:43:05,801 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation----------------------------
[2018-12-17 14:43:05,803 INFO L168 Benchmark]: Toolchain (without parser) took 33540.42 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 408.9 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -171.6 MB). Peak memory consumption was 237.3 MB. Max. memory is 7.1 GB.
[2018-12-17 14:43:05,806 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-12-17 14:43:05,806 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-12-17 14:43:05,807 INFO L168 Benchmark]: Boogie Preprocessor took 29.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
[2018-12-17 14:43:05,808 INFO L168 Benchmark]: RCFGBuilder took 613.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB.
[2018-12-17 14:43:05,809 INFO L168 Benchmark]: Abstract Interpretation took 32850.81 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 408.9 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -192.8 MB). Peak memory consumption was 216.2 MB. Max. memory is 7.1 GB.
[2018-12-17 14:43:05,814 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- GenericResult: Assertions are enabled
Assertions are enabled
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
* Boogie Procedure Inliner took 42.01 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
* Boogie Preprocessor took 29.00 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB.
* RCFGBuilder took 613.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB.
* Abstract Interpretation took 32850.81 ms. Allocated memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: 408.9 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -192.8 MB). Peak memory consumption was 216.2 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2:
- UnprovableResult [Line: 102]: Unable to prove that assertion always holds
Unable to prove that assertion always holds
Reason: abstract domain could reach this error location.
Possible FailurePath:
[L37] #NULL.base, #NULL.offset := 0, 0;
[L38] #valid := #valid[0 := 0];
[L39] ~SIZE := 0;
[L40] havoc main_#res;
[L41] havoc main_#t~nondet3, main_#t~ret5, main_~#a~7.base, main_~#a~7.offset;
[L42] ~SIZE := (if main_#t~nondet3 % 4294967296 < 0 && main_#t~nondet3 % 4294967296 % 2 != 0 then main_#t~nondet3 % 4294967296 / 2 + 1 else main_#t~nondet3 % 4294967296 / 2) + 1;
[L43] havoc main_#t~nondet3;
[L44] #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;
[L45] #Ultimate.alloc_~size := ~SIZE % 4294967296 * 4;
[L46] havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;
[L47] havoc #valid, #length;
[L48] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;
[L49] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];
[L50] assume #Ultimate.alloc_#res.offset == 0;
[L51] assume #Ultimate.alloc_#res.base != 0;
[L52] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];
[L53] main_~#a~7.base, main_~#a~7.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;
[L54] write~int_old_#memory_int := #memory_int;
[L55] write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 3, main_~#a~7.base, main_~#a~7.offset + (if ~SIZE % 4294967296 < 0 && ~SIZE % 4294967296 % 2 != 0 then ~SIZE % 4294967296 / 2 + 1 else ~SIZE % 4294967296 / 2) % 4294967296 * 4, 4;
[L56] havoc #memory_int;
[L57] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value];
[L58] linear_search_#in~a.base, linear_search_#in~a.offset, linear_search_#in~n, linear_search_#in~q := main_~#a~7.base, main_~#a~7.offset, (if ~SIZE % 4294967296 % 4294967296 <= 2147483647 then ~SIZE % 4294967296 % 4294967296 else ~SIZE % 4294967296 % 4294967296 - 4294967296), 3;
[L59] havoc linear_search_#res;
[L60] havoc linear_search_#t~post2, linear_search_#t~mem0, linear_search_#t~short1, linear_search_~a.base, linear_search_~a.offset, linear_search_~n, linear_search_~q, linear_search_~j~5;
[L61] linear_search_~a.base, linear_search_~a.offset := linear_search_#in~a.base, linear_search_#in~a.offset;
[L62] linear_search_~n := linear_search_#in~n;
[L63] linear_search_~q := linear_search_#in~q;
[L64] linear_search_~j~5 := 0;
[L68] linear_search_#t~short1 := linear_search_~j~5 % 4294967296 < linear_search_~n % 4294967296;
[L69] assume linear_search_#t~short1;
[L70] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := linear_search_~a.base, linear_search_~a.offset + linear_search_~j~5 % 4294967296 * 4, 4;
[L71] havoc read~int_#value;
[L72] assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset];
[L73] linear_search_#t~mem0 := read~int_#value;
[L74] linear_search_#t~short1 := linear_search_#t~mem0 != linear_search_~q;
[L79] assume !linear_search_#t~short1;
[L80] havoc linear_search_#t~mem0;
[L81] havoc linear_search_#t~short1;
[L82] assume !(linear_search_~j~5 % 4294967296 < ~SIZE % 4294967296);
[L83] linear_search_#res := 0;
[L84] main_#t~ret5 := linear_search_#res;
[L85] assume -2147483648 <= main_#t~ret5 && main_#t~ret5 <= 2147483647;
[L86] __VERIFIER_assert_#in~cond := main_#t~ret5;
[L87] havoc __VERIFIER_assert_~cond;
[L88] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;
[L89] assume __VERIFIER_assert_~cond == 0;
[L90] assume !false;
[L102] assert false;
RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces
Received shutdown request...