./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/zero_sum_const_m3.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-crafted/zero_sum_const_m3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd654f01b412711828f8177df5f8f7c2933e3d7436939e6c61fdcced19c9515c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:19:54,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:19:54,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:19:54,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:19:54,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:19:54,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:19:54,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:19:54,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:19:54,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:19:54,035 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:19:54,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:19:54,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:19:54,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:19:54,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:19:54,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:19:54,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:19:54,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:19:54,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:19:54,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:19:54,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:19:54,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:19:54,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:19:54,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:19:54,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:19:54,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:19:54,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:19:54,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:19:54,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:19:54,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:19:54,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:19:54,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:19:54,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:19:54,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:19:54,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:19:54,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:19:54,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:19:54,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:19:54,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:19:54,051 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:19:54,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:19:54,052 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:19:54,053 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:19:54,066 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:19:54,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:19:54,066 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:19:54,067 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:19:54,067 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:19:54,067 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:19:54,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:19:54,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:19:54,068 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:19:54,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:19:54,068 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:19:54,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:19:54,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:19:54,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:19:54,069 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:19:54,069 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:19:54,069 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:19:54,070 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:19:54,070 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:19:54,070 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:19:54,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:19:54,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:19:54,071 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:19:54,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:19:54,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:19:54,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:19:54,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:19:54,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:19:54,072 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:19:54,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:19:54,072 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:19:54,072 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:19:54,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:19:54,072 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd654f01b412711828f8177df5f8f7c2933e3d7436939e6c61fdcced19c9515c [2022-02-20 14:19:54,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:19:54,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:19:54,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:19:54,297 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:19:54,298 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:19:54,299 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/zero_sum_const_m3.c [2022-02-20 14:19:54,346 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e1be770/a94b3929e8fe453abf7ccbaf3959b704/FLAGa506f44b6 [2022-02-20 14:19:54,673 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:19:54,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/zero_sum_const_m3.c [2022-02-20 14:19:54,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e1be770/a94b3929e8fe453abf7ccbaf3959b704/FLAGa506f44b6 [2022-02-20 14:19:55,115 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97e1be770/a94b3929e8fe453abf7ccbaf3959b704 [2022-02-20 14:19:55,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:19:55,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:19:55,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:19:55,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:19:55,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:19:55,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:19:55" (1/1) ... [2022-02-20 14:19:55,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68505bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:19:55, skipping insertion in model container [2022-02-20 14:19:55,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:19:55" (1/1) ... [2022-02-20 14:19:55,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:19:55,144 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:19:55,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/zero_sum_const_m3.c[408,421] [2022-02-20 14:19:55,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:19:55,340 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:19:55,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/zero_sum_const_m3.c[408,421] [2022-02-20 14:19:55,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:19:55,389 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:19:55,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:19:55 WrapperNode [2022-02-20 14:19:55,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:19:55,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:19:55,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:19:55,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:19:55,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:19:55" (1/1) ... [2022-02-20 14:19:55,406 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:19:55" (1/1) ... [2022-02-20 14:19:55,435 INFO L137 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 104 [2022-02-20 14:19:55,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:19:55,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:19:55,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:19:55,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:19:55,442 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:19:55" (1/1) ... [2022-02-20 14:19:55,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:19:55" (1/1) ... [2022-02-20 14:19:55,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:19:55" (1/1) ... [2022-02-20 14:19:55,445 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:19:55" (1/1) ... [2022-02-20 14:19:55,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:19:55" (1/1) ... [2022-02-20 14:19:55,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:19:55" (1/1) ... [2022-02-20 14:19:55,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:19:55" (1/1) ... [2022-02-20 14:19:55,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:19:55,472 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:19:55,472 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:19:55,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:19:55,473 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:19:55" (1/1) ... [2022-02-20 14:19:55,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:19:55,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:19:55,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 14:19:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:19:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:19:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:19:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 14:19:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:19:55,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:19:55,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:19:55,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 14:19:55,597 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:19:55,598 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:19:55,918 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:19:55,923 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:19:55,923 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-02-20 14:19:55,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:19:55 BoogieIcfgContainer [2022-02-20 14:19:55,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:19:55,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:19:55,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:19:55,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:19:55,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:19:55" (1/3) ... [2022-02-20 14:19:55,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c71ea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:19:55, skipping insertion in model container [2022-02-20 14:19:55,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:19:55" (2/3) ... [2022-02-20 14:19:55,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c71ea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:19:55, skipping insertion in model container [2022-02-20 14:19:55,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:19:55" (3/3) ... [2022-02-20 14:19:55,949 INFO L111 eAbstractionObserver]: Analyzing ICFG zero_sum_const_m3.c [2022-02-20 14:19:55,958 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:19:55,958 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:19:56,001 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:19:56,007 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:19:56,008 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:19:56,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:19:56,024 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:19:56,024 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:19:56,025 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:19:56,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:19:56,029 INFO L85 PathProgramCache]: Analyzing trace with hash 534528496, now seen corresponding path program 1 times [2022-02-20 14:19:56,035 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:19:56,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314679158] [2022-02-20 14:19:56,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:19:56,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:19:56,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:56,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {35#true} is VALID [2022-02-20 14:19:56,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post6#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~sum~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {35#true} is VALID [2022-02-20 14:19:56,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~sum~0#1 := 0;main_~i~0#1 := 0; {35#true} is VALID [2022-02-20 14:19:56,175 INFO L290 TraceCheckUtils]: 3: Hoare triple {35#true} assume !true; {36#false} is VALID [2022-02-20 14:19:56,176 INFO L290 TraceCheckUtils]: 4: Hoare triple {36#false} main_~i~0#1 := 0; {36#false} is VALID [2022-02-20 14:19:56,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#false} assume !(main_~i~0#1 < ~SIZE~0); {36#false} is VALID [2022-02-20 14:19:56,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#false} main_~i~0#1 := 0; {36#false} is VALID [2022-02-20 14:19:56,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#false} assume !(main_~i~0#1 < ~SIZE~0); {36#false} is VALID [2022-02-20 14:19:56,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#false} main_~i~0#1 := 0; {36#false} is VALID [2022-02-20 14:19:56,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume !(main_~i~0#1 < ~SIZE~0); {36#false} is VALID [2022-02-20 14:19:56,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {36#false} main_~i~0#1 := 0; {36#false} is VALID [2022-02-20 14:19:56,177 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume !(main_~i~0#1 < ~SIZE~0); {36#false} is VALID [2022-02-20 14:19:56,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#false} main_~i~0#1 := 0; {36#false} is VALID [2022-02-20 14:19:56,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#false} assume !(main_~i~0#1 < ~SIZE~0); {36#false} is VALID [2022-02-20 14:19:56,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#false} main_~i~0#1 := 0; {36#false} is VALID [2022-02-20 14:19:56,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume !true; {36#false} is VALID [2022-02-20 14:19:56,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {36#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {36#false} is VALID [2022-02-20 14:19:56,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {36#false} assume 0 == __VERIFIER_assert_~cond#1; {36#false} is VALID [2022-02-20 14:19:56,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-02-20 14:19:56,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:19:56,182 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:19:56,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314679158] [2022-02-20 14:19:56,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314679158] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:19:56,183 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:19:56,183 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:19:56,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881974883] [2022-02-20 14:19:56,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:19:56,190 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 14:19:56,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:19:56,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:19:56,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:19:56,222 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:19:56,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:19:56,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:19:56,243 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.5666666666666667) internal successors, (47), 31 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:56,294 INFO L93 Difference]: Finished difference Result 59 states and 86 transitions. [2022-02-20 14:19:56,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:19:56,295 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 14:19:56,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:19:56,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2022-02-20 14:19:56,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 86 transitions. [2022-02-20 14:19:56,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 86 transitions. [2022-02-20 14:19:56,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:19:56,387 INFO L225 Difference]: With dead ends: 59 [2022-02-20 14:19:56,388 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 14:19:56,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:19:56,393 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:19:56,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:19:56,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 14:19:56,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 14:19:56,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:19:56,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,412 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,413 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:56,414 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-02-20 14:19:56,414 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-02-20 14:19:56,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:19:56,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:19:56,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states. [2022-02-20 14:19:56,415 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states. [2022-02-20 14:19:56,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:56,416 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-02-20 14:19:56,417 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-02-20 14:19:56,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:19:56,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:19:56,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:19:56,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:19:56,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-02-20 14:19:56,420 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 19 [2022-02-20 14:19:56,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:19:56,420 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-02-20 14:19:56,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,421 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-02-20 14:19:56,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:19:56,421 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:19:56,421 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:19:56,421 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:19:56,422 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:19:56,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:19:56,422 INFO L85 PathProgramCache]: Analyzing trace with hash -697412484, now seen corresponding path program 1 times [2022-02-20 14:19:56,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:19:56,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077565254] [2022-02-20 14:19:56,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:19:56,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:19:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:56,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {201#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {201#true} is VALID [2022-02-20 14:19:56,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {201#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post6#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~sum~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {201#true} is VALID [2022-02-20 14:19:56,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {201#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~sum~0#1 := 0;main_~i~0#1 := 0; {203#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 ~SIZE~0))} is VALID [2022-02-20 14:19:56,467 INFO L290 TraceCheckUtils]: 3: Hoare triple {203#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 ~SIZE~0))} assume !(main_~i~0#1 < ~SIZE~0); {202#false} is VALID [2022-02-20 14:19:56,467 INFO L290 TraceCheckUtils]: 4: Hoare triple {202#false} main_~i~0#1 := 0; {202#false} is VALID [2022-02-20 14:19:56,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {202#false} assume !(main_~i~0#1 < ~SIZE~0); {202#false} is VALID [2022-02-20 14:19:56,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {202#false} main_~i~0#1 := 0; {202#false} is VALID [2022-02-20 14:19:56,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#false} assume !(main_~i~0#1 < ~SIZE~0); {202#false} is VALID [2022-02-20 14:19:56,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {202#false} main_~i~0#1 := 0; {202#false} is VALID [2022-02-20 14:19:56,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {202#false} assume !(main_~i~0#1 < ~SIZE~0); {202#false} is VALID [2022-02-20 14:19:56,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {202#false} main_~i~0#1 := 0; {202#false} is VALID [2022-02-20 14:19:56,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {202#false} assume !(main_~i~0#1 < ~SIZE~0); {202#false} is VALID [2022-02-20 14:19:56,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {202#false} main_~i~0#1 := 0; {202#false} is VALID [2022-02-20 14:19:56,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {202#false} assume !(main_~i~0#1 < ~SIZE~0); {202#false} is VALID [2022-02-20 14:19:56,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {202#false} main_~i~0#1 := 0; {202#false} is VALID [2022-02-20 14:19:56,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {202#false} assume !(main_~i~0#1 < ~SIZE~0); {202#false} is VALID [2022-02-20 14:19:56,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {202#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {202#false} is VALID [2022-02-20 14:19:56,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {202#false} assume 0 == __VERIFIER_assert_~cond#1; {202#false} is VALID [2022-02-20 14:19:56,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {202#false} assume !false; {202#false} is VALID [2022-02-20 14:19:56,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:19:56,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:19:56,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077565254] [2022-02-20 14:19:56,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077565254] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:19:56,471 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:19:56,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:19:56,471 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093351717] [2022-02-20 14:19:56,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:19:56,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 14:19:56,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:19:56,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:19:56,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:19:56,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:19:56,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:19:56,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:19:56,487 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:56,544 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-02-20 14:19:56,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:19:56,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 14:19:56,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:19:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-02-20 14:19:56,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-02-20 14:19:56,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-02-20 14:19:56,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:19:56,588 INFO L225 Difference]: With dead ends: 51 [2022-02-20 14:19:56,588 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 14:19:56,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:19:56,590 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:19:56,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 34 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:19:56,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 14:19:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-02-20 14:19:56,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:19:56,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,594 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,594 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:56,595 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-02-20 14:19:56,596 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-20 14:19:56,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:19:56,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:19:56,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 14:19:56,597 INFO L87 Difference]: Start difference. First operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 14:19:56,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:56,598 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-02-20 14:19:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-20 14:19:56,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:19:56,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:19:56,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:19:56,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:19:56,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-02-20 14:19:56,600 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 19 [2022-02-20 14:19:56,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:19:56,600 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-02-20 14:19:56,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,600 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 14:19:56,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:19:56,601 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:19:56,601 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:19:56,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:19:56,602 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:19:56,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:19:56,602 INFO L85 PathProgramCache]: Analyzing trace with hash -506383970, now seen corresponding path program 1 times [2022-02-20 14:19:56,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:19:56,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174039042] [2022-02-20 14:19:56,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:19:56,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:19:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:56,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {365#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {365#true} is VALID [2022-02-20 14:19:56,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post6#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~sum~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {365#true} is VALID [2022-02-20 14:19:56,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {365#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~sum~0#1 := 0;main_~i~0#1 := 0; {367#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:56,648 INFO L290 TraceCheckUtils]: 3: Hoare triple {367#(<= 2 ~SIZE~0)} assume !!(main_~i~0#1 < ~SIZE~0);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4); {367#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:56,648 INFO L290 TraceCheckUtils]: 4: Hoare triple {367#(<= 2 ~SIZE~0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {367#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:56,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {367#(<= 2 ~SIZE~0)} assume !(main_~i~0#1 < ~SIZE~0); {367#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:56,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {367#(<= 2 ~SIZE~0)} main_~i~0#1 := 0; {368#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 ~SIZE~0))} is VALID [2022-02-20 14:19:56,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {368#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 ~SIZE~0))} assume !(main_~i~0#1 < ~SIZE~0); {366#false} is VALID [2022-02-20 14:19:56,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {366#false} main_~i~0#1 := 0; {366#false} is VALID [2022-02-20 14:19:56,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {366#false} assume !(main_~i~0#1 < ~SIZE~0); {366#false} is VALID [2022-02-20 14:19:56,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {366#false} main_~i~0#1 := 0; {366#false} is VALID [2022-02-20 14:19:56,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {366#false} assume !(main_~i~0#1 < ~SIZE~0); {366#false} is VALID [2022-02-20 14:19:56,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {366#false} main_~i~0#1 := 0; {366#false} is VALID [2022-02-20 14:19:56,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {366#false} assume !(main_~i~0#1 < ~SIZE~0); {366#false} is VALID [2022-02-20 14:19:56,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {366#false} main_~i~0#1 := 0; {366#false} is VALID [2022-02-20 14:19:56,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {366#false} assume !(main_~i~0#1 < ~SIZE~0); {366#false} is VALID [2022-02-20 14:19:56,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {366#false} main_~i~0#1 := 0; {366#false} is VALID [2022-02-20 14:19:56,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {366#false} assume !(main_~i~0#1 < ~SIZE~0); {366#false} is VALID [2022-02-20 14:19:56,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {366#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {366#false} is VALID [2022-02-20 14:19:56,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {366#false} assume 0 == __VERIFIER_assert_~cond#1; {366#false} is VALID [2022-02-20 14:19:56,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-02-20 14:19:56,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:19:56,653 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:19:56,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174039042] [2022-02-20 14:19:56,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174039042] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:19:56,653 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:19:56,653 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:19:56,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738164062] [2022-02-20 14:19:56,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:19:56,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 14:19:56,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:19:56,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:19:56,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:19:56,669 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:19:56,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:19:56,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:19:56,670 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:56,767 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2022-02-20 14:19:56,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:19:56,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 14:19:56,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:19:56,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-02-20 14:19:56,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-02-20 14:19:56,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 76 transitions. [2022-02-20 14:19:56,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:19:56,823 INFO L225 Difference]: With dead ends: 60 [2022-02-20 14:19:56,823 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 14:19:56,824 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:19:56,825 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:19:56,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 15 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:19:56,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 14:19:56,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-02-20 14:19:56,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:19:56,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,836 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,836 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:56,837 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-02-20 14:19:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-02-20 14:19:56,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:19:56,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:19:56,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states. [2022-02-20 14:19:56,838 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states. [2022-02-20 14:19:56,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:56,839 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-02-20 14:19:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-02-20 14:19:56,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:19:56,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:19:56,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:19:56,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:19:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-02-20 14:19:56,841 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 21 [2022-02-20 14:19:56,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:19:56,842 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-02-20 14:19:56,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:56,842 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-02-20 14:19:56,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 14:19:56,843 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:19:56,843 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:19:56,843 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:19:56,843 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:19:56,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:19:56,844 INFO L85 PathProgramCache]: Analyzing trace with hash 615846698, now seen corresponding path program 1 times [2022-02-20 14:19:56,844 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:19:56,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834192660] [2022-02-20 14:19:56,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:19:56,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:19:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:56,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {580#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {580#true} is VALID [2022-02-20 14:19:56,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {580#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post6#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~sum~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {580#true} is VALID [2022-02-20 14:19:56,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {580#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~sum~0#1 := 0;main_~i~0#1 := 0; {582#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 ~SIZE~0))} is VALID [2022-02-20 14:19:56,903 INFO L290 TraceCheckUtils]: 3: Hoare triple {582#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 ~SIZE~0))} assume !!(main_~i~0#1 < ~SIZE~0);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4); {582#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 ~SIZE~0))} is VALID [2022-02-20 14:19:56,903 INFO L290 TraceCheckUtils]: 4: Hoare triple {582#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 ~SIZE~0))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {583#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) ~SIZE~0)} is VALID [2022-02-20 14:19:56,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {583#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) ~SIZE~0)} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:56,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {581#false} main_~i~0#1 := 0; {581#false} is VALID [2022-02-20 14:19:56,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {581#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem8#1;havoc main_#t~mem8#1; {581#false} is VALID [2022-02-20 14:19:56,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {581#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {581#false} is VALID [2022-02-20 14:19:56,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {581#false} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:56,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {581#false} main_~i~0#1 := 0; {581#false} is VALID [2022-02-20 14:19:56,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {581#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem10#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem10#1;havoc main_#t~mem10#1; {581#false} is VALID [2022-02-20 14:19:56,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {581#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {581#false} is VALID [2022-02-20 14:19:56,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {581#false} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:56,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {581#false} main_~i~0#1 := 0; {581#false} is VALID [2022-02-20 14:19:56,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {581#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem12#1;havoc main_#t~mem12#1; {581#false} is VALID [2022-02-20 14:19:56,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {581#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {581#false} is VALID [2022-02-20 14:19:56,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {581#false} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:56,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {581#false} main_~i~0#1 := 0; {581#false} is VALID [2022-02-20 14:19:56,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {581#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem14#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem14#1;havoc main_#t~mem14#1; {581#false} is VALID [2022-02-20 14:19:56,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {581#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {581#false} is VALID [2022-02-20 14:19:56,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {581#false} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:56,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {581#false} main_~i~0#1 := 0; {581#false} is VALID [2022-02-20 14:19:56,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {581#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem16#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem16#1;havoc main_#t~mem16#1; {581#false} is VALID [2022-02-20 14:19:56,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {581#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {581#false} is VALID [2022-02-20 14:19:56,907 INFO L290 TraceCheckUtils]: 25: Hoare triple {581#false} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:56,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {581#false} main_~i~0#1 := 0; {581#false} is VALID [2022-02-20 14:19:56,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {581#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem18#1;havoc main_#t~mem18#1; {581#false} is VALID [2022-02-20 14:19:56,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {581#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {581#false} is VALID [2022-02-20 14:19:56,908 INFO L290 TraceCheckUtils]: 29: Hoare triple {581#false} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:56,908 INFO L290 TraceCheckUtils]: 30: Hoare triple {581#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {581#false} is VALID [2022-02-20 14:19:56,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {581#false} assume 0 == __VERIFIER_assert_~cond#1; {581#false} is VALID [2022-02-20 14:19:56,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {581#false} assume !false; {581#false} is VALID [2022-02-20 14:19:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 14:19:56,909 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:19:56,909 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834192660] [2022-02-20 14:19:56,910 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834192660] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:19:56,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811643893] [2022-02-20 14:19:56,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:19:56,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:19:56,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:19:56,912 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:19:56,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 14:19:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:56,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:19:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:56,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:19:57,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {580#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {580#true} is VALID [2022-02-20 14:19:57,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {580#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post6#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~sum~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {580#true} is VALID [2022-02-20 14:19:57,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {580#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~sum~0#1 := 0;main_~i~0#1 := 0; {593#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:19:57,121 INFO L290 TraceCheckUtils]: 3: Hoare triple {593#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (< 1 ~SIZE~0))} assume !!(main_~i~0#1 < ~SIZE~0);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4); {593#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:19:57,122 INFO L290 TraceCheckUtils]: 4: Hoare triple {593#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (< 1 ~SIZE~0))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {600#(and (< 1 ~SIZE~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:19:57,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {600#(and (< 1 ~SIZE~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:57,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {581#false} main_~i~0#1 := 0; {581#false} is VALID [2022-02-20 14:19:57,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {581#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem8#1;havoc main_#t~mem8#1; {581#false} is VALID [2022-02-20 14:19:57,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {581#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {581#false} is VALID [2022-02-20 14:19:57,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {581#false} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:57,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {581#false} main_~i~0#1 := 0; {581#false} is VALID [2022-02-20 14:19:57,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {581#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem10#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem10#1;havoc main_#t~mem10#1; {581#false} is VALID [2022-02-20 14:19:57,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {581#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {581#false} is VALID [2022-02-20 14:19:57,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {581#false} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:57,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {581#false} main_~i~0#1 := 0; {581#false} is VALID [2022-02-20 14:19:57,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {581#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem12#1;havoc main_#t~mem12#1; {581#false} is VALID [2022-02-20 14:19:57,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {581#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {581#false} is VALID [2022-02-20 14:19:57,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {581#false} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:57,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {581#false} main_~i~0#1 := 0; {581#false} is VALID [2022-02-20 14:19:57,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {581#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem14#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem14#1;havoc main_#t~mem14#1; {581#false} is VALID [2022-02-20 14:19:57,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {581#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {581#false} is VALID [2022-02-20 14:19:57,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {581#false} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:57,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {581#false} main_~i~0#1 := 0; {581#false} is VALID [2022-02-20 14:19:57,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {581#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem16#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem16#1;havoc main_#t~mem16#1; {581#false} is VALID [2022-02-20 14:19:57,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {581#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {581#false} is VALID [2022-02-20 14:19:57,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {581#false} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:57,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {581#false} main_~i~0#1 := 0; {581#false} is VALID [2022-02-20 14:19:57,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {581#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem18#1;havoc main_#t~mem18#1; {581#false} is VALID [2022-02-20 14:19:57,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {581#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {581#false} is VALID [2022-02-20 14:19:57,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {581#false} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:57,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {581#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {581#false} is VALID [2022-02-20 14:19:57,136 INFO L290 TraceCheckUtils]: 31: Hoare triple {581#false} assume 0 == __VERIFIER_assert_~cond#1; {581#false} is VALID [2022-02-20 14:19:57,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {581#false} assume !false; {581#false} is VALID [2022-02-20 14:19:57,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 14:19:57,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:19:57,289 INFO L290 TraceCheckUtils]: 32: Hoare triple {581#false} assume !false; {581#false} is VALID [2022-02-20 14:19:57,289 INFO L290 TraceCheckUtils]: 31: Hoare triple {581#false} assume 0 == __VERIFIER_assert_~cond#1; {581#false} is VALID [2022-02-20 14:19:57,291 INFO L290 TraceCheckUtils]: 30: Hoare triple {581#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {581#false} is VALID [2022-02-20 14:19:57,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {581#false} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:57,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {581#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {581#false} is VALID [2022-02-20 14:19:57,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {581#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem18#1;havoc main_#t~mem18#1; {581#false} is VALID [2022-02-20 14:19:57,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {581#false} main_~i~0#1 := 0; {581#false} is VALID [2022-02-20 14:19:57,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {581#false} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:57,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {581#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {581#false} is VALID [2022-02-20 14:19:57,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {581#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem16#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem16#1;havoc main_#t~mem16#1; {581#false} is VALID [2022-02-20 14:19:57,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {581#false} main_~i~0#1 := 0; {581#false} is VALID [2022-02-20 14:19:57,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {581#false} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:57,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {581#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {581#false} is VALID [2022-02-20 14:19:57,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {581#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem14#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem14#1;havoc main_#t~mem14#1; {581#false} is VALID [2022-02-20 14:19:57,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {581#false} main_~i~0#1 := 0; {581#false} is VALID [2022-02-20 14:19:57,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {581#false} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:57,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {581#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {581#false} is VALID [2022-02-20 14:19:57,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {581#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem12#1;havoc main_#t~mem12#1; {581#false} is VALID [2022-02-20 14:19:57,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {581#false} main_~i~0#1 := 0; {581#false} is VALID [2022-02-20 14:19:57,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {581#false} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:57,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {581#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {581#false} is VALID [2022-02-20 14:19:57,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {581#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem10#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem10#1;havoc main_#t~mem10#1; {581#false} is VALID [2022-02-20 14:19:57,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {581#false} main_~i~0#1 := 0; {581#false} is VALID [2022-02-20 14:19:57,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {581#false} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:57,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {581#false} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {581#false} is VALID [2022-02-20 14:19:57,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {581#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem8#1;havoc main_#t~mem8#1; {581#false} is VALID [2022-02-20 14:19:57,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {581#false} main_~i~0#1 := 0; {581#false} is VALID [2022-02-20 14:19:57,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {583#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) ~SIZE~0)} assume !(main_~i~0#1 < ~SIZE~0); {581#false} is VALID [2022-02-20 14:19:57,303 INFO L290 TraceCheckUtils]: 4: Hoare triple {769#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) ~SIZE~0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {583#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) ~SIZE~0)} is VALID [2022-02-20 14:19:57,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {769#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) ~SIZE~0)} assume !!(main_~i~0#1 < ~SIZE~0);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4); {769#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) ~SIZE~0)} is VALID [2022-02-20 14:19:57,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {580#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~sum~0#1 := 0;main_~i~0#1 := 0; {769#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) ~SIZE~0)} is VALID [2022-02-20 14:19:57,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {580#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post6#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~sum~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {580#true} is VALID [2022-02-20 14:19:57,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {580#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {580#true} is VALID [2022-02-20 14:19:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 14:19:57,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811643893] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:19:57,305 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:19:57,306 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:19:57,306 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636516742] [2022-02-20 14:19:57,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:19:57,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-02-20 14:19:57,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:19:57,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:57,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:19:57,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:19:57,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:19:57,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:19:57,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:19:57,341 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:57,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:57,489 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-02-20 14:19:57,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:19:57,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-02-20 14:19:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:19:57,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:57,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-02-20 14:19:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-02-20 14:19:57,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-02-20 14:19:57,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:19:57,539 INFO L225 Difference]: With dead ends: 65 [2022-02-20 14:19:57,539 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 14:19:57,540 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:19:57,545 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 4 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:19:57,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 31 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:19:57,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 14:19:57,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-02-20 14:19:57,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:19:57,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:57,562 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:57,562 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:57,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:57,563 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-20 14:19:57,563 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-20 14:19:57,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:19:57,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:19:57,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-20 14:19:57,564 INFO L87 Difference]: Start difference. First operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 37 states. [2022-02-20 14:19:57,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:57,565 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-20 14:19:57,565 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-20 14:19:57,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:19:57,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:19:57,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:19:57,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:19:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-02-20 14:19:57,567 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 33 [2022-02-20 14:19:57,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:19:57,568 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-02-20 14:19:57,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-02-20 14:19:57,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 14:19:57,569 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:19:57,569 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:19:57,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 14:19:57,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:19:57,786 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:19:57,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:19:57,787 INFO L85 PathProgramCache]: Analyzing trace with hash -160084788, now seen corresponding path program 2 times [2022-02-20 14:19:57,787 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:19:57,787 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431776338] [2022-02-20 14:19:57,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:19:57,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:19:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:57,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {998#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {998#true} is VALID [2022-02-20 14:19:57,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {998#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post6#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~sum~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {998#true} is VALID [2022-02-20 14:19:57,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {998#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~sum~0#1 := 0;main_~i~0#1 := 0; {1000#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:57,894 INFO L290 TraceCheckUtils]: 3: Hoare triple {1000#(<= 2 ~SIZE~0)} assume !!(main_~i~0#1 < ~SIZE~0);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4); {1000#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:57,894 INFO L290 TraceCheckUtils]: 4: Hoare triple {1000#(<= 2 ~SIZE~0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1000#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:57,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {1000#(<= 2 ~SIZE~0)} assume !!(main_~i~0#1 < ~SIZE~0);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4); {1000#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:57,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {1000#(<= 2 ~SIZE~0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1000#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:57,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {1000#(<= 2 ~SIZE~0)} assume !(main_~i~0#1 < ~SIZE~0); {1000#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:57,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {1000#(<= 2 ~SIZE~0)} main_~i~0#1 := 0; {1001#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 ~SIZE~0))} is VALID [2022-02-20 14:19:57,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {1001#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 ~SIZE~0))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem8#1;havoc main_#t~mem8#1; {1001#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 ~SIZE~0))} is VALID [2022-02-20 14:19:57,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {1001#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 ~SIZE~0))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1002#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) ~SIZE~0)} is VALID [2022-02-20 14:19:57,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {1002#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) ~SIZE~0)} assume !(main_~i~0#1 < ~SIZE~0); {999#false} is VALID [2022-02-20 14:19:57,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {999#false} main_~i~0#1 := 0; {999#false} is VALID [2022-02-20 14:19:57,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {999#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem10#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem10#1;havoc main_#t~mem10#1; {999#false} is VALID [2022-02-20 14:19:57,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {999#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {999#false} is VALID [2022-02-20 14:19:57,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {999#false} assume !(main_~i~0#1 < ~SIZE~0); {999#false} is VALID [2022-02-20 14:19:57,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {999#false} main_~i~0#1 := 0; {999#false} is VALID [2022-02-20 14:19:57,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {999#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem12#1;havoc main_#t~mem12#1; {999#false} is VALID [2022-02-20 14:19:57,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {999#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {999#false} is VALID [2022-02-20 14:19:57,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {999#false} assume !(main_~i~0#1 < ~SIZE~0); {999#false} is VALID [2022-02-20 14:19:57,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {999#false} main_~i~0#1 := 0; {999#false} is VALID [2022-02-20 14:19:57,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {999#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem14#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem14#1;havoc main_#t~mem14#1; {999#false} is VALID [2022-02-20 14:19:57,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {999#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {999#false} is VALID [2022-02-20 14:19:57,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {999#false} assume !(main_~i~0#1 < ~SIZE~0); {999#false} is VALID [2022-02-20 14:19:57,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {999#false} main_~i~0#1 := 0; {999#false} is VALID [2022-02-20 14:19:57,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {999#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem16#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem16#1;havoc main_#t~mem16#1; {999#false} is VALID [2022-02-20 14:19:57,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {999#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {999#false} is VALID [2022-02-20 14:19:57,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {999#false} assume !(main_~i~0#1 < ~SIZE~0); {999#false} is VALID [2022-02-20 14:19:57,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {999#false} main_~i~0#1 := 0; {999#false} is VALID [2022-02-20 14:19:57,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {999#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem18#1;havoc main_#t~mem18#1; {999#false} is VALID [2022-02-20 14:19:57,899 INFO L290 TraceCheckUtils]: 30: Hoare triple {999#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {999#false} is VALID [2022-02-20 14:19:57,899 INFO L290 TraceCheckUtils]: 31: Hoare triple {999#false} assume !(main_~i~0#1 < ~SIZE~0); {999#false} is VALID [2022-02-20 14:19:57,899 INFO L290 TraceCheckUtils]: 32: Hoare triple {999#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {999#false} is VALID [2022-02-20 14:19:57,899 INFO L290 TraceCheckUtils]: 33: Hoare triple {999#false} assume 0 == __VERIFIER_assert_~cond#1; {999#false} is VALID [2022-02-20 14:19:57,899 INFO L290 TraceCheckUtils]: 34: Hoare triple {999#false} assume !false; {999#false} is VALID [2022-02-20 14:19:57,899 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 14:19:57,899 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:19:57,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431776338] [2022-02-20 14:19:57,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431776338] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:19:57,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144773317] [2022-02-20 14:19:57,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:19:57,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:19:57,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:19:57,903 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:19:57,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 14:19:58,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:19:58,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:19:58,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:19:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:19:58,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:19:58,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {998#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {998#true} is VALID [2022-02-20 14:19:58,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {998#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post6#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~sum~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {998#true} is VALID [2022-02-20 14:19:58,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {998#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~sum~0#1 := 0;main_~i~0#1 := 0; {1000#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:58,166 INFO L290 TraceCheckUtils]: 3: Hoare triple {1000#(<= 2 ~SIZE~0)} assume !!(main_~i~0#1 < ~SIZE~0);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4); {1000#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:58,169 INFO L290 TraceCheckUtils]: 4: Hoare triple {1000#(<= 2 ~SIZE~0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1000#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:58,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {1000#(<= 2 ~SIZE~0)} assume !!(main_~i~0#1 < ~SIZE~0);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4); {1000#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:58,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {1000#(<= 2 ~SIZE~0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1000#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:58,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {1000#(<= 2 ~SIZE~0)} assume !(main_~i~0#1 < ~SIZE~0); {1000#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:58,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {1000#(<= 2 ~SIZE~0)} main_~i~0#1 := 0; {1030#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 ~SIZE~0))} is VALID [2022-02-20 14:19:58,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {1030#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 ~SIZE~0))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem8#1;havoc main_#t~mem8#1; {1030#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 ~SIZE~0))} is VALID [2022-02-20 14:19:58,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {1030#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (<= 2 ~SIZE~0))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1037#(and (<= 2 ~SIZE~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:19:58,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {1037#(and (<= 2 ~SIZE~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_~i~0#1 < ~SIZE~0); {999#false} is VALID [2022-02-20 14:19:58,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {999#false} main_~i~0#1 := 0; {999#false} is VALID [2022-02-20 14:19:58,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {999#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem10#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem10#1;havoc main_#t~mem10#1; {999#false} is VALID [2022-02-20 14:19:58,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {999#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {999#false} is VALID [2022-02-20 14:19:58,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {999#false} assume !(main_~i~0#1 < ~SIZE~0); {999#false} is VALID [2022-02-20 14:19:58,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {999#false} main_~i~0#1 := 0; {999#false} is VALID [2022-02-20 14:19:58,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {999#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem12#1;havoc main_#t~mem12#1; {999#false} is VALID [2022-02-20 14:19:58,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {999#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {999#false} is VALID [2022-02-20 14:19:58,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {999#false} assume !(main_~i~0#1 < ~SIZE~0); {999#false} is VALID [2022-02-20 14:19:58,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {999#false} main_~i~0#1 := 0; {999#false} is VALID [2022-02-20 14:19:58,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {999#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem14#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem14#1;havoc main_#t~mem14#1; {999#false} is VALID [2022-02-20 14:19:58,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {999#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {999#false} is VALID [2022-02-20 14:19:58,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {999#false} assume !(main_~i~0#1 < ~SIZE~0); {999#false} is VALID [2022-02-20 14:19:58,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {999#false} main_~i~0#1 := 0; {999#false} is VALID [2022-02-20 14:19:58,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {999#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem16#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem16#1;havoc main_#t~mem16#1; {999#false} is VALID [2022-02-20 14:19:58,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {999#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {999#false} is VALID [2022-02-20 14:19:58,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {999#false} assume !(main_~i~0#1 < ~SIZE~0); {999#false} is VALID [2022-02-20 14:19:58,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {999#false} main_~i~0#1 := 0; {999#false} is VALID [2022-02-20 14:19:58,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {999#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem18#1;havoc main_#t~mem18#1; {999#false} is VALID [2022-02-20 14:19:58,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {999#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {999#false} is VALID [2022-02-20 14:19:58,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {999#false} assume !(main_~i~0#1 < ~SIZE~0); {999#false} is VALID [2022-02-20 14:19:58,180 INFO L290 TraceCheckUtils]: 32: Hoare triple {999#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {999#false} is VALID [2022-02-20 14:19:58,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {999#false} assume 0 == __VERIFIER_assert_~cond#1; {999#false} is VALID [2022-02-20 14:19:58,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {999#false} assume !false; {999#false} is VALID [2022-02-20 14:19:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 14:19:58,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:19:58,292 INFO L290 TraceCheckUtils]: 34: Hoare triple {999#false} assume !false; {999#false} is VALID [2022-02-20 14:19:58,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {999#false} assume 0 == __VERIFIER_assert_~cond#1; {999#false} is VALID [2022-02-20 14:19:58,292 INFO L290 TraceCheckUtils]: 32: Hoare triple {999#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {999#false} is VALID [2022-02-20 14:19:58,292 INFO L290 TraceCheckUtils]: 31: Hoare triple {999#false} assume !(main_~i~0#1 < ~SIZE~0); {999#false} is VALID [2022-02-20 14:19:58,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {999#false} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {999#false} is VALID [2022-02-20 14:19:58,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {999#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem18#1;havoc main_#t~mem18#1; {999#false} is VALID [2022-02-20 14:19:58,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {999#false} main_~i~0#1 := 0; {999#false} is VALID [2022-02-20 14:19:58,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {999#false} assume !(main_~i~0#1 < ~SIZE~0); {999#false} is VALID [2022-02-20 14:19:58,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {999#false} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {999#false} is VALID [2022-02-20 14:19:58,293 INFO L290 TraceCheckUtils]: 25: Hoare triple {999#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem16#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem16#1;havoc main_#t~mem16#1; {999#false} is VALID [2022-02-20 14:19:58,293 INFO L290 TraceCheckUtils]: 24: Hoare triple {999#false} main_~i~0#1 := 0; {999#false} is VALID [2022-02-20 14:19:58,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {999#false} assume !(main_~i~0#1 < ~SIZE~0); {999#false} is VALID [2022-02-20 14:19:58,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {999#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {999#false} is VALID [2022-02-20 14:19:58,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {999#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem14#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem14#1;havoc main_#t~mem14#1; {999#false} is VALID [2022-02-20 14:19:58,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {999#false} main_~i~0#1 := 0; {999#false} is VALID [2022-02-20 14:19:58,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {999#false} assume !(main_~i~0#1 < ~SIZE~0); {999#false} is VALID [2022-02-20 14:19:58,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {999#false} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {999#false} is VALID [2022-02-20 14:19:58,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {999#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem12#1;havoc main_#t~mem12#1; {999#false} is VALID [2022-02-20 14:19:58,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {999#false} main_~i~0#1 := 0; {999#false} is VALID [2022-02-20 14:19:58,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {999#false} assume !(main_~i~0#1 < ~SIZE~0); {999#false} is VALID [2022-02-20 14:19:58,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {999#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {999#false} is VALID [2022-02-20 14:19:58,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {999#false} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem10#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem10#1;havoc main_#t~mem10#1; {999#false} is VALID [2022-02-20 14:19:58,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {999#false} main_~i~0#1 := 0; {999#false} is VALID [2022-02-20 14:19:58,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {1002#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) ~SIZE~0)} assume !(main_~i~0#1 < ~SIZE~0); {999#false} is VALID [2022-02-20 14:19:58,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {1182#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) ~SIZE~0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1002#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) ~SIZE~0)} is VALID [2022-02-20 14:19:58,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {1182#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) ~SIZE~0)} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem8#1;havoc main_#t~mem8#1; {1182#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) ~SIZE~0)} is VALID [2022-02-20 14:19:58,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {1000#(<= 2 ~SIZE~0)} main_~i~0#1 := 0; {1182#(<= (+ 2 |ULTIMATE.start_main_~i~0#1|) ~SIZE~0)} is VALID [2022-02-20 14:19:58,304 INFO L290 TraceCheckUtils]: 7: Hoare triple {1000#(<= 2 ~SIZE~0)} assume !(main_~i~0#1 < ~SIZE~0); {1000#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:58,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {1000#(<= 2 ~SIZE~0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1000#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:58,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {1000#(<= 2 ~SIZE~0)} assume !!(main_~i~0#1 < ~SIZE~0);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4); {1000#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:58,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {1000#(<= 2 ~SIZE~0)} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1000#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:58,306 INFO L290 TraceCheckUtils]: 3: Hoare triple {1000#(<= 2 ~SIZE~0)} assume !!(main_~i~0#1 < ~SIZE~0);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4); {1000#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:58,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {998#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~sum~0#1 := 0;main_~i~0#1 := 0; {1000#(<= 2 ~SIZE~0)} is VALID [2022-02-20 14:19:58,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {998#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post6#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~sum~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {998#true} is VALID [2022-02-20 14:19:58,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {998#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {998#true} is VALID [2022-02-20 14:19:58,307 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 14:19:58,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144773317] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:19:58,307 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:19:58,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-02-20 14:19:58,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166386877] [2022-02-20 14:19:58,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:19:58,309 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-02-20 14:19:58,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:19:58,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:58,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:19:58,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 14:19:58,344 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:19:58,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 14:19:58,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-02-20 14:19:58,345 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:58,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:58,557 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-02-20 14:19:58,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:19:58,557 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-02-20 14:19:58,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:19:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-02-20 14:19:58,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:58,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2022-02-20 14:19:58,559 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 90 transitions. [2022-02-20 14:19:58,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:19:58,618 INFO L225 Difference]: With dead ends: 79 [2022-02-20 14:19:58,618 INFO L226 Difference]: Without dead ends: 55 [2022-02-20 14:19:58,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:19:58,619 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:19:58,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 21 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:19:58,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-02-20 14:19:58,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2022-02-20 14:19:58,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:19:58,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 48 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:58,633 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 48 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:58,633 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 48 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:58,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:58,634 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-02-20 14:19:58,634 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-02-20 14:19:58,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:19:58,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:19:58,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 55 states. [2022-02-20 14:19:58,635 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 55 states. [2022-02-20 14:19:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:19:58,636 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-02-20 14:19:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-02-20 14:19:58,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:19:58,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:19:58,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:19:58,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:19:58,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.148936170212766) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-02-20 14:19:58,638 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 35 [2022-02-20 14:19:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:19:58,638 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-02-20 14:19:58,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:19:58,638 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-02-20 14:19:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-20 14:19:58,639 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:19:58,639 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:19:58,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 14:19:58,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:19:58,856 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:19:58,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:19:58,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1337652904, now seen corresponding path program 3 times [2022-02-20 14:19:58,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:19:58,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465761243] [2022-02-20 14:19:58,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:19:58,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:19:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:00,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {1503#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {1503#true} is VALID [2022-02-20 14:20:00,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {1503#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post6#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~sum~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1503#true} is VALID [2022-02-20 14:20:00,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {1503#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~sum~0#1 := 0;main_~i~0#1 := 0; {1505#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~sum~0#1| 0))} is VALID [2022-02-20 14:20:00,247 INFO L290 TraceCheckUtils]: 3: Hoare triple {1505#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~sum~0#1| 0))} assume !!(main_~i~0#1 < ~SIZE~0);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4); {1505#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~sum~0#1| 0))} is VALID [2022-02-20 14:20:00,247 INFO L290 TraceCheckUtils]: 4: Hoare triple {1505#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~sum~0#1| 0))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1506#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:20:00,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {1506#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~SIZE~0);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4); {1507#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:20:00,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {1507#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1508#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (= |ULTIMATE.start_main_~sum~0#1| 0))} is VALID [2022-02-20 14:20:00,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {1508#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (= |ULTIMATE.start_main_~sum~0#1| 0))} assume !(main_~i~0#1 < ~SIZE~0); {1508#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (= |ULTIMATE.start_main_~sum~0#1| 0))} is VALID [2022-02-20 14:20:00,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {1508#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (= |ULTIMATE.start_main_~sum~0#1| 0))} main_~i~0#1 := 0; {1509#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (= |ULTIMATE.start_main_~sum~0#1| 0))} is VALID [2022-02-20 14:20:00,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {1509#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (= |ULTIMATE.start_main_~sum~0#1| 0))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem8#1;havoc main_#t~mem8#1; {1510#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_~sum~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-20 14:20:00,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {1510#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_~sum~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1511#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) |ULTIMATE.start_main_~sum~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))} is VALID [2022-02-20 14:20:00,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {1511#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) |ULTIMATE.start_main_~sum~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem8#1;havoc main_#t~mem8#1; {1512#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0))) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:20:00,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {1512#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0))) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) |ULTIMATE.start_main_~sum~0#1|))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1513#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)))} is VALID [2022-02-20 14:20:00,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {1513#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)))} assume !(main_~i~0#1 < ~SIZE~0); {1513#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)))} is VALID [2022-02-20 14:20:00,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {1513#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)))} main_~i~0#1 := 0; {1514#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1)))} is VALID [2022-02-20 14:20:00,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {1514#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1)))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem10#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem10#1;havoc main_#t~mem10#1; {1515#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 2) 1)) (<= (+ (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 2) 1) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:20:00,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {1515#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 2) 1)) (<= (+ (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 2) 1) |ULTIMATE.start_main_~sum~0#1|))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1516#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 1) |ULTIMATE.start_main_~sum~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 1)))} is VALID [2022-02-20 14:20:00,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {1516#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 1) |ULTIMATE.start_main_~sum~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 1)))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem10#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem10#1;havoc main_#t~mem10#1; {1517#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 1) |ULTIMATE.start_main_~sum~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 1)))} is VALID [2022-02-20 14:20:00,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {1517#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 1) |ULTIMATE.start_main_~sum~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 1)))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1518#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2)) (<= (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:20:00,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {1518#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2)) (<= (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2) |ULTIMATE.start_main_~sum~0#1|))} assume !(main_~i~0#1 < ~SIZE~0); {1518#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2)) (<= (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:20:00,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {1518#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2)) (<= (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2) |ULTIMATE.start_main_~sum~0#1|))} main_~i~0#1 := 0; {1519#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_~sum~0#1|) (+ 2 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:20:00,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {1519#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_~sum~0#1|) (+ 2 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2) |ULTIMATE.start_main_~sum~0#1|))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem12#1;havoc main_#t~mem12#1; {1520#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ 2 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:20:00,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {1520#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ 2 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2) |ULTIMATE.start_main_~sum~0#1|))} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1521#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ 2 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (<= (+ 2 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0))) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:20:00,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {1521#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ 2 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (<= (+ 2 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0))) |ULTIMATE.start_main_~sum~0#1|))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem12#1;havoc main_#t~mem12#1; {1522#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 2 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 2 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0))) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:20:00,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {1522#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 2 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 2 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0))) |ULTIMATE.start_main_~sum~0#1|))} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1523#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ 3 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (<= (+ 3 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0))) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:20:00,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {1523#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ 3 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (<= (+ 3 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0))) |ULTIMATE.start_main_~sum~0#1|))} assume !(main_~i~0#1 < ~SIZE~0); {1523#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ 3 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (<= (+ 3 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0))) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:20:00,261 INFO L290 TraceCheckUtils]: 26: Hoare triple {1523#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ 3 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (<= (+ 3 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0))) |ULTIMATE.start_main_~sum~0#1|))} main_~i~0#1 := 0; {1524#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 3)) (<= (+ 3 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0))) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:20:00,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {1524#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 3)) (<= (+ 3 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0))) |ULTIMATE.start_main_~sum~0#1|))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem14#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem14#1;havoc main_#t~mem14#1; {1525#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (+ 3 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0))) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_~sum~0#1|)) (<= |ULTIMATE.start_main_~sum~0#1| (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 3)))} is VALID [2022-02-20 14:20:00,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {1525#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (+ 3 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0))) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_~sum~0#1|)) (<= |ULTIMATE.start_main_~sum~0#1| (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 3)))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1526#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 3)) (<= (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 3) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:20:00,263 INFO L290 TraceCheckUtils]: 29: Hoare triple {1526#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 3)) (<= (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 3) |ULTIMATE.start_main_~sum~0#1|))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem14#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem14#1;havoc main_#t~mem14#1; {1517#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 1) |ULTIMATE.start_main_~sum~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 1)))} is VALID [2022-02-20 14:20:00,263 INFO L290 TraceCheckUtils]: 30: Hoare triple {1517#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 1) |ULTIMATE.start_main_~sum~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 1)))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1518#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2)) (<= (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:20:00,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {1518#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2)) (<= (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2) |ULTIMATE.start_main_~sum~0#1|))} assume !(main_~i~0#1 < ~SIZE~0); {1518#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2)) (<= (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:20:00,264 INFO L290 TraceCheckUtils]: 32: Hoare triple {1518#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2)) (<= (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2) |ULTIMATE.start_main_~sum~0#1|))} main_~i~0#1 := 0; {1519#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_~sum~0#1|) (+ 2 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:20:00,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {1519#(and (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_~sum~0#1|) (+ 2 (* 3 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (+ (* 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) 2) |ULTIMATE.start_main_~sum~0#1|))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem16#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem16#1;havoc main_#t~mem16#1; {1527#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) |ULTIMATE.start_main_~sum~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0))))} is VALID [2022-02-20 14:20:00,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {1527#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) |ULTIMATE.start_main_~sum~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0))))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1528#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) |ULTIMATE.start_main_~sum~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0))))} is VALID [2022-02-20 14:20:00,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {1528#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) |ULTIMATE.start_main_~sum~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| (+ 2 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0))))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem16#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem16#1;havoc main_#t~mem16#1; {1512#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0))) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) |ULTIMATE.start_main_~sum~0#1|))} is VALID [2022-02-20 14:20:00,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {1512#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0))) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) |ULTIMATE.start_main_~sum~0#1|))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1513#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)))} is VALID [2022-02-20 14:20:00,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {1513#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)))} assume !(main_~i~0#1 < ~SIZE~0); {1513#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)))} is VALID [2022-02-20 14:20:00,268 INFO L290 TraceCheckUtils]: 38: Hoare triple {1513#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)))} main_~i~0#1 := 0; {1514#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1)))} is VALID [2022-02-20 14:20:00,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {1514#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= |ULTIMATE.start_main_~sum~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1)))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem18#1;havoc main_#t~mem18#1; {1529#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= 1 |ULTIMATE.start_main_~sum~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| 1))} is VALID [2022-02-20 14:20:00,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {1529#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 4)) 1) (<= 1 |ULTIMATE.start_main_~sum~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| 1))} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {1530#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (<= 1 |ULTIMATE.start_main_~sum~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| 1))} is VALID [2022-02-20 14:20:00,292 INFO L290 TraceCheckUtils]: 41: Hoare triple {1530#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 1) (<= 1 |ULTIMATE.start_main_~sum~0#1|) (<= |ULTIMATE.start_main_~sum~0#1| 1))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem18#1;havoc main_#t~mem18#1; {1531#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 0 (+ |ULTIMATE.start_main_~sum~0#1| 1)))} is VALID [2022-02-20 14:20:00,292 INFO L290 TraceCheckUtils]: 42: Hoare triple {1531#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 0 (+ |ULTIMATE.start_main_~sum~0#1| 1)))} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {1531#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 0 (+ |ULTIMATE.start_main_~sum~0#1| 1)))} is VALID [2022-02-20 14:20:00,293 INFO L290 TraceCheckUtils]: 43: Hoare triple {1531#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 0 (+ |ULTIMATE.start_main_~sum~0#1| 1)))} assume !(main_~i~0#1 < ~SIZE~0); {1531#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 0 (+ |ULTIMATE.start_main_~sum~0#1| 1)))} is VALID [2022-02-20 14:20:00,293 INFO L290 TraceCheckUtils]: 44: Hoare triple {1531#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 0 (+ |ULTIMATE.start_main_~sum~0#1| 1)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1532#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 14:20:00,293 INFO L290 TraceCheckUtils]: 45: Hoare triple {1532#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {1504#false} is VALID [2022-02-20 14:20:00,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {1504#false} assume !false; {1504#false} is VALID [2022-02-20 14:20:00,294 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:20:00,294 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:20:00,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465761243] [2022-02-20 14:20:00,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465761243] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:20:00,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007087787] [2022-02-20 14:20:00,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:20:00,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:20:00,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:20:00,308 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:20:00,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 14:20:00,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 14:20:00,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:20:00,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 68 conjunts are in the unsatisfiable core [2022-02-20 14:20:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:20:00,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:20:00,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-20 14:20:09,483 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:20:09,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 18 [2022-02-20 14:20:09,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {1503#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 0;~MAX~0 := 100000; {1503#true} is VALID [2022-02-20 14:20:09,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {1503#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~post6#1, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~post9#1, main_#t~mem12#1, main_#t~post11#1, main_#t~mem14#1, main_#t~post13#1, main_#t~mem16#1, main_#t~post15#1, main_#t~mem18#1, main_#t~post17#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~sum~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1503#true} is VALID [2022-02-20 14:20:09,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {1503#true} assume ~SIZE~0 > 1 && ~SIZE~0 < ~MAX~0;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(4 * ~SIZE~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;main_~sum~0#1 := 0;main_~i~0#1 := 0; {1542#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| 0) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:20:09,910 INFO L290 TraceCheckUtils]: 3: Hoare triple {1542#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| 0) (< 1 ~SIZE~0))} assume !!(main_~i~0#1 < ~SIZE~0);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4); {1542#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| 0) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:20:09,912 INFO L290 TraceCheckUtils]: 4: Hoare triple {1542#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| 0) (< 1 ~SIZE~0))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1549#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~SIZE~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:20:09,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {1549#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~SIZE~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~SIZE~0);call write~int(1, main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4); {1549#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~SIZE~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:20:09,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {1549#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~SIZE~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post6#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1556#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| 2) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:20:09,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {1556#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~i~0#1| 2) (< 1 ~SIZE~0))} assume !(main_~i~0#1 < ~SIZE~0); {1560#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:20:09,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {1560#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~SIZE~0))} main_~i~0#1 := 0; {1564#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:20:09,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {1564#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~SIZE~0))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem8#1;havoc main_#t~mem8#1; {1568#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:20:09,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {1568#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (< 1 ~SIZE~0))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1568#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:20:09,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {1568#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (< 1 ~SIZE~0))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem8#1;havoc main_#t~mem8#1; {1575#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0) (< |ULTIMATE.start_main_~i~0#1| ~SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (+ |ULTIMATE.start_main_~sum~0#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))))} is VALID [2022-02-20 14:20:09,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {1575#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0) (< |ULTIMATE.start_main_~i~0#1| ~SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (+ |ULTIMATE.start_main_~sum~0#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1579#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4)))) |ULTIMATE.start_main_~sum~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:20:09,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {1579#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4)))) |ULTIMATE.start_main_~sum~0#1|)) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0))} assume !(main_~i~0#1 < ~SIZE~0); {1583#(and (<= ~SIZE~0 2) (exists ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4)))) |ULTIMATE.start_main_~sum~0#1|)) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:20:09,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {1583#(and (<= ~SIZE~0 2) (exists ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4)))) |ULTIMATE.start_main_~sum~0#1|)) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0))} main_~i~0#1 := 0; {1587#(and (<= ~SIZE~0 2) (exists ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4)))) |ULTIMATE.start_main_~sum~0#1|)) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:20:09,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {1587#(and (<= ~SIZE~0 2) (exists ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4)))) |ULTIMATE.start_main_~sum~0#1|)) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (< 1 ~SIZE~0))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem10#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem10#1;havoc main_#t~mem10#1; {1591#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4)))) |ULTIMATE.start_main_~sum~0#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:20:09,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {1591#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4)))) |ULTIMATE.start_main_~sum~0#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1595#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4)))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (- 1)) |ULTIMATE.start_main_~sum~0#1|)) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:20:09,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {1595#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4)))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (- 1)) |ULTIMATE.start_main_~sum~0#1|)) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem10#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem10#1;havoc main_#t~mem10#1; {1599#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) |ULTIMATE.start_main_~sum~0#1|) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:20:09,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {1599#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) |ULTIMATE.start_main_~sum~0#1|) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1603#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) |ULTIMATE.start_main_~sum~0#1|) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))))} is VALID [2022-02-20 14:20:09,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {1603#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) |ULTIMATE.start_main_~sum~0#1|) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))))} assume !(main_~i~0#1 < ~SIZE~0); {1607#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) |ULTIMATE.start_main_~sum~0#1|) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))))} is VALID [2022-02-20 14:20:09,927 INFO L290 TraceCheckUtils]: 20: Hoare triple {1607#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) |ULTIMATE.start_main_~sum~0#1|) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))))} main_~i~0#1 := 0; {1611#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) |ULTIMATE.start_main_~sum~0#1|) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))))} is VALID [2022-02-20 14:20:09,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {1611#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) |ULTIMATE.start_main_~sum~0#1|) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem12#1;havoc main_#t~mem12#1; {1615#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) (+ |ULTIMATE.start_main_~sum~0#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:20:09,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {1615#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) (+ |ULTIMATE.start_main_~sum~0#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0))} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1619#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) (+ (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (- 1)) |ULTIMATE.start_main_~sum~0#1|)) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:20:09,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {1619#(and (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) (+ (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (- 1)) |ULTIMATE.start_main_~sum~0#1|)) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem12#1;havoc main_#t~mem12#1; {1623#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) (+ (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (- 1)) |ULTIMATE.start_main_~sum~0#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:20:09,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {1623#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) (+ (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (- 1)) |ULTIMATE.start_main_~sum~0#1| (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post11#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post11#1;havoc main_#t~post11#1; {1627#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_75| Int) (|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_75| 1)) (= (+ (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (- 1)) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |ULTIMATE.start_main_~a~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2))) (<= |v_ULTIMATE.start_main_~i~0#1_75| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))))} is VALID [2022-02-20 14:20:09,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {1627#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_75| Int) (|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_75| 1)) (= (+ (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (- 1)) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |ULTIMATE.start_main_~a~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2))) (<= |v_ULTIMATE.start_main_~i~0#1_75| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))))} assume !(main_~i~0#1 < ~SIZE~0); {1631#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_75| Int) (|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_75| 1)) (= (+ (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (- 1)) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |ULTIMATE.start_main_~a~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2))) (<= |v_ULTIMATE.start_main_~i~0#1_75| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))))} is VALID [2022-02-20 14:20:09,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {1631#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_75| Int) (|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_75| 1)) (= (+ (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (- 1)) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |ULTIMATE.start_main_~a~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2))) (<= |v_ULTIMATE.start_main_~i~0#1_75| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))))} main_~i~0#1 := 0; {1635#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_75| Int) (|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_75| 1)) (= (+ (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (- 1)) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |ULTIMATE.start_main_~a~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2))) (<= |v_ULTIMATE.start_main_~i~0#1_75| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))))} is VALID [2022-02-20 14:20:09,937 INFO L290 TraceCheckUtils]: 27: Hoare triple {1635#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_75| Int) (|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_75| 1)) (= (+ (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (- 1)) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |ULTIMATE.start_main_~a~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2))) (<= |v_ULTIMATE.start_main_~i~0#1_75| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem14#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem14#1;havoc main_#t~mem14#1; {1639#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_75| Int) (|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_75| 1)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |ULTIMATE.start_main_~a~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|)) (<= |v_ULTIMATE.start_main_~i~0#1_75| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:20:09,938 INFO L290 TraceCheckUtils]: 28: Hoare triple {1639#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_75| Int) (|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_75| 1)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |ULTIMATE.start_main_~a~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|)) (<= |v_ULTIMATE.start_main_~i~0#1_75| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1639#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_75| Int) (|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_75| 1)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |ULTIMATE.start_main_~a~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|)) (<= |v_ULTIMATE.start_main_~i~0#1_75| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:20:09,940 INFO L290 TraceCheckUtils]: 29: Hoare triple {1639#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_75| Int) (|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_75| 1)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |ULTIMATE.start_main_~a~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|)) (<= |v_ULTIMATE.start_main_~i~0#1_75| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem14#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem14#1;havoc main_#t~mem14#1; {1646#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_75| Int) (|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_75| 1)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_~sum~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (<= |v_ULTIMATE.start_main_~i~0#1_75| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0) (< |ULTIMATE.start_main_~i~0#1| ~SIZE~0))} is VALID [2022-02-20 14:20:09,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {1646#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_75| Int) (|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_75| 1)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_~sum~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (<= |v_ULTIMATE.start_main_~i~0#1_75| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0) (< |ULTIMATE.start_main_~i~0#1| ~SIZE~0))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1650#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_76| Int) (|v_ULTIMATE.start_main_~i~0#1_75| Int) (|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_75| 1)) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_76| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_75| 1) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_76| 4))) |ULTIMATE.start_main_~sum~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0) (< |v_ULTIMATE.start_main_~i~0#1_76| ~SIZE~0))) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:20:09,949 INFO L290 TraceCheckUtils]: 31: Hoare triple {1650#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_76| Int) (|v_ULTIMATE.start_main_~i~0#1_75| Int) (|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_75| 1)) (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_76| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_75| 1) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_76| 4))) |ULTIMATE.start_main_~sum~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_75| 4) |ULTIMATE.start_main_~a~0#1.offset|)))) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0) (< |v_ULTIMATE.start_main_~i~0#1_76| ~SIZE~0))) (< 1 ~SIZE~0))} assume !(main_~i~0#1 < ~SIZE~0); {1607#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) |ULTIMATE.start_main_~sum~0#1|) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))))} is VALID [2022-02-20 14:20:09,950 INFO L290 TraceCheckUtils]: 32: Hoare triple {1607#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) |ULTIMATE.start_main_~sum~0#1|) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))))} main_~i~0#1 := 0; {1611#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) |ULTIMATE.start_main_~sum~0#1|) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))))} is VALID [2022-02-20 14:20:09,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {1611#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) |ULTIMATE.start_main_~sum~0#1|) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem16#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem16#1;havoc main_#t~mem16#1; {1660#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_~sum~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2))) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:20:09,952 INFO L290 TraceCheckUtils]: 34: Hoare triple {1660#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_~sum~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2))) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1664#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|)) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:20:09,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {1664#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))) (* (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 2)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|)) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem16#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem16#1;havoc main_#t~mem16#1; {1668#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_~sum~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))))) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:20:09,955 INFO L290 TraceCheckUtils]: 36: Hoare triple {1668#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_~sum~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4))))) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post15#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post15#1;havoc main_#t~post15#1; {1672#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_78| Int) (|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_78| 1)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4)))) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_78| 4) |ULTIMATE.start_main_~a~0#1.offset|)) |ULTIMATE.start_main_~sum~0#1|)) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_78| 1) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:20:09,956 INFO L290 TraceCheckUtils]: 37: Hoare triple {1672#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~i~0#1_78| Int) (|v_ULTIMATE.start_main_~i~0#1_73| Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (<= |ULTIMATE.start_main_~i~0#1| (+ |v_ULTIMATE.start_main_~i~0#1_78| 1)) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_73| 4)))) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_78| 4) |ULTIMATE.start_main_~a~0#1.offset|)) |ULTIMATE.start_main_~sum~0#1|)) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_73| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_73| 1) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (<= |v_ULTIMATE.start_main_~i~0#1_78| 1) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (< 1 ~SIZE~0))} assume !(main_~i~0#1 < ~SIZE~0); {1583#(and (<= ~SIZE~0 2) (exists ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4)))) |ULTIMATE.start_main_~sum~0#1|)) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:20:09,957 INFO L290 TraceCheckUtils]: 38: Hoare triple {1583#(and (<= ~SIZE~0 2) (exists ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4)))) |ULTIMATE.start_main_~sum~0#1|)) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0))} main_~i~0#1 := 0; {1587#(and (<= ~SIZE~0 2) (exists ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4)))) |ULTIMATE.start_main_~sum~0#1|)) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:20:09,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {1587#(and (<= ~SIZE~0 2) (exists ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4)))) |ULTIMATE.start_main_~sum~0#1|)) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (< 1 ~SIZE~0))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem18#1;havoc main_#t~mem18#1; {1682#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_~sum~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))))) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))))} is VALID [2022-02-20 14:20:09,959 INFO L290 TraceCheckUtils]: 40: Hoare triple {1682#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_~sum~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))))) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))))} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {1686#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))))) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:20:09,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {1686#(and (<= ~SIZE~0 2) (= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 1 ~SIZE~0) (exists ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (and (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) |ULTIMATE.start_main_~sum~0#1|) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_71| 4))))) (<= ~SIZE~0 (+ |v_ULTIMATE.start_main_~i~0#1_71| 1)) (< |v_ULTIMATE.start_main_~i~0#1_71| ~SIZE~0))) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~SIZE~0);call main_#t~mem18#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 4 * main_~i~0#1, 4);main_~sum~0#1 := main_~sum~0#1 - main_#t~mem18#1;havoc main_#t~mem18#1; {1690#(and (<= ~SIZE~0 2) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~SIZE~0) (exists ((v_arrayElimCell_2 Int)) (= v_arrayElimCell_2 (+ v_arrayElimCell_2 (* (- 1) |ULTIMATE.start_main_~sum~0#1|))))) (< 1 ~SIZE~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:20:09,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {1690#(and (<= ~SIZE~0 2) (or (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~SIZE~0) (exists ((v_arrayElimCell_2 Int)) (= v_arrayElimCell_2 (+ v_arrayElimCell_2 (* (- 1) |ULTIMATE.start_main_~sum~0#1|))))) (< 1 ~SIZE~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; {1694#(and (<= ~SIZE~0 2) (or (and (<= |ULTIMATE.start_main_~i~0#1| 2) (exists ((v_arrayElimCell_2 Int)) (= v_arrayElimCell_2 (+ v_arrayElimCell_2 (* (- 1) |ULTIMATE.start_main_~sum~0#1|))))) (< |ULTIMATE.start_main_~i~0#1| ~SIZE~0)) (< 1 ~SIZE~0))} is VALID [2022-02-20 14:20:09,961 INFO L290 TraceCheckUtils]: 43: Hoare triple {1694#(and (<= ~SIZE~0 2) (or (and (<= |ULTIMATE.start_main_~i~0#1| 2) (exists ((v_arrayElimCell_2 Int)) (= v_arrayElimCell_2 (+ v_arrayElimCell_2 (* (- 1) |ULTIMATE.start_main_~sum~0#1|))))) (< |ULTIMATE.start_main_~i~0#1| ~SIZE~0)) (< 1 ~SIZE~0))} assume !(main_~i~0#1 < ~SIZE~0); {1531#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 0 (+ |ULTIMATE.start_main_~sum~0#1| 1)))} is VALID [2022-02-20 14:20:09,961 INFO L290 TraceCheckUtils]: 44: Hoare triple {1531#(and (<= |ULTIMATE.start_main_~sum~0#1| 0) (< 0 (+ |ULTIMATE.start_main_~sum~0#1| 1)))} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1701#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:20:09,961 INFO L290 TraceCheckUtils]: 45: Hoare triple {1701#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1504#false} is VALID [2022-02-20 14:20:09,961 INFO L290 TraceCheckUtils]: 46: Hoare triple {1504#false} assume !false; {1504#false} is VALID [2022-02-20 14:20:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:20:09,962 INFO L328 TraceCheckSpWp]: Computing backward predicates...