./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/lis-alloca-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/lis-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:40:23,578 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:40:23,581 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:40:23,614 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:40:23,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:40:23,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:40:23,619 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:40:23,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:40:23,623 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:40:23,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:40:23,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:40:23,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:40:23,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:40:23,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:40:23,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:40:23,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:40:23,635 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:40:23,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:40:23,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:40:23,642 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:40:23,643 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:40:23,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:40:23,645 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:40:23,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:40:23,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:40:23,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:40:23,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:40:23,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:40:23,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:40:23,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:40:23,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:40:23,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:40:23,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:40:23,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:40:23,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:40:23,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:40:23,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:40:23,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:40:23,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:40:23,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:40:23,659 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:40:23,659 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:40:23,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:40:23,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:40:23,685 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:40:23,685 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:40:23,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:40:23,686 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:40:23,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:40:23,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:40:23,686 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:40:23,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:40:23,687 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:40:23,687 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:40:23,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:40:23,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:40:23,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:40:23,688 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:40:23,688 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:40:23,688 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:40:23,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:40:23,688 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:40:23,688 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:40:23,689 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:40:23,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:40:23,689 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:40:23,689 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:40:23,689 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:40:23,689 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:40:23,690 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:40:23,690 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:40:23,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:40:23,691 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2022-02-20 23:40:23,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:40:23,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:40:23,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:40:23,920 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:40:23,921 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:40:23,922 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-02-20 23:40:23,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc1f1672/400e8d0b11ff432ebe3b28ab0b95d708/FLAG3f645963f [2022-02-20 23:40:24,385 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:40:24,389 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-02-20 23:40:24,402 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc1f1672/400e8d0b11ff432ebe3b28ab0b95d708/FLAG3f645963f [2022-02-20 23:40:24,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc1f1672/400e8d0b11ff432ebe3b28ab0b95d708 [2022-02-20 23:40:24,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:40:24,416 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:40:24,419 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:40:24,419 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:40:24,421 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:40:24,422 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:40:24" (1/1) ... [2022-02-20 23:40:24,423 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@523e8e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:24, skipping insertion in model container [2022-02-20 23:40:24,423 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:40:24" (1/1) ... [2022-02-20 23:40:24,428 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:40:24,462 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:40:24,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:40:24,742 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-02-20 23:40:24,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7465b7c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:24, skipping insertion in model container [2022-02-20 23:40:24,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:40:24,744 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:40:24,746 INFO L158 Benchmark]: Toolchain (without parser) took 328.18ms. Allocated memory was 86.0MB in the beginning and 107.0MB in the end (delta: 21.0MB). Free memory was 52.7MB in the beginning and 80.3MB in the end (delta: -27.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:40:24,747 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory was 41.5MB in the beginning and 41.4MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:40:24,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.96ms. Allocated memory was 86.0MB in the beginning and 107.0MB in the end (delta: 21.0MB). Free memory was 52.5MB in the beginning and 80.3MB in the end (delta: -27.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:40:24,749 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory was 41.5MB in the beginning and 41.4MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.96ms. Allocated memory was 86.0MB in the beginning and 107.0MB in the end (delta: 21.0MB). Free memory was 52.5MB in the beginning and 80.3MB in the end (delta: -27.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 515]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/lis-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:40:26,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:40:26,270 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:40:26,292 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:40:26,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:40:26,296 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:40:26,298 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:40:26,303 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:40:26,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:40:26,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:40:26,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:40:26,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:40:26,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:40:26,314 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:40:26,315 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:40:26,316 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:40:26,317 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:40:26,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:40:26,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:40:26,321 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:40:26,322 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:40:26,332 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:40:26,333 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:40:26,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:40:26,339 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:40:26,339 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:40:26,340 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:40:26,341 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:40:26,341 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:40:26,342 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:40:26,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:40:26,343 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:40:26,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:40:26,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:40:26,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:40:26,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:40:26,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:40:26,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:40:26,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:40:26,347 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:40:26,348 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:40:26,351 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:40:26,380 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:40:26,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:40:26,381 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:40:26,381 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:40:26,382 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:40:26,382 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:40:26,387 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:40:26,388 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:40:26,388 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:40:26,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:40:26,389 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:40:26,389 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:40:26,389 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:40:26,389 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:40:26,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:40:26,389 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:40:26,389 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:40:26,390 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:40:26,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:40:26,390 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:40:26,390 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:40:26,390 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:40:26,390 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:40:26,390 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:40:26,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:40:26,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:40:26,391 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:40:26,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:40:26,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:40:26,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:40:26,396 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:40:26,396 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:40:26,396 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:40:26,397 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2022-02-20 23:40:26,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:40:26,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:40:26,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:40:26,666 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:40:26,679 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:40:26,680 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-02-20 23:40:26,729 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca17b255f/4d36c496e3b146f9848640abddec9559/FLAG81f2b166c [2022-02-20 23:40:27,160 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:40:27,161 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-02-20 23:40:27,184 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca17b255f/4d36c496e3b146f9848640abddec9559/FLAG81f2b166c [2022-02-20 23:40:27,529 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca17b255f/4d36c496e3b146f9848640abddec9559 [2022-02-20 23:40:27,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:40:27,534 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:40:27,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:40:27,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:40:27,540 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:40:27,541 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:40:27" (1/1) ... [2022-02-20 23:40:27,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@249f9136 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:27, skipping insertion in model container [2022-02-20 23:40:27,542 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:40:27" (1/1) ... [2022-02-20 23:40:27,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:40:27,584 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:40:27,856 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:40:27,867 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:40:27,874 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:40:27,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:40:27,916 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:40:27,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:40:27,982 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:40:27,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:27 WrapperNode [2022-02-20 23:40:27,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:40:27,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:40:27,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:40:27,985 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:40:27,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:27" (1/1) ... [2022-02-20 23:40:28,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:27" (1/1) ... [2022-02-20 23:40:28,050 INFO L137 Inliner]: procedures = 117, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 114 [2022-02-20 23:40:28,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:40:28,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:40:28,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:40:28,051 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:40:28,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:27" (1/1) ... [2022-02-20 23:40:28,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:27" (1/1) ... [2022-02-20 23:40:28,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:27" (1/1) ... [2022-02-20 23:40:28,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:27" (1/1) ... [2022-02-20 23:40:28,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:27" (1/1) ... [2022-02-20 23:40:28,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:27" (1/1) ... [2022-02-20 23:40:28,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:27" (1/1) ... [2022-02-20 23:40:28,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:40:28,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:40:28,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:40:28,110 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:40:28,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:27" (1/1) ... [2022-02-20 23:40:28,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:40:28,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:40:28,135 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 23:40:28,141 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 23:40:28,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:40:28,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:40:28,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:40:28,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:40:28,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:40:28,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:40:28,276 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:40:28,277 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:40:28,719 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:40:28,724 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:40:28,725 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 23:40:28,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:40:28 BoogieIcfgContainer [2022-02-20 23:40:28,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:40:28,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:40:28,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:40:28,730 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:40:28,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:40:27" (1/3) ... [2022-02-20 23:40:28,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484baa6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:40:28, skipping insertion in model container [2022-02-20 23:40:28,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:40:27" (2/3) ... [2022-02-20 23:40:28,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@484baa6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:40:28, skipping insertion in model container [2022-02-20 23:40:28,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:40:28" (3/3) ... [2022-02-20 23:40:28,732 INFO L111 eAbstractionObserver]: Analyzing ICFG lis-alloca-1.i [2022-02-20 23:40:28,736 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:40:28,737 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-02-20 23:40:28,765 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:40:28,770 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 23:40:28,770 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-02-20 23:40:28,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 41 states have (on average 1.951219512195122) internal successors, (80), 66 states have internal predecessors, (80), 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 23:40:28,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:40:28,785 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:28,786 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:40:28,786 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:40:28,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:28,794 INFO L85 PathProgramCache]: Analyzing trace with hash 889508873, now seen corresponding path program 1 times [2022-02-20 23:40:28,802 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:28,802 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919500402] [2022-02-20 23:40:28,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:28,803 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:28,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:28,805 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:28,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:40:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:28,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:40:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:28,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:28,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-02-20 23:40:28,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {70#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {70#true} is VALID [2022-02-20 23:40:28,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {70#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {70#true} is VALID [2022-02-20 23:40:28,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {70#true} assume ~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32);main_~array_size~0#1 := 1bv32; {70#true} is VALID [2022-02-20 23:40:28,973 INFO L290 TraceCheckUtils]: 3: Hoare triple {70#true} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {84#(= (select |#valid| |ULTIMATE.start_main_~numbers~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:40:28,974 INFO L290 TraceCheckUtils]: 4: Hoare triple {84#(= (select |#valid| |ULTIMATE.start_main_~numbers~0#1.base|) (_ bv1 1))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {84#(= (select |#valid| |ULTIMATE.start_main_~numbers~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:40:28,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {84#(= (select |#valid| |ULTIMATE.start_main_~numbers~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~numbers~0#1.base]); {71#false} is VALID [2022-02-20 23:40:28,976 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 23:40:28,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:40:28,977 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:28,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919500402] [2022-02-20 23:40:28,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919500402] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:28,978 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:28,978 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:40:28,980 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523006723] [2022-02-20 23:40:28,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:28,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-20 23:40:28,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:28,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:40:28,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:28,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:40:28,997 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:29,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:40:29,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:40:29,018 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.951219512195122) internal successors, (80), 66 states have internal predecessors, (80), 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 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:40:29,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:29,367 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-02-20 23:40:29,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:40:29,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-20 23:40:29,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:40:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-02-20 23:40:29,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:40:29,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-02-20 23:40:29,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 80 transitions. [2022-02-20 23:40:29,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:29,504 INFO L225 Difference]: With dead ends: 66 [2022-02-20 23:40:29,507 INFO L226 Difference]: Without dead ends: 64 [2022-02-20 23:40:29,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 23:40:29,512 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 62 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:29,513 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 51 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:40:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-20 23:40:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-02-20 23:40:29,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:29,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 40 states have (on average 1.8) internal successors, (72), 63 states have internal predecessors, (72), 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 23:40:29,539 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 40 states have (on average 1.8) internal successors, (72), 63 states have internal predecessors, (72), 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 23:40:29,539 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 40 states have (on average 1.8) internal successors, (72), 63 states have internal predecessors, (72), 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 23:40:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:29,543 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-02-20 23:40:29,543 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-02-20 23:40:29,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:29,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:29,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 40 states have (on average 1.8) internal successors, (72), 63 states have internal predecessors, (72), 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 64 states. [2022-02-20 23:40:29,544 INFO L87 Difference]: Start difference. First operand has 64 states, 40 states have (on average 1.8) internal successors, (72), 63 states have internal predecessors, (72), 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 64 states. [2022-02-20 23:40:29,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:29,547 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-02-20 23:40:29,547 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-02-20 23:40:29,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:29,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:29,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:29,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.8) internal successors, (72), 63 states have internal predecessors, (72), 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 23:40:29,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-02-20 23:40:29,556 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 6 [2022-02-20 23:40:29,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:29,556 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-02-20 23:40:29,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 23:40:29,557 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-02-20 23:40:29,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:40:29,557 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:29,557 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:40:29,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:40:29,766 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:29,766 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:40:29,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:29,767 INFO L85 PathProgramCache]: Analyzing trace with hash 889508874, now seen corresponding path program 1 times [2022-02-20 23:40:29,767 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:29,767 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091974094] [2022-02-20 23:40:29,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:29,767 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:29,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:29,769 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:29,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:40:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:29,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:40:29,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:29,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:29,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2022-02-20 23:40:29,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {348#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {348#true} is VALID [2022-02-20 23:40:29,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {348#true} is VALID [2022-02-20 23:40:29,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} assume ~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32);main_~array_size~0#1 := 1bv32; {359#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:29,878 INFO L290 TraceCheckUtils]: 3: Hoare triple {359#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {363#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|)) (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:40:29,878 INFO L290 TraceCheckUtils]: 4: Hoare triple {363#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|)) (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {363#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|)) (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:40:29,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|)) (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1))), #length[main_~numbers~0#1.base]) && ~bvule32(~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), ~bvadd32(4bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1))))) && ~bvule32(0bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)))); {349#false} is VALID [2022-02-20 23:40:29,879 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 23:40:29,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:40:29,880 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:29,880 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091974094] [2022-02-20 23:40:29,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091974094] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:29,895 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:29,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:40:29,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076453259] [2022-02-20 23:40:29,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:29,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2022-02-20 23:40:29,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:29,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 23:40:29,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:29,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:40:29,903 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:29,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:40:29,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:40:29,904 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 23:40:30,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:30,921 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2022-02-20 23:40:30,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:40:30,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2022-02-20 23:40:30,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:30,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 23:40:30,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2022-02-20 23:40:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 23:40:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2022-02-20 23:40:30,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 146 transitions. [2022-02-20 23:40:31,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:31,136 INFO L225 Difference]: With dead ends: 129 [2022-02-20 23:40:31,136 INFO L226 Difference]: Without dead ends: 129 [2022-02-20 23:40:31,136 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:40:31,137 INFO L933 BasicCegarLoop]: 129 mSDtfsCounter, 73 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:31,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 275 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:40:31,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-02-20 23:40:31,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 67. [2022-02-20 23:40:31,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:31,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 67 states, 43 states have (on average 1.744186046511628) internal successors, (75), 66 states have internal predecessors, (75), 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 23:40:31,141 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 67 states, 43 states have (on average 1.744186046511628) internal successors, (75), 66 states have internal predecessors, (75), 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 23:40:31,142 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 67 states, 43 states have (on average 1.744186046511628) internal successors, (75), 66 states have internal predecessors, (75), 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 23:40:31,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:31,148 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2022-02-20 23:40:31,148 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2022-02-20 23:40:31,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:31,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:31,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 43 states have (on average 1.744186046511628) internal successors, (75), 66 states have internal predecessors, (75), 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 129 states. [2022-02-20 23:40:31,155 INFO L87 Difference]: Start difference. First operand has 67 states, 43 states have (on average 1.744186046511628) internal successors, (75), 66 states have internal predecessors, (75), 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 129 states. [2022-02-20 23:40:31,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:31,160 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2022-02-20 23:40:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2022-02-20 23:40:31,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:31,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:31,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:31,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.744186046511628) internal successors, (75), 66 states have internal predecessors, (75), 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 23:40:31,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2022-02-20 23:40:31,165 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 6 [2022-02-20 23:40:31,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:31,165 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2022-02-20 23:40:31,166 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 23:40:31,166 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-02-20 23:40:31,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:40:31,166 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:31,166 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:40:31,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 23:40:31,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:31,372 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:40:31,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:31,374 INFO L85 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2022-02-20 23:40:31,374 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:31,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040357019] [2022-02-20 23:40:31,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:31,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:31,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:31,375 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:31,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:40:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:31,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:40:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:31,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:31,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-02-20 23:40:31,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {825#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {825#true} is VALID [2022-02-20 23:40:31,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {825#true} is VALID [2022-02-20 23:40:31,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#true} assume !(~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32)); {836#(and (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:31,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {836#(and (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {840#(and (exists ((|ULTIMATE.start_main_~array_size~0#1| (_ BitVec 32))) (and (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))) (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:40:31,524 INFO L290 TraceCheckUtils]: 4: Hoare triple {840#(and (exists ((|ULTIMATE.start_main_~array_size~0#1| (_ BitVec 32))) (and (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))) (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {840#(and (exists ((|ULTIMATE.start_main_~array_size~0#1| (_ BitVec 32))) (and (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))) (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:40:31,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {840#(and (exists ((|ULTIMATE.start_main_~array_size~0#1| (_ BitVec 32))) (and (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))) (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1))), #length[main_~numbers~0#1.base]) && ~bvule32(~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), ~bvadd32(4bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1))))) && ~bvule32(0bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)))); {826#false} is VALID [2022-02-20 23:40:31,528 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 23:40:31,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:40:31,528 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:31,528 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040357019] [2022-02-20 23:40:31,528 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040357019] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:31,528 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:31,528 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:40:31,528 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790512901] [2022-02-20 23:40:31,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:31,529 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2022-02-20 23:40:31,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:31,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 23:40:31,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:31,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:40:31,542 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:31,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:40:31,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:40:31,542 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 23:40:31,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:31,924 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-02-20 23:40:31,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:40:31,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2022-02-20 23:40:31,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:31,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 23:40:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-02-20 23:40:31,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 23:40:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-02-20 23:40:31,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 76 transitions. [2022-02-20 23:40:32,030 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 23:40:32,031 INFO L225 Difference]: With dead ends: 69 [2022-02-20 23:40:32,031 INFO L226 Difference]: Without dead ends: 69 [2022-02-20 23:40:32,032 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:40:32,032 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:32,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 174 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 29 Unchecked, 0.0s Time] [2022-02-20 23:40:32,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-20 23:40:32,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-02-20 23:40:32,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:32,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 44 states have (on average 1.75) internal successors, (77), 67 states have internal predecessors, (77), 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 23:40:32,036 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 44 states have (on average 1.75) internal successors, (77), 67 states have internal predecessors, (77), 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 23:40:32,036 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 44 states have (on average 1.75) internal successors, (77), 67 states have internal predecessors, (77), 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 23:40:32,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:32,037 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-02-20 23:40:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2022-02-20 23:40:32,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:32,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:32,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 44 states have (on average 1.75) internal successors, (77), 67 states have internal predecessors, (77), 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 69 states. [2022-02-20 23:40:32,038 INFO L87 Difference]: Start difference. First operand has 68 states, 44 states have (on average 1.75) internal successors, (77), 67 states have internal predecessors, (77), 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 69 states. [2022-02-20 23:40:32,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:32,040 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-02-20 23:40:32,040 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2022-02-20 23:40:32,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:32,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:32,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:32,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.75) internal successors, (77), 67 states have internal predecessors, (77), 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 23:40:32,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-02-20 23:40:32,042 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 6 [2022-02-20 23:40:32,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:32,042 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-02-20 23:40:32,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 23:40:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-02-20 23:40:32,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:40:32,043 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:32,043 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:32,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:40:32,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:32,255 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:40:32,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:32,256 INFO L85 PathProgramCache]: Analyzing trace with hash 176742579, now seen corresponding path program 1 times [2022-02-20 23:40:32,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:32,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697049560] [2022-02-20 23:40:32,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:32,257 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:32,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:32,258 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:32,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:40:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:32,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:40:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:32,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:32,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {1123#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1123#true} is VALID [2022-02-20 23:40:32,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {1123#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {1123#true} is VALID [2022-02-20 23:40:32,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {1123#true} assume !(~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32)); {1134#(and (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:32,395 INFO L290 TraceCheckUtils]: 3: Hoare triple {1134#(and (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {1138#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:32,396 INFO L290 TraceCheckUtils]: 4: Hoare triple {1138#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {1124#false} is VALID [2022-02-20 23:40:32,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {1124#false} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {1124#false} is VALID [2022-02-20 23:40:32,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {1124#false} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {1124#false} is VALID [2022-02-20 23:40:32,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {1124#false} assume !(1bv1 == #valid[lis_~best~0#1.base]); {1124#false} is VALID [2022-02-20 23:40:32,397 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 23:40:32,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:40:32,397 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:32,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697049560] [2022-02-20 23:40:32,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697049560] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:32,398 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:32,398 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:40:32,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879474886] [2022-02-20 23:40:32,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:32,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-02-20 23:40:32,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:32,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 23:40:32,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:32,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:40:32,409 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:32,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:40:32,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:40:32,410 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 23:40:32,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:32,824 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-02-20 23:40:32,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:40:32,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-02-20 23:40:32,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:32,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 23:40:32,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-02-20 23:40:32,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 23:40:32,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2022-02-20 23:40:32,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2022-02-20 23:40:32,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:32,918 INFO L225 Difference]: With dead ends: 70 [2022-02-20 23:40:32,918 INFO L226 Difference]: Without dead ends: 70 [2022-02-20 23:40:32,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 23:40:32,920 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 74 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:32,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 128 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:40:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-20 23:40:32,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2022-02-20 23:40:32,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:32,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 66 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 65 states have internal predecessors, (74), 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 23:40:32,923 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 66 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 65 states have internal predecessors, (74), 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 23:40:32,923 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 66 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 65 states have internal predecessors, (74), 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 23:40:32,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:32,924 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-02-20 23:40:32,924 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-02-20 23:40:32,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:32,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:32,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 65 states have internal predecessors, (74), 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 70 states. [2022-02-20 23:40:32,925 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 65 states have internal predecessors, (74), 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 70 states. [2022-02-20 23:40:32,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:32,926 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-02-20 23:40:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-02-20 23:40:32,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:32,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:32,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:32,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:32,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 65 states have internal predecessors, (74), 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 23:40:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2022-02-20 23:40:32,928 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 8 [2022-02-20 23:40:32,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:32,929 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2022-02-20 23:40:32,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 23:40:32,929 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2022-02-20 23:40:32,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:40:32,929 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:32,929 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:32,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-20 23:40:33,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:33,138 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:40:33,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:33,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1091210163, now seen corresponding path program 1 times [2022-02-20 23:40:33,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:33,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567652406] [2022-02-20 23:40:33,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:33,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:33,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:33,141 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:33,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:40:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:33,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:40:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:33,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:33,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {1426#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1426#true} is VALID [2022-02-20 23:40:33,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {1426#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {1426#true} is VALID [2022-02-20 23:40:33,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {1426#true} assume ~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32);main_~array_size~0#1 := 1bv32; {1437#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:33,246 INFO L290 TraceCheckUtils]: 3: Hoare triple {1437#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {1441#(and (= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)))} is VALID [2022-02-20 23:40:33,247 INFO L290 TraceCheckUtils]: 4: Hoare triple {1441#(and (= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {1441#(and (= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)))} is VALID [2022-02-20 23:40:33,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {1441#(and (= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {1441#(and (= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)))} is VALID [2022-02-20 23:40:33,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {1441#(and (= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)))} havoc main_#t~nondet19#1; {1441#(and (= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)))} is VALID [2022-02-20 23:40:33,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {1441#(and (= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {1454#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) (= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32)))} is VALID [2022-02-20 23:40:33,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {1454#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) (= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32)))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {1427#false} is VALID [2022-02-20 23:40:33,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {1427#false} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1))), #length[main_~numbers~0#1.base]) && ~bvule32(~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), ~bvadd32(4bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1))))) && ~bvule32(0bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)))); {1427#false} is VALID [2022-02-20 23:40:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:33,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:40:33,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {1427#false} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1))), #length[main_~numbers~0#1.base]) && ~bvule32(~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), ~bvadd32(4bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1))))) && ~bvule32(0bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)))); {1427#false} is VALID [2022-02-20 23:40:33,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {1464#(not (bvslt |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {1427#false} is VALID [2022-02-20 23:40:33,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {1468#(not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {1464#(not (bvslt |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:33,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {1468#(not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} havoc main_#t~nondet19#1; {1468#(not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:33,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {1468#(not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {1468#(not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:33,302 INFO L290 TraceCheckUtils]: 4: Hoare triple {1468#(not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {1468#(not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:33,303 INFO L290 TraceCheckUtils]: 3: Hoare triple {1481#(not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {1468#(not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:33,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {1426#true} assume ~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32);main_~array_size~0#1 := 1bv32; {1481#(not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:33,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {1426#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {1426#true} is VALID [2022-02-20 23:40:33,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {1426#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1426#true} is VALID [2022-02-20 23:40:33,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:33,304 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:33,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567652406] [2022-02-20 23:40:33,304 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567652406] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:40:33,304 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:40:33,304 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-20 23:40:33,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281765162] [2022-02-20 23:40:33,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:40:33,305 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 10 [2022-02-20 23:40:33,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:33,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 23:40:33,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:33,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:40:33,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:33,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:40:33,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:40:33,321 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 23:40:34,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:34,275 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2022-02-20 23:40:34,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:40:34,275 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 10 [2022-02-20 23:40:34,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 23:40:34,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2022-02-20 23:40:34,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 23:40:34,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2022-02-20 23:40:34,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 140 transitions. [2022-02-20 23:40:34,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:34,436 INFO L225 Difference]: With dead ends: 127 [2022-02-20 23:40:34,437 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 23:40:34,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:40:34,439 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 131 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:34,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 317 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:40:34,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 23:40:34,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 72. [2022-02-20 23:40:34,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:34,454 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 72 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 71 states have internal predecessors, (80), 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 23:40:34,454 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 72 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 71 states have internal predecessors, (80), 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 23:40:34,455 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 72 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 71 states have internal predecessors, (80), 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 23:40:34,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:34,457 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2022-02-20 23:40:34,457 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2022-02-20 23:40:34,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:34,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:34,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 71 states have internal predecessors, (80), 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 127 states. [2022-02-20 23:40:34,458 INFO L87 Difference]: Start difference. First operand has 72 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 71 states have internal predecessors, (80), 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 127 states. [2022-02-20 23:40:34,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:34,460 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2022-02-20 23:40:34,460 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2022-02-20 23:40:34,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:34,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:34,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:34,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:34,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 71 states have internal predecessors, (80), 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 23:40:34,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2022-02-20 23:40:34,462 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 10 [2022-02-20 23:40:34,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:34,462 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2022-02-20 23:40:34,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 23:40:34,463 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2022-02-20 23:40:34,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:40:34,463 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:34,463 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:34,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:40:34,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:34,669 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:40:34,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:34,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1900556789, now seen corresponding path program 1 times [2022-02-20 23:40:34,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:34,670 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048134532] [2022-02-20 23:40:34,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:34,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:34,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:34,671 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:34,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:40:34,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:34,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:40:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:34,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:34,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-02-20 23:40:34,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {1943#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1943#true} is VALID [2022-02-20 23:40:34,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {1943#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {1943#true} is VALID [2022-02-20 23:40:34,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {1943#true} assume !(~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32)); {1954#(and (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:34,898 INFO L290 TraceCheckUtils]: 3: Hoare triple {1954#(and (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {1958#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:34,915 INFO L290 TraceCheckUtils]: 4: Hoare triple {1958#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {1958#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:34,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {1958#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {1958#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:34,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {1958#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} havoc main_#t~nondet19#1; {1958#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:34,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {1958#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {1971#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:34,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {1971#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {1975#(and (exists ((|ULTIMATE.start_main_~array_size~0#1| (_ BitVec 32))) (and (bvslt |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))) (= |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:40:34,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {1975#(and (exists ((|ULTIMATE.start_main_~array_size~0#1| (_ BitVec 32))) (and (bvslt |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))) (= |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1))), #length[main_~numbers~0#1.base]) && ~bvule32(~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), ~bvadd32(4bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1))))) && ~bvule32(0bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)))); {1944#false} is VALID [2022-02-20 23:40:34,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:34,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:40:35,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {1979#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1))), #length[main_~numbers~0#1.base]) && ~bvule32(~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), ~bvadd32(4bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1))))) && ~bvule32(0bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)))); {1944#false} is VALID [2022-02-20 23:40:35,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {1983#(or (not (bvslt |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|))))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {1979#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)))} is VALID [2022-02-20 23:40:35,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {1987#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {1983#(or (not (bvslt |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|))))} is VALID [2022-02-20 23:40:35,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {1987#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} havoc main_#t~nondet19#1; {1987#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} is VALID [2022-02-20 23:40:35,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {1987#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {1987#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} is VALID [2022-02-20 23:40:35,756 INFO L290 TraceCheckUtils]: 4: Hoare triple {1987#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {1987#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} is VALID [2022-02-20 23:40:35,765 INFO L290 TraceCheckUtils]: 3: Hoare triple {2000#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {1987#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} is VALID [2022-02-20 23:40:35,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {1943#true} assume !(~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32)); {2000#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:40:35,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {1943#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {1943#true} is VALID [2022-02-20 23:40:35,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {1943#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1943#true} is VALID [2022-02-20 23:40:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:35,766 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:35,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048134532] [2022-02-20 23:40:35,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048134532] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:40:35,766 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:40:35,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-02-20 23:40:35,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150480852] [2022-02-20 23:40:35,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:40:35,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 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 10 [2022-02-20 23:40:35,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:35,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 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 23:40:36,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:36,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:40:36,107 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:36,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:40:36,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:40:36,107 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 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 23:40:38,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:38,757 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2022-02-20 23:40:38,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:40:38,757 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 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 10 [2022-02-20 23:40:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:38,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 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 23:40:38,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-02-20 23:40:38,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 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 23:40:38,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-02-20 23:40:38,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2022-02-20 23:40:39,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:39,293 INFO L225 Difference]: With dead ends: 135 [2022-02-20 23:40:39,293 INFO L226 Difference]: Without dead ends: 135 [2022-02-20 23:40:39,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:40:39,294 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 135 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:39,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 296 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 7 Unchecked, 0.9s Time] [2022-02-20 23:40:39,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-02-20 23:40:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 80. [2022-02-20 23:40:39,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:39,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 80 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 79 states have internal predecessors, (90), 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 23:40:39,304 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 80 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 79 states have internal predecessors, (90), 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 23:40:39,307 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 80 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 79 states have internal predecessors, (90), 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 23:40:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:39,309 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2022-02-20 23:40:39,309 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2022-02-20 23:40:39,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:39,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:39,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 79 states have internal predecessors, (90), 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 135 states. [2022-02-20 23:40:39,310 INFO L87 Difference]: Start difference. First operand has 80 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 79 states have internal predecessors, (90), 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 135 states. [2022-02-20 23:40:39,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:39,312 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2022-02-20 23:40:39,313 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 151 transitions. [2022-02-20 23:40:39,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:39,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:39,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:39,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 79 states have internal predecessors, (90), 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 23:40:39,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2022-02-20 23:40:39,315 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 10 [2022-02-20 23:40:39,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:39,315 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2022-02-20 23:40:39,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 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 23:40:39,315 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2022-02-20 23:40:39,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:40:39,316 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:39,316 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:39,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:40:39,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:39,519 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:40:39,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:39,520 INFO L85 PathProgramCache]: Analyzing trace with hash -680998152, now seen corresponding path program 1 times [2022-02-20 23:40:39,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:39,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443355693] [2022-02-20 23:40:39,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:39,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:39,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:39,522 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:39,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:40:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:39,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:40:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:39,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:39,617 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:40:39,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-02-20 23:40:39,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {2496#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {2496#true} is VALID [2022-02-20 23:40:39,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {2496#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {2496#true} is VALID [2022-02-20 23:40:39,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {2496#true} assume ~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32);main_~array_size~0#1 := 1bv32; {2496#true} is VALID [2022-02-20 23:40:39,635 INFO L290 TraceCheckUtils]: 3: Hoare triple {2496#true} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {2496#true} is VALID [2022-02-20 23:40:39,635 INFO L290 TraceCheckUtils]: 4: Hoare triple {2496#true} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {2496#true} is VALID [2022-02-20 23:40:39,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {2496#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {2496#true} is VALID [2022-02-20 23:40:39,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {2496#true} havoc main_#t~nondet19#1; {2496#true} is VALID [2022-02-20 23:40:39,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {2496#true} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {2496#true} is VALID [2022-02-20 23:40:39,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {2496#true} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {2496#true} is VALID [2022-02-20 23:40:39,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {2496#true} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {2528#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_lis_~best~0#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:40:39,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {2528#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_lis_~best~0#1.base|)) (_ bv1 1)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {2528#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_lis_~best~0#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:40:39,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {2528#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_lis_~best~0#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[lis_~best~0#1.base]); {2497#false} is VALID [2022-02-20 23:40:39,639 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 23:40:39,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:40:39,639 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:39,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443355693] [2022-02-20 23:40:39,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443355693] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:39,639 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:39,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:40:39,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567884028] [2022-02-20 23:40:39,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:39,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2022-02-20 23:40:39,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:39,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 23:40:39,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:39,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:40:39,651 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:39,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:40:39,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:40:39,652 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 23:40:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:39,935 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-02-20 23:40:39,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:40:39,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2022-02-20 23:40:39,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 23:40:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-02-20 23:40:39,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 23:40:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-02-20 23:40:39,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2022-02-20 23:40:40,029 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:40,029 INFO L225 Difference]: With dead ends: 73 [2022-02-20 23:40:40,030 INFO L226 Difference]: Without dead ends: 73 [2022-02-20 23:40:40,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 23:40:40,030 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 49 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:40,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:40:40,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-20 23:40:40,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-02-20 23:40:40,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:40,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 72 states have internal predecessors, (83), 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 23:40:40,034 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 72 states have internal predecessors, (83), 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 23:40:40,034 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 72 states have internal predecessors, (83), 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 23:40:40,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:40,035 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-02-20 23:40:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-02-20 23:40:40,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:40,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:40,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 72 states have internal predecessors, (83), 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 73 states. [2022-02-20 23:40:40,036 INFO L87 Difference]: Start difference. First operand has 73 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 72 states have internal predecessors, (83), 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 73 states. [2022-02-20 23:40:40,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:40,037 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-02-20 23:40:40,037 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-02-20 23:40:40,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:40,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:40,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:40,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:40,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 72 states have internal predecessors, (83), 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 23:40:40,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-02-20 23:40:40,039 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 12 [2022-02-20 23:40:40,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:40,039 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-02-20 23:40:40,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 23:40:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-02-20 23:40:40,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:40:40,040 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:40,040 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:40,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:40:40,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:40,246 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:40:40,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:40,247 INFO L85 PathProgramCache]: Analyzing trace with hash -680998151, now seen corresponding path program 1 times [2022-02-20 23:40:40,247 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:40,247 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255285389] [2022-02-20 23:40:40,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:40,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:40,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:40,248 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:40,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:40:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:40,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:40:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:40,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:40,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:40:40,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-02-20 23:40:40,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-02-20 23:40:40,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {2826#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {2826#true} is VALID [2022-02-20 23:40:40,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {2826#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {2826#true} is VALID [2022-02-20 23:40:40,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {2826#true} assume ~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32);main_~array_size~0#1 := 1bv32; {2837#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:40,394 INFO L290 TraceCheckUtils]: 3: Hoare triple {2837#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {2837#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:40,394 INFO L290 TraceCheckUtils]: 4: Hoare triple {2837#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {2837#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:40,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {2837#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {2837#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:40,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {2837#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} havoc main_#t~nondet19#1; {2837#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:40,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {2837#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {2837#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:40,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {2837#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {2837#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:40,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {2837#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {2859#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:40:40,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {2859#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {2859#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:40:40,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {2859#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))), #length[lis_~best~0#1.base]) && ~bvule32(~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), ~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))))) && ~bvule32(0bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)))); {2827#false} is VALID [2022-02-20 23:40:40,399 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 23:40:40,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:40:40,399 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:40,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255285389] [2022-02-20 23:40:40,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255285389] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:40,399 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:40,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:40:40,402 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917793502] [2022-02-20 23:40:40,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:40,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2022-02-20 23:40:40,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:40,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 23:40:40,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:40,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:40:40,416 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:40,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:40:40,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:40:40,417 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 23:40:41,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:41,032 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2022-02-20 23:40:41,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:40:41,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2022-02-20 23:40:41,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:41,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 23:40:41,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2022-02-20 23:40:41,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 23:40:41,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2022-02-20 23:40:41,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 134 transitions. [2022-02-20 23:40:41,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:41,182 INFO L225 Difference]: With dead ends: 128 [2022-02-20 23:40:41,182 INFO L226 Difference]: Without dead ends: 128 [2022-02-20 23:40:41,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:40:41,183 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:41,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 139 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:40:41,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-02-20 23:40:41,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 76. [2022-02-20 23:40:41,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:41,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 76 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 75 states have internal predecessors, (87), 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 23:40:41,193 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 76 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 75 states have internal predecessors, (87), 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 23:40:41,193 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 76 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 75 states have internal predecessors, (87), 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 23:40:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:41,200 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2022-02-20 23:40:41,200 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2022-02-20 23:40:41,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:41,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:41,201 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 75 states have internal predecessors, (87), 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 128 states. [2022-02-20 23:40:41,201 INFO L87 Difference]: Start difference. First operand has 76 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 75 states have internal predecessors, (87), 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 128 states. [2022-02-20 23:40:41,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:41,203 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2022-02-20 23:40:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2022-02-20 23:40:41,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:41,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:41,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:41,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 75 states have internal predecessors, (87), 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 23:40:41,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2022-02-20 23:40:41,210 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 12 [2022-02-20 23:40:41,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:41,210 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2022-02-20 23:40:41,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 23:40:41,211 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2022-02-20 23:40:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:40:41,211 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:41,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:41,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:40:41,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:41,418 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:40:41,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:41,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1074025161, now seen corresponding path program 1 times [2022-02-20 23:40:41,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:41,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115632992] [2022-02-20 23:40:41,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:41,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:41,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:41,420 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:41,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:40:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:41,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:40:41,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:41,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:41,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:40:41,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2022-02-20 23:40:41,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-02-20 23:40:41,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {3327#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {3327#true} is VALID [2022-02-20 23:40:41,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {3327#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {3327#true} is VALID [2022-02-20 23:40:41,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {3327#true} assume !(~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32)); {3338#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:40:41,585 INFO L290 TraceCheckUtils]: 3: Hoare triple {3338#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {3338#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:40:41,585 INFO L290 TraceCheckUtils]: 4: Hoare triple {3338#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {3338#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:40:41,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {3338#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {3338#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:40:41,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {3338#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} havoc main_#t~nondet19#1; {3338#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:40:41,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {3338#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {3338#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:40:41,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {3338#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {3338#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:40:41,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {3338#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {3360#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:40:41,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {3360#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {3364#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (exists ((|ULTIMATE.start_lis_~N#1| (_ BitVec 32))) (and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|))))} is VALID [2022-02-20 23:40:41,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {3364#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (exists ((|ULTIMATE.start_lis_~N#1| (_ BitVec 32))) (and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|))))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))), #length[lis_~best~0#1.base]) && ~bvule32(~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), ~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))))) && ~bvule32(0bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)))); {3328#false} is VALID [2022-02-20 23:40:41,591 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 23:40:41,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:40:41,592 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:41,592 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115632992] [2022-02-20 23:40:41,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115632992] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:41,592 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:41,592 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:40:41,592 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102339383] [2022-02-20 23:40:41,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:41,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-02-20 23:40:41,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:41,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 23:40:41,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:41,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:40:41,608 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:41,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:40:41,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:40:41,608 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 23:40:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:42,205 INFO L93 Difference]: Finished difference Result 118 states and 135 transitions. [2022-02-20 23:40:42,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:40:42,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-02-20 23:40:42,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:42,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 23:40:42,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2022-02-20 23:40:42,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 23:40:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2022-02-20 23:40:42,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 114 transitions. [2022-02-20 23:40:42,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:42,326 INFO L225 Difference]: With dead ends: 118 [2022-02-20 23:40:42,326 INFO L226 Difference]: Without dead ends: 118 [2022-02-20 23:40:42,326 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:40:42,327 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 51 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:42,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 159 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2022-02-20 23:40:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-02-20 23:40:42,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 75. [2022-02-20 23:40:42,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:42,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 75 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 74 states have internal predecessors, (86), 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 23:40:42,329 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 75 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 74 states have internal predecessors, (86), 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 23:40:42,330 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 75 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 74 states have internal predecessors, (86), 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 23:40:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:42,337 INFO L93 Difference]: Finished difference Result 118 states and 135 transitions. [2022-02-20 23:40:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 135 transitions. [2022-02-20 23:40:42,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:42,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:42,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 74 states have internal predecessors, (86), 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 118 states. [2022-02-20 23:40:42,338 INFO L87 Difference]: Start difference. First operand has 75 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 74 states have internal predecessors, (86), 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 118 states. [2022-02-20 23:40:42,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:42,345 INFO L93 Difference]: Finished difference Result 118 states and 135 transitions. [2022-02-20 23:40:42,345 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 135 transitions. [2022-02-20 23:40:42,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:42,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:42,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:42,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 74 states have internal predecessors, (86), 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 23:40:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2022-02-20 23:40:42,347 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 12 [2022-02-20 23:40:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:42,347 INFO L470 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2022-02-20 23:40:42,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 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 23:40:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2022-02-20 23:40:42,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:40:42,348 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:42,348 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:42,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:40:42,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:42,554 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:40:42,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:42,554 INFO L85 PathProgramCache]: Analyzing trace with hash 363893777, now seen corresponding path program 1 times [2022-02-20 23:40:42,555 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:42,555 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285106856] [2022-02-20 23:40:42,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:42,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:42,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:42,556 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:42,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 23:40:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:42,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:40:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:42,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:42,653 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:40:42,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-02-20 23:40:42,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {3800#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {3800#true} is VALID [2022-02-20 23:40:42,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {3800#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {3800#true} is VALID [2022-02-20 23:40:42,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {3800#true} assume ~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32);main_~array_size~0#1 := 1bv32; {3800#true} is VALID [2022-02-20 23:40:42,675 INFO L290 TraceCheckUtils]: 3: Hoare triple {3800#true} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {3800#true} is VALID [2022-02-20 23:40:42,675 INFO L290 TraceCheckUtils]: 4: Hoare triple {3800#true} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {3800#true} is VALID [2022-02-20 23:40:42,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {3800#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {3800#true} is VALID [2022-02-20 23:40:42,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {3800#true} havoc main_#t~nondet19#1; {3800#true} is VALID [2022-02-20 23:40:42,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {3800#true} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {3800#true} is VALID [2022-02-20 23:40:42,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {3800#true} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {3800#true} is VALID [2022-02-20 23:40:42,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {3800#true} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {3832#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_lis_~prev~0#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:40:42,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {3832#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_lis_~prev~0#1.base|)) (_ bv1 1)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {3832#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_lis_~prev~0#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:40:42,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {3832#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_lis_~prev~0#1.base|)) (_ bv1 1)))} SUMMARY for call write~intINTTYPE4(1bv32, lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518 {3832#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_lis_~prev~0#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:40:42,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {3832#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_lis_~prev~0#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[lis_~prev~0#1.base]); {3801#false} is VALID [2022-02-20 23:40:42,695 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 23:40:42,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:40:42,695 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:42,695 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285106856] [2022-02-20 23:40:42,695 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285106856] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:42,695 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:42,695 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:40:42,695 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568097933] [2022-02-20 23:40:42,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:42,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-02-20 23:40:42,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:42,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 23:40:42,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:42,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:40:42,709 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:42,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:40:42,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:40:42,710 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 23:40:42,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:42,934 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-02-20 23:40:42,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:40:42,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-02-20 23:40:42,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:42,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 23:40:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-02-20 23:40:42,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 23:40:42,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-02-20 23:40:42,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-02-20 23:40:43,011 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 23:40:43,012 INFO L225 Difference]: With dead ends: 73 [2022-02-20 23:40:43,012 INFO L226 Difference]: Without dead ends: 73 [2022-02-20 23:40:43,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 23:40:43,013 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:43,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 54 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:40:43,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-20 23:40:43,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-02-20 23:40:43,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:43,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 72 states have internal predecessors, (84), 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 23:40:43,016 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 72 states have internal predecessors, (84), 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 23:40:43,016 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 72 states have internal predecessors, (84), 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 23:40:43,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:43,017 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-02-20 23:40:43,017 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2022-02-20 23:40:43,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:43,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:43,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 72 states have internal predecessors, (84), 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 73 states. [2022-02-20 23:40:43,017 INFO L87 Difference]: Start difference. First operand has 73 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 72 states have internal predecessors, (84), 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 73 states. [2022-02-20 23:40:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:43,019 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-02-20 23:40:43,019 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2022-02-20 23:40:43,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:43,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:43,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:43,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:43,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 72 states have internal predecessors, (84), 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 23:40:43,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2022-02-20 23:40:43,020 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 13 [2022-02-20 23:40:43,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:43,021 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2022-02-20 23:40:43,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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 23:40:43,021 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2022-02-20 23:40:43,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:40:43,021 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:43,021 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:43,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:40:43,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:43,227 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:40:43,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:43,228 INFO L85 PathProgramCache]: Analyzing trace with hash 363893778, now seen corresponding path program 1 times [2022-02-20 23:40:43,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:43,228 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042238626] [2022-02-20 23:40:43,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:43,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:43,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:43,229 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:43,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 23:40:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:43,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:40:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:43,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:43,344 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:40:43,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-02-20 23:40:43,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {4133#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {4133#true} is VALID [2022-02-20 23:40:43,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {4133#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {4133#true} is VALID [2022-02-20 23:40:43,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {4133#true} assume ~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32);main_~array_size~0#1 := 1bv32; {4144#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:43,381 INFO L290 TraceCheckUtils]: 3: Hoare triple {4144#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {4144#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:43,381 INFO L290 TraceCheckUtils]: 4: Hoare triple {4144#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {4144#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:43,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {4144#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {4144#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:43,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {4144#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} havoc main_#t~nondet19#1; {4144#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:43,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {4144#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {4144#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:43,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {4144#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {4144#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:43,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {4144#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {4166#(and (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|)))} is VALID [2022-02-20 23:40:43,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {4166#(and (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {4166#(and (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|)))} is VALID [2022-02-20 23:40:43,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {4166#(and (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|)))} SUMMARY for call write~intINTTYPE4(1bv32, lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518 {4166#(and (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|)))} is VALID [2022-02-20 23:40:43,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {4166#(and (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))), #length[lis_~prev~0#1.base]) && ~bvule32(~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), ~bvadd32(4bv32, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))))) && ~bvule32(0bv32, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)))); {4134#false} is VALID [2022-02-20 23:40:43,387 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 23:40:43,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:40:43,387 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:43,388 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042238626] [2022-02-20 23:40:43,388 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042238626] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:43,388 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:43,388 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:40:43,388 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060145709] [2022-02-20 23:40:43,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:43,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-02-20 23:40:43,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:43,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 23:40:43,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:43,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:40:43,404 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:43,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:40:43,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:40:43,404 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 23:40:43,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:43,986 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2022-02-20 23:40:43,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:40:43,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-02-20 23:40:43,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:43,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 23:40:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2022-02-20 23:40:43,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 23:40:43,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2022-02-20 23:40:43,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 128 transitions. [2022-02-20 23:40:44,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:44,129 INFO L225 Difference]: With dead ends: 124 [2022-02-20 23:40:44,130 INFO L226 Difference]: Without dead ends: 124 [2022-02-20 23:40:44,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:40:44,130 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 59 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:44,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 133 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:40:44,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-02-20 23:40:44,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 77. [2022-02-20 23:40:44,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:44,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 77 states, 62 states have (on average 1.435483870967742) internal successors, (89), 76 states have internal predecessors, (89), 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 23:40:44,132 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 77 states, 62 states have (on average 1.435483870967742) internal successors, (89), 76 states have internal predecessors, (89), 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 23:40:44,133 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 77 states, 62 states have (on average 1.435483870967742) internal successors, (89), 76 states have internal predecessors, (89), 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 23:40:44,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:44,134 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2022-02-20 23:40:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2022-02-20 23:40:44,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:44,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:44,135 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 62 states have (on average 1.435483870967742) internal successors, (89), 76 states have internal predecessors, (89), 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 124 states. [2022-02-20 23:40:44,135 INFO L87 Difference]: Start difference. First operand has 77 states, 62 states have (on average 1.435483870967742) internal successors, (89), 76 states have internal predecessors, (89), 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 124 states. [2022-02-20 23:40:44,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:44,136 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2022-02-20 23:40:44,136 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2022-02-20 23:40:44,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:44,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:44,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:44,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:44,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.435483870967742) internal successors, (89), 76 states have internal predecessors, (89), 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 23:40:44,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2022-02-20 23:40:44,138 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 13 [2022-02-20 23:40:44,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:44,138 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2022-02-20 23:40:44,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 23:40:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2022-02-20 23:40:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:40:44,139 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:44,139 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:44,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:40:44,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:44,346 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:40:44,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:44,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1064958356, now seen corresponding path program 1 times [2022-02-20 23:40:44,347 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:44,347 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347667025] [2022-02-20 23:40:44,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:44,347 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:44,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:44,348 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:44,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 23:40:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:44,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:40:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:44,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:44,454 INFO L356 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-02-20 23:40:44,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 17 [2022-02-20 23:40:44,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {4626#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {4626#true} is VALID [2022-02-20 23:40:44,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {4626#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {4626#true} is VALID [2022-02-20 23:40:44,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {4626#true} assume !(~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32)); {4637#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:40:44,524 INFO L290 TraceCheckUtils]: 3: Hoare triple {4637#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {4637#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:40:44,524 INFO L290 TraceCheckUtils]: 4: Hoare triple {4637#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {4637#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:40:44,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {4637#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {4637#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:40:44,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {4637#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} havoc main_#t~nondet19#1; {4637#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:40:44,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {4637#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {4637#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:40:44,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {4637#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {4637#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:40:44,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {4637#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {4659#(and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)) (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:40:44,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {4659#(and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)) (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {4663#(and (exists ((|ULTIMATE.start_lis_~N#1| (_ BitVec 32))) (and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)) (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|))) (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:40:44,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {4663#(and (exists ((|ULTIMATE.start_lis_~N#1| (_ BitVec 32))) (and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)) (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|))) (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(1bv32, lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518 {4663#(and (exists ((|ULTIMATE.start_lis_~N#1| (_ BitVec 32))) (and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)) (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|))) (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:40:44,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {4663#(and (exists ((|ULTIMATE.start_lis_~N#1| (_ BitVec 32))) (and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)) (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|))) (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))), #length[lis_~prev~0#1.base]) && ~bvule32(~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), ~bvadd32(4bv32, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))))) && ~bvule32(0bv32, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)))); {4627#false} is VALID [2022-02-20 23:40:44,531 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 23:40:44,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:40:44,531 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:44,531 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347667025] [2022-02-20 23:40:44,531 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347667025] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:44,531 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:44,531 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:40:44,531 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127256516] [2022-02-20 23:40:44,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:44,532 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-02-20 23:40:44,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:44,532 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 23:40:44,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:44,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:40:44,547 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:44,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:40:44,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:40:44,548 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 23:40:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:45,113 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2022-02-20 23:40:45,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:40:45,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-02-20 23:40:45,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:45,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 23:40:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2022-02-20 23:40:45,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 23:40:45,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2022-02-20 23:40:45,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 112 transitions. [2022-02-20 23:40:45,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:45,248 INFO L225 Difference]: With dead ends: 117 [2022-02-20 23:40:45,248 INFO L226 Difference]: Without dead ends: 117 [2022-02-20 23:40:45,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:40:45,249 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 50 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:45,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 149 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 43 Unchecked, 0.1s Time] [2022-02-20 23:40:45,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-02-20 23:40:45,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 74. [2022-02-20 23:40:45,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:45,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 74 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 73 states have internal predecessors, (85), 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 23:40:45,250 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 74 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 73 states have internal predecessors, (85), 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 23:40:45,251 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 74 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 73 states have internal predecessors, (85), 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 23:40:45,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:45,252 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2022-02-20 23:40:45,252 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2022-02-20 23:40:45,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:45,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:45,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 73 states have internal predecessors, (85), 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 117 states. [2022-02-20 23:40:45,253 INFO L87 Difference]: Start difference. First operand has 74 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 73 states have internal predecessors, (85), 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 117 states. [2022-02-20 23:40:45,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:45,254 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2022-02-20 23:40:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2022-02-20 23:40:45,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:45,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:45,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:45,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:45,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 73 states have internal predecessors, (85), 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 23:40:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2022-02-20 23:40:45,256 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 13 [2022-02-20 23:40:45,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:45,256 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2022-02-20 23:40:45,256 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 23:40:45,256 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-02-20 23:40:45,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:40:45,256 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:45,257 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:45,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-20 23:40:45,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:45,463 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:40:45,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:45,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1808065813, now seen corresponding path program 1 times [2022-02-20 23:40:45,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:45,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521320616] [2022-02-20 23:40:45,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:45,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:45,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:45,465 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:45,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 23:40:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:45,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:40:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:45,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:45,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {5098#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {5098#true} is VALID [2022-02-20 23:40:45,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {5098#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {5098#true} is VALID [2022-02-20 23:40:45,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {5098#true} assume ~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32);main_~array_size~0#1 := 1bv32; {5109#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:45,571 INFO L290 TraceCheckUtils]: 3: Hoare triple {5109#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {5109#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:45,571 INFO L290 TraceCheckUtils]: 4: Hoare triple {5109#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {5109#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:45,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {5109#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {5109#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:45,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {5109#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} havoc main_#t~nondet19#1; {5109#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:45,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {5109#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {5109#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:45,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {5109#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {5109#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:45,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {5109#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {5131#(and (= |ULTIMATE.start_lis_~N#1| (_ bv1 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:40:45,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {5131#(and (= |ULTIMATE.start_lis_~N#1| (_ bv1 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} assume !~bvslt32(lis_~i~0#1, lis_~N#1); {5099#false} is VALID [2022-02-20 23:40:45,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {5099#false} lis_~i~0#1 := 1bv32; {5099#false} is VALID [2022-02-20 23:40:45,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {5099#false} assume !!~bvslt32(lis_~i~0#1, lis_~N#1);lis_~j~0#1 := 0bv32; {5099#false} is VALID [2022-02-20 23:40:45,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {5099#false} assume !!~bvslt32(lis_~j~0#1, lis_~i~0#1); {5099#false} is VALID [2022-02-20 23:40:45,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {5099#false} assume !(1bv1 == #valid[lis_~a#1.base]); {5099#false} is VALID [2022-02-20 23:40:45,575 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 23:40:45,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:40:45,575 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:45,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521320616] [2022-02-20 23:40:45,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521320616] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:40:45,576 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:40:45,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:40:45,576 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758365013] [2022-02-20 23:40:45,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:40:45,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-02-20 23:40:45,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:45,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 23:40:45,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:45,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:40:45,594 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:45,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:40:45,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:40:45,595 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 23:40:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:46,438 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2022-02-20 23:40:46,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:40:46,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-02-20 23:40:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:46,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 23:40:46,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-02-20 23:40:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 23:40:46,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-02-20 23:40:46,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 126 transitions. [2022-02-20 23:40:46,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:46,577 INFO L225 Difference]: With dead ends: 124 [2022-02-20 23:40:46,577 INFO L226 Difference]: Without dead ends: 124 [2022-02-20 23:40:46,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:40:46,578 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 58 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:46,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 208 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:40:46,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-02-20 23:40:46,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 76. [2022-02-20 23:40:46,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:46,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 76 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 75 states have internal predecessors, (87), 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 23:40:46,580 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 76 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 75 states have internal predecessors, (87), 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 23:40:46,580 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 76 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 75 states have internal predecessors, (87), 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 23:40:46,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:46,582 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2022-02-20 23:40:46,582 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 141 transitions. [2022-02-20 23:40:46,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:46,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:46,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 75 states have internal predecessors, (87), 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 124 states. [2022-02-20 23:40:46,583 INFO L87 Difference]: Start difference. First operand has 76 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 75 states have internal predecessors, (87), 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 124 states. [2022-02-20 23:40:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:46,586 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2022-02-20 23:40:46,586 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 141 transitions. [2022-02-20 23:40:46,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:46,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:46,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:46,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 75 states have internal predecessors, (87), 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 23:40:46,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2022-02-20 23:40:46,592 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 15 [2022-02-20 23:40:46,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:46,592 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2022-02-20 23:40:46,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 23:40:46,592 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2022-02-20 23:40:46,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:40:46,593 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:46,593 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:46,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:40:46,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:46,800 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:40:46,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:46,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1221259799, now seen corresponding path program 1 times [2022-02-20 23:40:46,800 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:46,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335861210] [2022-02-20 23:40:46,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:46,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:46,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:46,801 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:46,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-20 23:40:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:46,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:40:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:46,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:47,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {5596#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {5596#true} is VALID [2022-02-20 23:40:47,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {5596#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {5596#true} is VALID [2022-02-20 23:40:47,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {5596#true} assume !(~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32)); {5607#(and (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:47,004 INFO L290 TraceCheckUtils]: 3: Hoare triple {5607#(and (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {5611#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:47,004 INFO L290 TraceCheckUtils]: 4: Hoare triple {5611#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {5611#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:47,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {5611#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {5611#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:47,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {5611#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} havoc main_#t~nondet19#1; {5611#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:47,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {5611#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {5624#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~1#1|) (_ bv0 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:47,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {5624#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~1#1|) (_ bv0 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {5628#(and (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:47,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {5628#(and (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {5632#(and (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (not (bvslt |ULTIMATE.start_lis_~N#1| (_ bv1 32))) (not (bvslt (_ bv1 32) |ULTIMATE.start_lis_~N#1|)))} is VALID [2022-02-20 23:40:47,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {5632#(and (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (not (bvslt |ULTIMATE.start_lis_~N#1| (_ bv1 32))) (not (bvslt (_ bv1 32) |ULTIMATE.start_lis_~N#1|)))} assume !~bvslt32(lis_~i~0#1, lis_~N#1); {5597#false} is VALID [2022-02-20 23:40:47,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {5597#false} lis_~i~0#1 := 1bv32; {5597#false} is VALID [2022-02-20 23:40:47,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {5597#false} assume !!~bvslt32(lis_~i~0#1, lis_~N#1);lis_~j~0#1 := 0bv32; {5597#false} is VALID [2022-02-20 23:40:47,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {5597#false} assume !!~bvslt32(lis_~j~0#1, lis_~i~0#1); {5597#false} is VALID [2022-02-20 23:40:47,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {5597#false} assume !(1bv1 == #valid[lis_~a#1.base]); {5597#false} is VALID [2022-02-20 23:40:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:47,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:40:47,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {5597#false} assume !(1bv1 == #valid[lis_~a#1.base]); {5597#false} is VALID [2022-02-20 23:40:47,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {5597#false} assume !!~bvslt32(lis_~j~0#1, lis_~i~0#1); {5597#false} is VALID [2022-02-20 23:40:47,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {5597#false} assume !!~bvslt32(lis_~i~0#1, lis_~N#1);lis_~j~0#1 := 0bv32; {5597#false} is VALID [2022-02-20 23:40:47,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {5597#false} lis_~i~0#1 := 1bv32; {5597#false} is VALID [2022-02-20 23:40:47,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {5660#(bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|)} assume !~bvslt32(lis_~i~0#1, lis_~N#1); {5597#false} is VALID [2022-02-20 23:40:47,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {5664#(bvslt (_ bv0 32) |ULTIMATE.start_main_~array_size~0#1|)} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {5660#(bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|)} is VALID [2022-02-20 23:40:47,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {5668#(or (bvslt |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|) (bvslt (_ bv0 32) |ULTIMATE.start_main_~array_size~0#1|))} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {5664#(bvslt (_ bv0 32) |ULTIMATE.start_main_~array_size~0#1|)} is VALID [2022-02-20 23:40:47,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {5672#(or (bvslt (_ bv0 32) |ULTIMATE.start_main_~array_size~0#1|) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {5668#(or (bvslt |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|) (bvslt (_ bv0 32) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:47,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {5672#(or (bvslt (_ bv0 32) |ULTIMATE.start_main_~array_size~0#1|) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} havoc main_#t~nondet19#1; {5672#(or (bvslt (_ bv0 32) |ULTIMATE.start_main_~array_size~0#1|) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:47,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {5672#(or (bvslt (_ bv0 32) |ULTIMATE.start_main_~array_size~0#1|) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {5672#(or (bvslt (_ bv0 32) |ULTIMATE.start_main_~array_size~0#1|) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:47,136 INFO L290 TraceCheckUtils]: 4: Hoare triple {5672#(or (bvslt (_ bv0 32) |ULTIMATE.start_main_~array_size~0#1|) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {5672#(or (bvslt (_ bv0 32) |ULTIMATE.start_main_~array_size~0#1|) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:47,137 INFO L290 TraceCheckUtils]: 3: Hoare triple {5664#(bvslt (_ bv0 32) |ULTIMATE.start_main_~array_size~0#1|)} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {5672#(or (bvslt (_ bv0 32) |ULTIMATE.start_main_~array_size~0#1|) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:47,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {5596#true} assume !(~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32)); {5664#(bvslt (_ bv0 32) |ULTIMATE.start_main_~array_size~0#1|)} is VALID [2022-02-20 23:40:47,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {5596#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {5596#true} is VALID [2022-02-20 23:40:47,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {5596#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {5596#true} is VALID [2022-02-20 23:40:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:47,138 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:47,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335861210] [2022-02-20 23:40:47,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335861210] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:40:47,138 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:40:47,138 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2022-02-20 23:40:47,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154820754] [2022-02-20 23:40:47,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:40:47,139 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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 15 [2022-02-20 23:40:47,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:47,139 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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 23:40:47,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:47,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:40:47,167 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:47,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:40:47,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:40:47,168 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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 23:40:48,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:48,709 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2022-02-20 23:40:48,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:40:48,710 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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 15 [2022-02-20 23:40:48,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:48,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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 23:40:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2022-02-20 23:40:48,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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 23:40:48,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 137 transitions. [2022-02-20 23:40:48,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 137 transitions. [2022-02-20 23:40:48,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:48,899 INFO L225 Difference]: With dead ends: 126 [2022-02-20 23:40:48,899 INFO L226 Difference]: Without dead ends: 126 [2022-02-20 23:40:48,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:40:48,900 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 312 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:48,900 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 171 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:40:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-02-20 23:40:48,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 74. [2022-02-20 23:40:48,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:48,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 74 states, 59 states have (on average 1.423728813559322) internal successors, (84), 73 states have internal predecessors, (84), 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 23:40:48,903 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 74 states, 59 states have (on average 1.423728813559322) internal successors, (84), 73 states have internal predecessors, (84), 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 23:40:48,903 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 74 states, 59 states have (on average 1.423728813559322) internal successors, (84), 73 states have internal predecessors, (84), 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 23:40:48,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:48,904 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2022-02-20 23:40:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2022-02-20 23:40:48,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:48,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:48,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 59 states have (on average 1.423728813559322) internal successors, (84), 73 states have internal predecessors, (84), 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 126 states. [2022-02-20 23:40:48,905 INFO L87 Difference]: Start difference. First operand has 74 states, 59 states have (on average 1.423728813559322) internal successors, (84), 73 states have internal predecessors, (84), 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 126 states. [2022-02-20 23:40:48,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:48,906 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2022-02-20 23:40:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2022-02-20 23:40:48,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:48,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:48,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:48,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.423728813559322) internal successors, (84), 73 states have internal predecessors, (84), 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 23:40:48,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2022-02-20 23:40:48,908 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 15 [2022-02-20 23:40:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:48,908 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2022-02-20 23:40:48,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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 23:40:48,911 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2022-02-20 23:40:48,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:40:48,912 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:48,912 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:48,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-02-20 23:40:49,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:49,121 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:40:49,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:49,122 INFO L85 PathProgramCache]: Analyzing trace with hash 262068158, now seen corresponding path program 1 times [2022-02-20 23:40:49,122 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:49,122 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696998924] [2022-02-20 23:40:49,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:49,122 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:49,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:49,124 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:49,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-02-20 23:40:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:49,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:40:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:49,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:49,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {6155#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {6155#true} is VALID [2022-02-20 23:40:49,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {6155#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {6155#true} is VALID [2022-02-20 23:40:49,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {6155#true} assume ~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32);main_~array_size~0#1 := 1bv32; {6166#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:49,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {6166#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {6166#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:49,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {6166#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {6166#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:49,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {6166#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {6166#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:49,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {6166#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} havoc main_#t~nondet19#1; {6166#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:49,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {6166#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {6166#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:49,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {6166#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {6166#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} is VALID [2022-02-20 23:40:49,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {6166#(= |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {6188#(and (= |ULTIMATE.start_lis_~N#1| (_ bv1 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:40:49,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {6188#(and (= |ULTIMATE.start_lis_~N#1| (_ bv1 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {6188#(and (= |ULTIMATE.start_lis_~N#1| (_ bv1 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:40:49,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {6188#(and (= |ULTIMATE.start_lis_~N#1| (_ bv1 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(1bv32, lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518 {6188#(and (= |ULTIMATE.start_lis_~N#1| (_ bv1 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:40:49,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {6188#(and (= |ULTIMATE.start_lis_~N#1| (_ bv1 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(lis_~i~0#1, lis_~prev~0#1.base, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518-1 {6188#(and (= |ULTIMATE.start_lis_~N#1| (_ bv1 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:40:49,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {6188#(and (= |ULTIMATE.start_lis_~N#1| (_ bv1 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := ~bvadd32(1bv32, lis_#t~post4#1);havoc lis_#t~post4#1; {6201#(and (= |ULTIMATE.start_lis_~N#1| (_ bv1 32)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv0 32)))} is VALID [2022-02-20 23:40:49,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {6201#(and (= |ULTIMATE.start_lis_~N#1| (_ bv1 32)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv0 32)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {6156#false} is VALID [2022-02-20 23:40:49,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {6156#false} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))), #length[lis_~best~0#1.base]) && ~bvule32(~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), ~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))))) && ~bvule32(0bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)))); {6156#false} is VALID [2022-02-20 23:40:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:40:49,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:40:49,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {6156#false} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))), #length[lis_~best~0#1.base]) && ~bvule32(~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), ~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))))) && ~bvule32(0bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)))); {6156#false} is VALID [2022-02-20 23:40:49,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {6211#(not (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {6156#false} is VALID [2022-02-20 23:40:49,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {6215#(not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|))} lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := ~bvadd32(1bv32, lis_#t~post4#1);havoc lis_#t~post4#1; {6211#(not (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|))} is VALID [2022-02-20 23:40:49,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {6215#(not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|))} SUMMARY for call write~intINTTYPE4(lis_~i~0#1, lis_~prev~0#1.base, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518-1 {6215#(not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|))} is VALID [2022-02-20 23:40:49,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {6215#(not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|))} SUMMARY for call write~intINTTYPE4(1bv32, lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518 {6215#(not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|))} is VALID [2022-02-20 23:40:49,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {6215#(not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {6215#(not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|))} is VALID [2022-02-20 23:40:49,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {6228#(not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {6215#(not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|))} is VALID [2022-02-20 23:40:49,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {6228#(not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {6228#(not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:49,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {6228#(not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {6228#(not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:49,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {6228#(not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} havoc main_#t~nondet19#1; {6228#(not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:49,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {6228#(not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {6228#(not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:49,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {6228#(not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {6228#(not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:49,354 INFO L290 TraceCheckUtils]: 3: Hoare triple {6228#(not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {6228#(not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:49,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {6155#true} assume ~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32);main_~array_size~0#1 := 1bv32; {6228#(not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:49,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {6155#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {6155#true} is VALID [2022-02-20 23:40:49,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {6155#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {6155#true} is VALID [2022-02-20 23:40:49,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:40:49,354 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:49,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696998924] [2022-02-20 23:40:49,355 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696998924] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:40:49,355 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:40:49,355 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-20 23:40:49,355 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733211223] [2022-02-20 23:40:49,355 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:40:49,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 16 [2022-02-20 23:40:49,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:49,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 23:40:49,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:49,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:40:49,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:49,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:40:49,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:40:49,392 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 23:40:50,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:50,457 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-02-20 23:40:50,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:40:50,457 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 16 [2022-02-20 23:40:50,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:50,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 23:40:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-02-20 23:40:50,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 23:40:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-02-20 23:40:50,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2022-02-20 23:40:50,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:50,561 INFO L225 Difference]: With dead ends: 96 [2022-02-20 23:40:50,562 INFO L226 Difference]: Without dead ends: 96 [2022-02-20 23:40:50,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:40:50,562 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 57 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:50,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 226 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:40:50,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-20 23:40:50,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-02-20 23:40:50,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:50,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 90 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 89 states have internal predecessors, (103), 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 23:40:50,564 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 90 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 89 states have internal predecessors, (103), 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 23:40:50,565 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 90 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 89 states have internal predecessors, (103), 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 23:40:50,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:50,566 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-02-20 23:40:50,566 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-02-20 23:40:50,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:50,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:50,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 89 states have internal predecessors, (103), 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 96 states. [2022-02-20 23:40:50,567 INFO L87 Difference]: Start difference. First operand has 90 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 89 states have internal predecessors, (103), 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 96 states. [2022-02-20 23:40:50,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:50,573 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-02-20 23:40:50,573 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2022-02-20 23:40:50,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:50,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:50,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:50,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:50,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 89 states have internal predecessors, (103), 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 23:40:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2022-02-20 23:40:50,575 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 16 [2022-02-20 23:40:50,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:50,575 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2022-02-20 23:40:50,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 23:40:50,575 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2022-02-20 23:40:50,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:40:50,576 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:50,576 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:40:50,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-02-20 23:40:50,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:50,783 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:40:50,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:50,783 INFO L85 PathProgramCache]: Analyzing trace with hash -749049092, now seen corresponding path program 1 times [2022-02-20 23:40:50,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:50,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [489209352] [2022-02-20 23:40:50,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:40:50,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:50,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:50,785 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:50,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-02-20 23:40:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:50,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:40:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:50,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:50,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {6637#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {6637#true} is VALID [2022-02-20 23:40:50,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {6637#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {6637#true} is VALID [2022-02-20 23:40:50,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {6637#true} assume !(~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32)); {6648#(and (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:50,998 INFO L290 TraceCheckUtils]: 3: Hoare triple {6648#(and (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {6652#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:50,998 INFO L290 TraceCheckUtils]: 4: Hoare triple {6652#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {6652#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:50,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {6652#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {6652#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:50,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {6652#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} havoc main_#t~nondet19#1; {6652#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:51,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {6652#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {6665#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:51,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {6665#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {6669#(and (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:51,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {6669#(and (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {6673#(and (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (not (bvslt |ULTIMATE.start_lis_~N#1| (_ bv1 32))) (not (bvslt (_ bv1 32) |ULTIMATE.start_lis_~N#1|)))} is VALID [2022-02-20 23:40:51,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {6673#(and (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (not (bvslt |ULTIMATE.start_lis_~N#1| (_ bv1 32))) (not (bvslt (_ bv1 32) |ULTIMATE.start_lis_~N#1|)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {6673#(and (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (not (bvslt |ULTIMATE.start_lis_~N#1| (_ bv1 32))) (not (bvslt (_ bv1 32) |ULTIMATE.start_lis_~N#1|)))} is VALID [2022-02-20 23:40:51,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {6673#(and (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (not (bvslt |ULTIMATE.start_lis_~N#1| (_ bv1 32))) (not (bvslt (_ bv1 32) |ULTIMATE.start_lis_~N#1|)))} SUMMARY for call write~intINTTYPE4(1bv32, lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518 {6673#(and (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (not (bvslt |ULTIMATE.start_lis_~N#1| (_ bv1 32))) (not (bvslt (_ bv1 32) |ULTIMATE.start_lis_~N#1|)))} is VALID [2022-02-20 23:40:51,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {6673#(and (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (not (bvslt |ULTIMATE.start_lis_~N#1| (_ bv1 32))) (not (bvslt (_ bv1 32) |ULTIMATE.start_lis_~N#1|)))} SUMMARY for call write~intINTTYPE4(lis_~i~0#1, lis_~prev~0#1.base, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518-1 {6673#(and (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (not (bvslt |ULTIMATE.start_lis_~N#1| (_ bv1 32))) (not (bvslt (_ bv1 32) |ULTIMATE.start_lis_~N#1|)))} is VALID [2022-02-20 23:40:51,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {6673#(and (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (not (bvslt |ULTIMATE.start_lis_~N#1| (_ bv1 32))) (not (bvslt (_ bv1 32) |ULTIMATE.start_lis_~N#1|)))} lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := ~bvadd32(1bv32, lis_#t~post4#1);havoc lis_#t~post4#1; {6686#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv0 32)) (not (bvslt |ULTIMATE.start_lis_~N#1| (_ bv1 32))) (not (bvslt (_ bv1 32) |ULTIMATE.start_lis_~N#1|)))} is VALID [2022-02-20 23:40:51,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {6686#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv0 32)) (not (bvslt |ULTIMATE.start_lis_~N#1| (_ bv1 32))) (not (bvslt (_ bv1 32) |ULTIMATE.start_lis_~N#1|)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {6638#false} is VALID [2022-02-20 23:40:51,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {6638#false} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))), #length[lis_~best~0#1.base]) && ~bvule32(~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), ~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))))) && ~bvule32(0bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)))); {6638#false} is VALID [2022-02-20 23:40:51,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:51,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:40:51,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {6638#false} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))), #length[lis_~best~0#1.base]) && ~bvule32(~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), ~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))))) && ~bvule32(0bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)))); {6638#false} is VALID [2022-02-20 23:40:51,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {6696#(not (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {6638#false} is VALID [2022-02-20 23:40:51,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {6700#(not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|))} lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := ~bvadd32(1bv32, lis_#t~post4#1);havoc lis_#t~post4#1; {6696#(not (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|))} is VALID [2022-02-20 23:40:51,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {6700#(not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|))} SUMMARY for call write~intINTTYPE4(lis_~i~0#1, lis_~prev~0#1.base, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518-1 {6700#(not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|))} is VALID [2022-02-20 23:40:51,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {6700#(not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|))} SUMMARY for call write~intINTTYPE4(1bv32, lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518 {6700#(not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|))} is VALID [2022-02-20 23:40:51,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {6700#(not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {6700#(not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|))} is VALID [2022-02-20 23:40:51,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {6713#(not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {6700#(not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|))} is VALID [2022-02-20 23:40:51,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {6717#(or (bvslt |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|) (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)))} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {6713#(not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:51,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {6721#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {6717#(or (bvslt |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|) (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:40:51,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {6721#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} havoc main_#t~nondet19#1; {6721#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:51,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {6721#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {6721#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:51,144 INFO L290 TraceCheckUtils]: 4: Hoare triple {6721#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {6721#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:51,144 INFO L290 TraceCheckUtils]: 3: Hoare triple {6637#true} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {6721#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:40:51,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {6637#true} assume !(~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32)); {6637#true} is VALID [2022-02-20 23:40:51,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {6637#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {6637#true} is VALID [2022-02-20 23:40:51,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {6637#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {6637#true} is VALID [2022-02-20 23:40:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:51,145 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:51,145 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [489209352] [2022-02-20 23:40:51,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [489209352] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:40:51,145 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:40:51,145 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2022-02-20 23:40:51,145 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516498339] [2022-02-20 23:40:51,145 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:40:51,146 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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 16 [2022-02-20 23:40:51,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:51,146 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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 23:40:51,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:51,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 23:40:51,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:51,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 23:40:51,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:40:51,186 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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 23:40:52,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:52,732 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2022-02-20 23:40:52,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:40:52,732 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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 16 [2022-02-20 23:40:52,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:40:52,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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 23:40:52,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 104 transitions. [2022-02-20 23:40:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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 23:40:52,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 104 transitions. [2022-02-20 23:40:52,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 104 transitions. [2022-02-20 23:40:52,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:52,867 INFO L225 Difference]: With dead ends: 112 [2022-02-20 23:40:52,867 INFO L226 Difference]: Without dead ends: 112 [2022-02-20 23:40:52,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:40:52,868 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 203 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:40:52,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 242 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:40:52,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-02-20 23:40:52,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 90. [2022-02-20 23:40:52,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:40:52,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand has 90 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 89 states have internal predecessors, (103), 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 23:40:52,870 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand has 90 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 89 states have internal predecessors, (103), 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 23:40:52,870 INFO L87 Difference]: Start difference. First operand 112 states. Second operand has 90 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 89 states have internal predecessors, (103), 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 23:40:52,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:52,871 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2022-02-20 23:40:52,871 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2022-02-20 23:40:52,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:52,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:52,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 89 states have internal predecessors, (103), 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 112 states. [2022-02-20 23:40:52,872 INFO L87 Difference]: Start difference. First operand has 90 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 89 states have internal predecessors, (103), 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 112 states. [2022-02-20 23:40:52,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:40:52,873 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2022-02-20 23:40:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2022-02-20 23:40:52,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:40:52,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:40:52,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:40:52,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:40:52,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 89 states have internal predecessors, (103), 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 23:40:52,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2022-02-20 23:40:52,875 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 16 [2022-02-20 23:40:52,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:40:52,875 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2022-02-20 23:40:52,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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 23:40:52,876 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2022-02-20 23:40:52,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:40:52,876 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:40:52,876 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1] [2022-02-20 23:40:52,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-02-20 23:40:53,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:40:53,083 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:40:53,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:40:53,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1817992175, now seen corresponding path program 2 times [2022-02-20 23:40:53,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:40:53,084 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726313590] [2022-02-20 23:40:53,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:40:53,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:40:53,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:40:53,085 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:40:53,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-02-20 23:40:53,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:40:53,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:40:53,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:40:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:40:53,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:40:53,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-02-20 23:40:53,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {7180#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {7180#true} is VALID [2022-02-20 23:40:53,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {7180#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {7180#true} is VALID [2022-02-20 23:40:53,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {7180#true} assume !(~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32)); {7191#(and (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:53,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {7191#(and (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {7195#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:53,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {7195#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {7195#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:53,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {7195#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {7195#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:53,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {7195#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} havoc main_#t~nondet19#1; {7195#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:53,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {7195#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {7208#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~1#1|) (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:53,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {7208#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~1#1|) (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {7208#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~1#1|) (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:53,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {7208#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~1#1|) (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {7208#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~1#1|) (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:53,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {7208#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~1#1|) (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} havoc main_#t~nondet19#1; {7208#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~1#1|) (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:53,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {7208#(and (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~1#1|) (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {7221#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:53,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {7221#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {7221#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:53,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {7221#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {7221#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:53,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {7221#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} havoc main_#t~nondet19#1; {7221#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:53,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {7221#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {7234#(and (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~i~1#1| (_ bv3 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} is VALID [2022-02-20 23:40:53,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {7234#(and (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~i~1#1| (_ bv3 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (not (bvslt |ULTIMATE.start_main_~array_size~0#1| (_ bv1 32))))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {7238#(and (exists ((|ULTIMATE.start_main_~array_size~0#1| (_ BitVec 32))) (and (bvslt |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~i~1#1| (_ bv3 32)))} is VALID [2022-02-20 23:40:53,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {7238#(and (exists ((|ULTIMATE.start_main_~array_size~0#1| (_ BitVec 32))) (and (bvslt |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~i~1#1| (_ bv3 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1))), #length[main_~numbers~0#1.base]) && ~bvule32(~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), ~bvadd32(4bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1))))) && ~bvule32(0bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)))); {7181#false} is VALID [2022-02-20 23:40:53,508 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:53,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:40:54,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {7242#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1))), #length[main_~numbers~0#1.base]) && ~bvule32(~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), ~bvadd32(4bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1))))) && ~bvule32(0bv32, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)))); {7181#false} is VALID [2022-02-20 23:40:54,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {7246#(or (not (bvslt |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|))))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {7242#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)))} is VALID [2022-02-20 23:40:54,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {7250#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {7246#(or (not (bvslt |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|))))} is VALID [2022-02-20 23:40:54,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {7250#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} havoc main_#t~nondet19#1; {7250#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} is VALID [2022-02-20 23:40:54,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {7250#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {7250#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} is VALID [2022-02-20 23:40:54,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {7250#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {7250#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} is VALID [2022-02-20 23:40:55,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {7263#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {7250#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} is VALID [2022-02-20 23:40:55,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {7263#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} havoc main_#t~nondet19#1; {7263#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} is VALID [2022-02-20 23:40:55,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {7263#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {7263#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} is VALID [2022-02-20 23:40:55,259 INFO L290 TraceCheckUtils]: 8: Hoare triple {7263#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {7263#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} is VALID [2022-02-20 23:40:55,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {7276#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv3 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {7263#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32))) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32)) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} is VALID [2022-02-20 23:40:55,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {7276#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv3 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} havoc main_#t~nondet19#1; {7276#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv3 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} is VALID [2022-02-20 23:40:55,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {7276#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv3 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {7276#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv3 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} is VALID [2022-02-20 23:40:55,882 INFO L290 TraceCheckUtils]: 4: Hoare triple {7276#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv3 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {7276#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv3 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} is VALID [2022-02-20 23:40:55,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {7289#(or (not (bvslt (_ bv3 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {7276#(or (not (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv3 32)) |ULTIMATE.start_main_~array_size~0#1|)) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv12 32)) (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|)) (bvule (bvadd (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))))} is VALID [2022-02-20 23:40:55,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {7180#true} assume !(~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32)); {7289#(or (not (bvslt (_ bv3 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv16 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:40:55,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {7180#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {7180#true} is VALID [2022-02-20 23:40:55,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {7180#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {7180#true} is VALID [2022-02-20 23:40:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:40:55,885 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:40:55,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726313590] [2022-02-20 23:40:55,885 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726313590] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:40:55,885 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:40:55,885 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-02-20 23:40:55,885 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636732304] [2022-02-20 23:40:55,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:40:55,886 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 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) Word has length 18 [2022-02-20 23:40:55,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:40:55,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 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 23:40:57,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:40:57,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:40:57,730 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:40:57,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:40:57,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:40:57,731 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 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 23:41:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:05,614 INFO L93 Difference]: Finished difference Result 212 states and 238 transitions. [2022-02-20 23:41:05,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:41:05,614 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 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) Word has length 18 [2022-02-20 23:41:05,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:05,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 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 23:41:05,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 227 transitions. [2022-02-20 23:41:05,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 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 23:41:05,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 227 transitions. [2022-02-20 23:41:05,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 227 transitions. [2022-02-20 23:41:10,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 225 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:10,450 INFO L225 Difference]: With dead ends: 212 [2022-02-20 23:41:10,450 INFO L226 Difference]: Without dead ends: 212 [2022-02-20 23:41:10,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:41:10,450 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 406 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:10,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 623 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 467 Invalid, 0 Unknown, 9 Unchecked, 2.6s Time] [2022-02-20 23:41:10,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-02-20 23:41:10,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 106. [2022-02-20 23:41:10,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:10,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 106 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 105 states have internal predecessors, (123), 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 23:41:10,453 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 106 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 105 states have internal predecessors, (123), 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 23:41:10,453 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 106 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 105 states have internal predecessors, (123), 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 23:41:10,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:10,455 INFO L93 Difference]: Finished difference Result 212 states and 238 transitions. [2022-02-20 23:41:10,456 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 238 transitions. [2022-02-20 23:41:10,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:10,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:10,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 105 states have internal predecessors, (123), 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 212 states. [2022-02-20 23:41:10,456 INFO L87 Difference]: Start difference. First operand has 106 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 105 states have internal predecessors, (123), 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 212 states. [2022-02-20 23:41:10,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:10,459 INFO L93 Difference]: Finished difference Result 212 states and 238 transitions. [2022-02-20 23:41:10,461 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 238 transitions. [2022-02-20 23:41:10,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:10,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:10,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:10,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:10,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 105 states have internal predecessors, (123), 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 23:41:10,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2022-02-20 23:41:10,464 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 18 [2022-02-20 23:41:10,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:10,464 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2022-02-20 23:41:10,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 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 23:41:10,465 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2022-02-20 23:41:10,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:41:10,465 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:10,465 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] [2022-02-20 23:41:10,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-02-20 23:41:10,674 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:10,674 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:41:10,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:10,675 INFO L85 PathProgramCache]: Analyzing trace with hash -302012765, now seen corresponding path program 1 times [2022-02-20 23:41:10,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:10,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005319645] [2022-02-20 23:41:10,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:10,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:10,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:10,676 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:10,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-02-20 23:41:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:10,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:41:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:10,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:10,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {8056#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {8056#true} is VALID [2022-02-20 23:41:10,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {8056#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {8056#true} is VALID [2022-02-20 23:41:10,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {8056#true} assume ~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32);main_~array_size~0#1 := 1bv32; {8056#true} is VALID [2022-02-20 23:41:10,874 INFO L290 TraceCheckUtils]: 3: Hoare triple {8056#true} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {8056#true} is VALID [2022-02-20 23:41:10,874 INFO L290 TraceCheckUtils]: 4: Hoare triple {8056#true} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {8056#true} is VALID [2022-02-20 23:41:10,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {8056#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {8056#true} is VALID [2022-02-20 23:41:10,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {8056#true} havoc main_#t~nondet19#1; {8056#true} is VALID [2022-02-20 23:41:10,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {8056#true} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {8056#true} is VALID [2022-02-20 23:41:10,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {8056#true} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {8056#true} is VALID [2022-02-20 23:41:10,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {8056#true} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {8088#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:10,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {8088#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {8088#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:10,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {8088#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(1bv32, lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518 {8095#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)))} is VALID [2022-02-20 23:41:10,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {8095#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)))} SUMMARY for call write~intINTTYPE4(lis_~i~0#1, lis_~prev~0#1.base, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518-1 {8095#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)))} is VALID [2022-02-20 23:41:10,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {8095#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)))} lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := ~bvadd32(1bv32, lis_#t~post4#1);havoc lis_#t~post4#1; {8095#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)))} is VALID [2022-02-20 23:41:10,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {8095#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)))} assume !~bvslt32(lis_~i~0#1, lis_~N#1); {8095#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)))} is VALID [2022-02-20 23:41:10,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {8095#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)))} lis_~i~0#1 := 1bv32; {8095#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)))} is VALID [2022-02-20 23:41:10,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {8095#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)))} assume !~bvslt32(lis_~i~0#1, lis_~N#1); {8095#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)))} is VALID [2022-02-20 23:41:10,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {8095#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)))} lis_~i~0#1 := 0bv32; {8114#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:10,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {8114#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {8114#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:10,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {8114#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))), #length[lis_~best~0#1.base]) && ~bvule32(~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), ~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))))) && ~bvule32(0bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)))); {8057#false} is VALID [2022-02-20 23:41:10,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:41:10,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:41:11,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2022-02-20 23:41:11,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {8121#(and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))), #length[lis_~best~0#1.base]) && ~bvule32(~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), ~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))))) && ~bvule32(0bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)))); {8057#false} is VALID [2022-02-20 23:41:11,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {8121#(and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {8121#(and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)))} is VALID [2022-02-20 23:41:11,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {8128#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvule |ULTIMATE.start_lis_~best~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|)))} lis_~i~0#1 := 0bv32; {8121#(and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)))} is VALID [2022-02-20 23:41:11,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {8128#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvule |ULTIMATE.start_lis_~best~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|)))} assume !~bvslt32(lis_~i~0#1, lis_~N#1); {8128#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvule |ULTIMATE.start_lis_~best~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|)))} is VALID [2022-02-20 23:41:11,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {8128#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvule |ULTIMATE.start_lis_~best~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|)))} lis_~i~0#1 := 1bv32; {8128#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvule |ULTIMATE.start_lis_~best~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|)))} is VALID [2022-02-20 23:41:11,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {8128#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvule |ULTIMATE.start_lis_~best~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|)))} assume !~bvslt32(lis_~i~0#1, lis_~N#1); {8128#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvule |ULTIMATE.start_lis_~best~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|)))} is VALID [2022-02-20 23:41:11,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {8128#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvule |ULTIMATE.start_lis_~best~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|)))} lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := ~bvadd32(1bv32, lis_#t~post4#1);havoc lis_#t~post4#1; {8128#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvule |ULTIMATE.start_lis_~best~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|)))} is VALID [2022-02-20 23:41:11,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {8128#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvule |ULTIMATE.start_lis_~best~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|)))} SUMMARY for call write~intINTTYPE4(lis_~i~0#1, lis_~prev~0#1.base, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518-1 {8128#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvule |ULTIMATE.start_lis_~best~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|)))} is VALID [2022-02-20 23:41:11,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {8147#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|)) (bvule |ULTIMATE.start_lis_~best~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|)))} SUMMARY for call write~intINTTYPE4(1bv32, lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518 {8128#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvule |ULTIMATE.start_lis_~best~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|)))} is VALID [2022-02-20 23:41:11,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {8147#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|)) (bvule |ULTIMATE.start_lis_~best~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {8147#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|)) (bvule |ULTIMATE.start_lis_~best~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|)))} is VALID [2022-02-20 23:41:11,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {8056#true} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {8147#(and (bvule (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|)) (bvule |ULTIMATE.start_lis_~best~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_lis_~best~0#1.offset|)))} is VALID [2022-02-20 23:41:11,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {8056#true} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {8056#true} is VALID [2022-02-20 23:41:11,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {8056#true} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {8056#true} is VALID [2022-02-20 23:41:11,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {8056#true} havoc main_#t~nondet19#1; {8056#true} is VALID [2022-02-20 23:41:11,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {8056#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {8056#true} is VALID [2022-02-20 23:41:11,220 INFO L290 TraceCheckUtils]: 4: Hoare triple {8056#true} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {8056#true} is VALID [2022-02-20 23:41:11,220 INFO L290 TraceCheckUtils]: 3: Hoare triple {8056#true} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {8056#true} is VALID [2022-02-20 23:41:11,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {8056#true} assume ~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32);main_~array_size~0#1 := 1bv32; {8056#true} is VALID [2022-02-20 23:41:11,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {8056#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {8056#true} is VALID [2022-02-20 23:41:11,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {8056#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {8056#true} is VALID [2022-02-20 23:41:11,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:41:11,221 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:11,221 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005319645] [2022-02-20 23:41:11,221 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005319645] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:41:11,221 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:41:11,221 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-02-20 23:41:11,221 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360697595] [2022-02-20 23:41:11,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:41:11,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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 20 [2022-02-20 23:41:11,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:11,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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 23:41:11,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:11,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:41:11,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:11,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:41:11,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:41:11,346 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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 23:41:12,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:12,885 INFO L93 Difference]: Finished difference Result 163 states and 187 transitions. [2022-02-20 23:41:12,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:41:12,885 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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 20 [2022-02-20 23:41:12,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:12,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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 23:41:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2022-02-20 23:41:12,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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 23:41:12,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2022-02-20 23:41:12,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 137 transitions. [2022-02-20 23:41:13,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:13,109 INFO L225 Difference]: With dead ends: 163 [2022-02-20 23:41:13,109 INFO L226 Difference]: Without dead ends: 163 [2022-02-20 23:41:13,109 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:41:13,109 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 237 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:13,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 146 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:41:13,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-02-20 23:41:13,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2022-02-20 23:41:13,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:13,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 117 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 116 states have internal predecessors, (141), 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 23:41:13,112 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 117 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 116 states have internal predecessors, (141), 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 23:41:13,112 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 117 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 116 states have internal predecessors, (141), 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 23:41:13,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:13,114 INFO L93 Difference]: Finished difference Result 163 states and 187 transitions. [2022-02-20 23:41:13,114 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 187 transitions. [2022-02-20 23:41:13,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:13,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:13,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 116 states have internal predecessors, (141), 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 163 states. [2022-02-20 23:41:13,114 INFO L87 Difference]: Start difference. First operand has 117 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 116 states have internal predecessors, (141), 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 163 states. [2022-02-20 23:41:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:13,117 INFO L93 Difference]: Finished difference Result 163 states and 187 transitions. [2022-02-20 23:41:13,117 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 187 transitions. [2022-02-20 23:41:13,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:13,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:13,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:13,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 116 states have internal predecessors, (141), 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 23:41:13,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 141 transitions. [2022-02-20 23:41:13,119 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 141 transitions. Word has length 20 [2022-02-20 23:41:13,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:13,119 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 141 transitions. [2022-02-20 23:41:13,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 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 23:41:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 141 transitions. [2022-02-20 23:41:13,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:41:13,120 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:13,120 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:13,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-02-20 23:41:13,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:13,327 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:41:13,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:13,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1581646975, now seen corresponding path program 2 times [2022-02-20 23:41:13,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:13,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658289357] [2022-02-20 23:41:13,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:41:13,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:13,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:13,329 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:13,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-02-20 23:41:13,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:41:13,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:41:13,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:41:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:13,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:13,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:41:13,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2022-02-20 23:41:13,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-02-20 23:41:13,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {8790#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {8790#true} is VALID [2022-02-20 23:41:13,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {8790#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {8790#true} is VALID [2022-02-20 23:41:13,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {8790#true} assume !(~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32)); {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:13,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:13,584 INFO L290 TraceCheckUtils]: 4: Hoare triple {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:13,584 INFO L290 TraceCheckUtils]: 5: Hoare triple {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:13,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} havoc main_#t~nondet19#1; {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:13,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:13,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:13,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:13,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} havoc main_#t~nondet19#1; {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:13,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:13,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:13,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {8801#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {8835#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:13,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {8835#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {8835#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:13,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {8835#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(1bv32, lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518 {8835#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:13,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {8835#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(lis_~i~0#1, lis_~prev~0#1.base, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518-1 {8835#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:13,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {8835#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := ~bvadd32(1bv32, lis_#t~post4#1);havoc lis_#t~post4#1; {8848#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)))} is VALID [2022-02-20 23:41:13,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {8848#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {8852#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) (exists ((|ULTIMATE.start_lis_~N#1| (_ BitVec 32))) (and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|))))} is VALID [2022-02-20 23:41:13,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {8852#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) (exists ((|ULTIMATE.start_lis_~N#1| (_ BitVec 32))) (and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|))))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))), #length[lis_~best~0#1.base]) && ~bvule32(~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), ~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))))) && ~bvule32(0bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)))); {8791#false} is VALID [2022-02-20 23:41:13,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 23:41:13,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:41:13,938 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:41:14,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {8856#(and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))), #length[lis_~best~0#1.base]) && ~bvule32(~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), ~bvadd32(4bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))))) && ~bvule32(0bv32, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)))); {8791#false} is VALID [2022-02-20 23:41:14,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {8860#(or (not (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|)) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|))))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {8856#(and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)))} is VALID [2022-02-20 23:41:14,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {8864#(or (not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~best~0#1.offset|))))} lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := ~bvadd32(1bv32, lis_#t~post4#1);havoc lis_#t~post4#1; {8860#(or (not (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|)) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|))))} is VALID [2022-02-20 23:41:14,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {8864#(or (not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~best~0#1.offset|))))} SUMMARY for call write~intINTTYPE4(lis_~i~0#1, lis_~prev~0#1.base, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518-1 {8864#(or (not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~best~0#1.offset|))))} is VALID [2022-02-20 23:41:14,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {8864#(or (not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~best~0#1.offset|))))} SUMMARY for call write~intINTTYPE4(1bv32, lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518 {8864#(or (not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~best~0#1.offset|))))} is VALID [2022-02-20 23:41:14,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {8864#(or (not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~best~0#1.offset|))))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {8864#(or (not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~best~0#1.offset|))))} is VALID [2022-02-20 23:41:14,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {8864#(or (not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)) (and (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~best~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~best~0#1.base|)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~best~0#1.offset|))))} is VALID [2022-02-20 23:41:14,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:14,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:14,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} havoc main_#t~nondet19#1; {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:14,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:14,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:14,493 INFO L290 TraceCheckUtils]: 7: Hoare triple {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:14,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} havoc main_#t~nondet19#1; {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:14,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:14,494 INFO L290 TraceCheckUtils]: 4: Hoare triple {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:14,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:14,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {8790#true} assume !(~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32)); {8877#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:14,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {8790#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {8790#true} is VALID [2022-02-20 23:41:14,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {8790#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {8790#true} is VALID [2022-02-20 23:41:14,497 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 23:41:14,497 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:14,497 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658289357] [2022-02-20 23:41:14,497 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658289357] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:41:14,497 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:41:14,497 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-02-20 23:41:14,497 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703005453] [2022-02-20 23:41:14,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:41:14,498 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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 20 [2022-02-20 23:41:14,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:14,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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 23:41:14,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:14,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:41:14,950 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:14,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:41:14,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:41:14,951 INFO L87 Difference]: Start difference. First operand 117 states and 141 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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 23:41:21,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:21,422 INFO L93 Difference]: Finished difference Result 304 states and 371 transitions. [2022-02-20 23:41:21,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:41:21,422 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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 20 [2022-02-20 23:41:21,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:21,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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 23:41:21,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 261 transitions. [2022-02-20 23:41:21,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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 23:41:21,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 261 transitions. [2022-02-20 23:41:21,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 261 transitions. [2022-02-20 23:41:23,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:23,144 INFO L225 Difference]: With dead ends: 304 [2022-02-20 23:41:23,144 INFO L226 Difference]: Without dead ends: 304 [2022-02-20 23:41:23,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:41:23,145 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 513 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:23,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [513 Valid, 214 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 236 Invalid, 0 Unknown, 48 Unchecked, 2.4s Time] [2022-02-20 23:41:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-02-20 23:41:23,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 145. [2022-02-20 23:41:23,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:23,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 304 states. Second operand has 145 states, 131 states have (on average 1.366412213740458) internal successors, (179), 144 states have internal predecessors, (179), 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 23:41:23,148 INFO L74 IsIncluded]: Start isIncluded. First operand 304 states. Second operand has 145 states, 131 states have (on average 1.366412213740458) internal successors, (179), 144 states have internal predecessors, (179), 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 23:41:23,148 INFO L87 Difference]: Start difference. First operand 304 states. Second operand has 145 states, 131 states have (on average 1.366412213740458) internal successors, (179), 144 states have internal predecessors, (179), 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 23:41:23,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:23,152 INFO L93 Difference]: Finished difference Result 304 states and 371 transitions. [2022-02-20 23:41:23,152 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 371 transitions. [2022-02-20 23:41:23,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:23,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:23,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 131 states have (on average 1.366412213740458) internal successors, (179), 144 states have internal predecessors, (179), 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 304 states. [2022-02-20 23:41:23,153 INFO L87 Difference]: Start difference. First operand has 145 states, 131 states have (on average 1.366412213740458) internal successors, (179), 144 states have internal predecessors, (179), 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 304 states. [2022-02-20 23:41:23,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:23,156 INFO L93 Difference]: Finished difference Result 304 states and 371 transitions. [2022-02-20 23:41:23,156 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 371 transitions. [2022-02-20 23:41:23,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:23,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:23,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:23,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 131 states have (on average 1.366412213740458) internal successors, (179), 144 states have internal predecessors, (179), 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 23:41:23,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 179 transitions. [2022-02-20 23:41:23,161 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 179 transitions. Word has length 20 [2022-02-20 23:41:23,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:23,161 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 179 transitions. [2022-02-20 23:41:23,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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 23:41:23,162 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 179 transitions. [2022-02-20 23:41:23,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:41:23,164 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:23,164 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:23,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-02-20 23:41:23,370 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:23,371 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:41:23,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:23,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1786415948, now seen corresponding path program 1 times [2022-02-20 23:41:23,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:23,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482531802] [2022-02-20 23:41:23,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:23,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:23,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:23,373 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:23,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-02-20 23:41:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:23,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:41:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:23,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:23,513 INFO L356 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-02-20 23:41:23,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 17 [2022-02-20 23:41:23,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {9991#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {9991#true} is VALID [2022-02-20 23:41:23,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {9991#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {9991#true} is VALID [2022-02-20 23:41:23,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {9991#true} assume !(~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32)); {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:23,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:23,685 INFO L290 TraceCheckUtils]: 4: Hoare triple {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:23,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:23,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} havoc main_#t~nondet19#1; {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:23,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:23,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:23,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:23,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} havoc main_#t~nondet19#1; {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:23,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:23,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:23,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {10002#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {10036#(and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)) (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:23,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {10036#(and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)) (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {10040#(and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)) (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:23,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {10040#(and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)) (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(1bv32, lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518 {10040#(and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)) (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:23,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {10040#(and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)) (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(lis_~i~0#1, lis_~prev~0#1.base, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518-1 {10040#(and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)) (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:23,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {10040#(and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)) (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)) (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)))} lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := ~bvadd32(1bv32, lis_#t~post4#1);havoc lis_#t~post4#1; {10050#(and (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~N#1|) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv0 32)) (= (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)) (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:23,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {10050#(and (bvslt (bvadd (_ bv4294967295 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~N#1|) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv0 32)) (= (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)) (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {10054#(and (exists ((|ULTIMATE.start_lis_~N#1| (_ BitVec 32))) (and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)) (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv0 32)) (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:23,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {10054#(and (exists ((|ULTIMATE.start_lis_~N#1| (_ BitVec 32))) (and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)) (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv0 32)) (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(1bv32, lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518 {10054#(and (exists ((|ULTIMATE.start_lis_~N#1| (_ BitVec 32))) (and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)) (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv0 32)) (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:41:23,696 INFO L290 TraceCheckUtils]: 20: Hoare triple {10054#(and (exists ((|ULTIMATE.start_lis_~N#1| (_ BitVec 32))) (and (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)) (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv0 32)) (= |ULTIMATE.start_lis_~prev~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))), #length[lis_~prev~0#1.base]) && ~bvule32(~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), ~bvadd32(4bv32, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))))) && ~bvule32(0bv32, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)))); {9992#false} is VALID [2022-02-20 23:41:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 23:41:23,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:41:24,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {10061#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))), #length[lis_~prev~0#1.base]) && ~bvule32(~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), ~bvadd32(4bv32, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1))))) && ~bvule32(0bv32, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)))); {9992#false} is VALID [2022-02-20 23:41:24,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {10061#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|)))} SUMMARY for call write~intINTTYPE4(1bv32, lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518 {10061#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|)))} is VALID [2022-02-20 23:41:24,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {10068#(or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|))) (not (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {10061#(and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|)))} is VALID [2022-02-20 23:41:24,599 INFO L290 TraceCheckUtils]: 17: Hoare triple {10072#(or (not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~prev~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~prev~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|))))} lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := ~bvadd32(1bv32, lis_#t~post4#1);havoc lis_#t~post4#1; {10068#(or (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|) (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|))) (not (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|)))} is VALID [2022-02-20 23:41:24,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {10072#(or (not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~prev~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~prev~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|))))} SUMMARY for call write~intINTTYPE4(lis_~i~0#1, lis_~prev~0#1.base, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518-1 {10072#(or (not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~prev~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~prev~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|))))} is VALID [2022-02-20 23:41:24,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {10072#(or (not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~prev~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~prev~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|))))} SUMMARY for call write~intINTTYPE4(1bv32, lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518 {10072#(or (not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~prev~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~prev~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|))))} is VALID [2022-02-20 23:41:24,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {10082#(or (not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~prev~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~prev~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|))) (not (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {10072#(or (not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~prev~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~prev~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|))))} is VALID [2022-02-20 23:41:24,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {10082#(or (not (bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)) (and (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~prev~0#1.offset|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~prev~0#1.offset|)) (bvule (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv8 32) |ULTIMATE.start_lis_~prev~0#1.offset|) (select |#length| |ULTIMATE.start_lis_~prev~0#1.base|))) (not (bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|)))} is VALID [2022-02-20 23:41:24,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:24,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:24,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} havoc main_#t~nondet19#1; {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:24,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:24,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:24,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:24,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} havoc main_#t~nondet19#1; {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:24,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:24,606 INFO L290 TraceCheckUtils]: 4: Hoare triple {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:24,606 INFO L290 TraceCheckUtils]: 3: Hoare triple {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:24,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {9991#true} assume !(~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32)); {10086#(or (not (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:24,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {9991#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {9991#true} is VALID [2022-02-20 23:41:24,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {9991#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {9991#true} is VALID [2022-02-20 23:41:24,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 23:41:24,607 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:24,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482531802] [2022-02-20 23:41:24,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482531802] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:41:24,607 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:41:24,607 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-02-20 23:41:24,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323629320] [2022-02-20 23:41:24,608 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:41:24,608 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 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 23:41:24,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:24,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 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 23:41:24,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:24,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:41:24,971 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:24,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:41:24,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:41:24,971 INFO L87 Difference]: Start difference. First operand 145 states and 179 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 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 23:41:27,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:27,808 INFO L93 Difference]: Finished difference Result 159 states and 194 transitions. [2022-02-20 23:41:27,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:41:27,809 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 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 23:41:27,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:27,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 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 23:41:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 113 transitions. [2022-02-20 23:41:27,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 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 23:41:27,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 113 transitions. [2022-02-20 23:41:27,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 113 transitions. [2022-02-20 23:41:28,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:28,281 INFO L225 Difference]: With dead ends: 159 [2022-02-20 23:41:28,281 INFO L226 Difference]: Without dead ends: 159 [2022-02-20 23:41:28,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:41:28,281 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 90 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:28,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 262 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 207 Invalid, 0 Unknown, 67 Unchecked, 0.8s Time] [2022-02-20 23:41:28,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-02-20 23:41:28,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2022-02-20 23:41:28,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:28,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 146 states, 132 states have (on average 1.3484848484848484) internal successors, (178), 145 states have internal predecessors, (178), 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 23:41:28,284 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 146 states, 132 states have (on average 1.3484848484848484) internal successors, (178), 145 states have internal predecessors, (178), 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 23:41:28,284 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 146 states, 132 states have (on average 1.3484848484848484) internal successors, (178), 145 states have internal predecessors, (178), 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 23:41:28,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:28,286 INFO L93 Difference]: Finished difference Result 159 states and 194 transitions. [2022-02-20 23:41:28,286 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 194 transitions. [2022-02-20 23:41:28,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:28,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:28,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 132 states have (on average 1.3484848484848484) internal successors, (178), 145 states have internal predecessors, (178), 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 159 states. [2022-02-20 23:41:28,287 INFO L87 Difference]: Start difference. First operand has 146 states, 132 states have (on average 1.3484848484848484) internal successors, (178), 145 states have internal predecessors, (178), 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 159 states. [2022-02-20 23:41:28,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:28,288 INFO L93 Difference]: Finished difference Result 159 states and 194 transitions. [2022-02-20 23:41:28,288 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 194 transitions. [2022-02-20 23:41:28,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:28,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:28,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:28,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:28,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 132 states have (on average 1.3484848484848484) internal successors, (178), 145 states have internal predecessors, (178), 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 23:41:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 178 transitions. [2022-02-20 23:41:28,290 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 178 transitions. Word has length 21 [2022-02-20 23:41:28,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:28,291 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 178 transitions. [2022-02-20 23:41:28,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 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 23:41:28,291 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 178 transitions. [2022-02-20 23:41:28,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:41:28,291 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:28,291 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:41:28,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-02-20 23:41:28,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:28,498 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:41:28,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:28,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1242696241, now seen corresponding path program 1 times [2022-02-20 23:41:28,499 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:28,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664235375] [2022-02-20 23:41:28,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:28,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:28,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:28,500 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:28,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-02-20 23:41:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:28,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 23:41:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:28,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:28,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2022-02-20 23:41:28,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-02-20 23:41:28,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {10762#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {10762#true} is VALID [2022-02-20 23:41:28,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {10762#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {10762#true} is VALID [2022-02-20 23:41:28,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {10762#true} assume !(~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32)); {10773#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} is VALID [2022-02-20 23:41:28,894 INFO L290 TraceCheckUtils]: 3: Hoare triple {10773#(not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32)))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {10777#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))} is VALID [2022-02-20 23:41:28,894 INFO L290 TraceCheckUtils]: 4: Hoare triple {10777#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {10777#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))} is VALID [2022-02-20 23:41:28,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {10777#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {10777#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))} is VALID [2022-02-20 23:41:28,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {10777#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))} havoc main_#t~nondet19#1; {10777#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))} is VALID [2022-02-20 23:41:28,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {10777#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv0 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {10790#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))} is VALID [2022-02-20 23:41:28,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {10790#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {10790#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))} is VALID [2022-02-20 23:41:28,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {10790#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) (= |ULTIMATE.start_main_~numbers~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {10797#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|)) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))} is VALID [2022-02-20 23:41:28,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {10797#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|)) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))} havoc main_#t~nondet19#1; {10797#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|)) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))} is VALID [2022-02-20 23:41:28,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {10797#(and (= |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|)) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {10804#(and (bvule (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~1#1|) (_ bv1 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))} is VALID [2022-02-20 23:41:28,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {10804#(and (bvule (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~i~1#1|) (_ bv1 32)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))))} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {10808#(and (not (bvslt (_ bv2 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} is VALID [2022-02-20 23:41:28,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {10808#(and (not (bvslt (_ bv2 32) |ULTIMATE.start_main_~array_size~0#1|)) (not (bvuge |ULTIMATE.start_main_~array_size~0#1| (_ bv536870911 32))) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|)))} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {10812#(and (not (bvslt (_ bv2 32) |ULTIMATE.start_lis_~N#1|)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)))} is VALID [2022-02-20 23:41:28,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {10812#(and (not (bvslt (_ bv2 32) |ULTIMATE.start_lis_~N#1|)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {10812#(and (not (bvslt (_ bv2 32) |ULTIMATE.start_lis_~N#1|)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)))} is VALID [2022-02-20 23:41:28,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {10812#(and (not (bvslt (_ bv2 32) |ULTIMATE.start_lis_~N#1|)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)))} SUMMARY for call write~intINTTYPE4(1bv32, lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518 {10812#(and (not (bvslt (_ bv2 32) |ULTIMATE.start_lis_~N#1|)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)))} is VALID [2022-02-20 23:41:28,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {10812#(and (not (bvslt (_ bv2 32) |ULTIMATE.start_lis_~N#1|)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)))} SUMMARY for call write~intINTTYPE4(lis_~i~0#1, lis_~prev~0#1.base, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518-1 {10812#(and (not (bvslt (_ bv2 32) |ULTIMATE.start_lis_~N#1|)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)))} is VALID [2022-02-20 23:41:28,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {10812#(and (not (bvslt (_ bv2 32) |ULTIMATE.start_lis_~N#1|)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)))} lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := ~bvadd32(1bv32, lis_#t~post4#1);havoc lis_#t~post4#1; {10825#(and (not (bvslt (_ bv2 32) |ULTIMATE.start_lis_~N#1|)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv0 32)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)))} is VALID [2022-02-20 23:41:28,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {10825#(and (not (bvslt (_ bv2 32) |ULTIMATE.start_lis_~N#1|)) (not (bvuge |ULTIMATE.start_lis_~N#1| (_ bv536870911 32))) (= (bvadd (_ bv4294967295 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv0 32)) (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_lis_~N#1|)))} assume !~bvslt32(lis_~i~0#1, lis_~N#1); {10763#false} is VALID [2022-02-20 23:41:28,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {10763#false} lis_~i~0#1 := 1bv32; {10763#false} is VALID [2022-02-20 23:41:28,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {10763#false} assume !!~bvslt32(lis_~i~0#1, lis_~N#1);lis_~j~0#1 := 0bv32; {10763#false} is VALID [2022-02-20 23:41:28,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {10763#false} assume !!~bvslt32(lis_~j~0#1, lis_~i~0#1); {10763#false} is VALID [2022-02-20 23:41:28,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {10763#false} assume !(1bv1 == #valid[lis_~a#1.base]); {10763#false} is VALID [2022-02-20 23:41:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:41:28,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:41:29,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {10763#false} assume !(1bv1 == #valid[lis_~a#1.base]); {10763#false} is VALID [2022-02-20 23:41:29,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {10763#false} assume !!~bvslt32(lis_~j~0#1, lis_~i~0#1); {10763#false} is VALID [2022-02-20 23:41:29,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {10763#false} assume !!~bvslt32(lis_~i~0#1, lis_~N#1);lis_~j~0#1 := 0bv32; {10763#false} is VALID [2022-02-20 23:41:29,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {10763#false} lis_~i~0#1 := 1bv32; {10763#false} is VALID [2022-02-20 23:41:29,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {10853#(bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|)} assume !~bvslt32(lis_~i~0#1, lis_~N#1); {10763#false} is VALID [2022-02-20 23:41:29,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {10857#(bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)} lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := ~bvadd32(1bv32, lis_#t~post4#1);havoc lis_#t~post4#1; {10853#(bvslt |ULTIMATE.start_lis_~i~0#1| |ULTIMATE.start_lis_~N#1|)} is VALID [2022-02-20 23:41:29,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {10857#(bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)} SUMMARY for call write~intINTTYPE4(lis_~i~0#1, lis_~prev~0#1.base, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518-1 {10857#(bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)} is VALID [2022-02-20 23:41:29,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {10857#(bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)} SUMMARY for call write~intINTTYPE4(1bv32, lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518 {10857#(bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)} is VALID [2022-02-20 23:41:29,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {10857#(bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {10857#(bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)} is VALID [2022-02-20 23:41:29,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {10870#(bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {10857#(bvslt (bvadd |ULTIMATE.start_lis_~i~0#1| (_ bv1 32)) |ULTIMATE.start_lis_~N#1|)} is VALID [2022-02-20 23:41:29,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {10874#(or (bvslt |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|) (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {10870#(bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|)} is VALID [2022-02-20 23:41:29,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {10878#(or (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {10874#(or (bvslt |ULTIMATE.start_main_~i~1#1| |ULTIMATE.start_main_~array_size~0#1|) (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:41:29,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {10878#(or (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} havoc main_#t~nondet19#1; {10878#(or (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:41:29,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {10885#(or (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {10878#(or (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:41:29,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {10885#(or (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {10885#(or (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:41:29,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {10892#(or (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) |ULTIMATE.start_main_~array_size~0#1|) (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {10885#(or (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|) (not (bvule (bvadd (_ bv4 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv1 32)) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:41:29,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {10892#(or (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) |ULTIMATE.start_main_~array_size~0#1|) (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} havoc main_#t~nondet19#1; {10892#(or (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) |ULTIMATE.start_main_~array_size~0#1|) (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:41:29,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {10892#(or (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) |ULTIMATE.start_main_~array_size~0#1|) (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {10892#(or (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) |ULTIMATE.start_main_~array_size~0#1|) (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:41:29,786 INFO L290 TraceCheckUtils]: 4: Hoare triple {10892#(or (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) |ULTIMATE.start_main_~array_size~0#1|) (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {10892#(or (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) |ULTIMATE.start_main_~array_size~0#1|) (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:41:29,788 INFO L290 TraceCheckUtils]: 3: Hoare triple {10905#(or (not (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|))) (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {10892#(or (not (bvule (bvadd (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~i~1#1|) |ULTIMATE.start_main_~numbers~0#1.offset|) (select |#length| |ULTIMATE.start_main_~numbers~0#1.base|))) (bvslt (bvadd |ULTIMATE.start_main_~i~1#1| (_ bv2 32)) |ULTIMATE.start_main_~array_size~0#1|) (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:41:29,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {10762#true} assume !(~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32)); {10905#(or (not (bvule (_ bv8 32) (bvmul (_ bv4 32) |ULTIMATE.start_main_~array_size~0#1|))) (bvslt (_ bv1 32) |ULTIMATE.start_main_~array_size~0#1|))} is VALID [2022-02-20 23:41:29,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {10762#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {10762#true} is VALID [2022-02-20 23:41:29,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {10762#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {10762#true} is VALID [2022-02-20 23:41:29,789 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:41:29,789 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:29,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664235375] [2022-02-20 23:41:29,789 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664235375] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:41:29,789 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:41:29,789 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-02-20 23:41:29,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373252565] [2022-02-20 23:41:29,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:41:29,789 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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 23 [2022-02-20 23:41:29,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:29,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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 23:41:30,352 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 23:41:30,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 23:41:30,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:30,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 23:41:30,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:41:30,353 INFO L87 Difference]: Start difference. First operand 146 states and 178 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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 23:41:33,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:33,731 INFO L93 Difference]: Finished difference Result 197 states and 237 transitions. [2022-02-20 23:41:33,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:41:33,731 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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 23 [2022-02-20 23:41:33,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:41:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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 23:41:33,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 162 transitions. [2022-02-20 23:41:33,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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 23:41:33,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 162 transitions. [2022-02-20 23:41:33,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 162 transitions. [2022-02-20 23:41:34,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:34,004 INFO L225 Difference]: With dead ends: 197 [2022-02-20 23:41:34,004 INFO L226 Difference]: Without dead ends: 197 [2022-02-20 23:41:34,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2022-02-20 23:41:34,005 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 548 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:41:34,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 324 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 23:41:34,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-02-20 23:41:34,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 125. [2022-02-20 23:41:34,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:41:34,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 125 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 124 states have internal predecessors, (150), 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 23:41:34,007 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 125 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 124 states have internal predecessors, (150), 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 23:41:34,008 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 125 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 124 states have internal predecessors, (150), 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 23:41:34,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:34,010 INFO L93 Difference]: Finished difference Result 197 states and 237 transitions. [2022-02-20 23:41:34,010 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 237 transitions. [2022-02-20 23:41:34,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:34,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:34,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 124 states have internal predecessors, (150), 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 197 states. [2022-02-20 23:41:34,011 INFO L87 Difference]: Start difference. First operand has 125 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 124 states have internal predecessors, (150), 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 197 states. [2022-02-20 23:41:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:41:34,013 INFO L93 Difference]: Finished difference Result 197 states and 237 transitions. [2022-02-20 23:41:34,013 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 237 transitions. [2022-02-20 23:41:34,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:41:34,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:41:34,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:41:34,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:41:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 124 states have internal predecessors, (150), 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 23:41:34,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 150 transitions. [2022-02-20 23:41:34,015 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 150 transitions. Word has length 23 [2022-02-20 23:41:34,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:41:34,015 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 150 transitions. [2022-02-20 23:41:34,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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 23:41:34,016 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 150 transitions. [2022-02-20 23:41:34,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:41:34,016 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:41:34,016 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] [2022-02-20 23:41:34,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-02-20 23:41:34,222 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:41:34,223 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 21 more)] === [2022-02-20 23:41:34,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:41:34,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1547664583, now seen corresponding path program 1 times [2022-02-20 23:41:34,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:41:34,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280520775] [2022-02-20 23:41:34,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:41:34,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:41:34,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:41:34,224 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:41:34,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-02-20 23:41:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:34,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 23:41:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:41:34,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:41:34,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-02-20 23:41:34,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:41:34,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:41:34,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:41:34,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:41:34,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:41:34,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:41:34,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:41:34,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:41:34,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:41:34,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:41:34,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:41:34,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2022-02-20 23:41:34,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2022-02-20 23:41:34,617 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:41:34,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 26 [2022-02-20 23:41:34,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {11650#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {11650#true} is VALID [2022-02-20 23:41:34,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {11650#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {11650#true} is VALID [2022-02-20 23:41:34,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {11650#true} assume ~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32);main_~array_size~0#1 := 1bv32; {11650#true} is VALID [2022-02-20 23:41:34,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {11650#true} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {11650#true} is VALID [2022-02-20 23:41:34,638 INFO L290 TraceCheckUtils]: 4: Hoare triple {11650#true} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {11650#true} is VALID [2022-02-20 23:41:34,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {11650#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {11650#true} is VALID [2022-02-20 23:41:34,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {11650#true} havoc main_#t~nondet19#1; {11650#true} is VALID [2022-02-20 23:41:34,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {11650#true} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {11650#true} is VALID [2022-02-20 23:41:34,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {11650#true} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {11650#true} is VALID [2022-02-20 23:41:34,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {11650#true} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {11682#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_lis_~best~0#1.base| |ULTIMATE.start_lis_~prev~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:34,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {11682#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_lis_~best~0#1.base| |ULTIMATE.start_lis_~prev~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {11682#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_lis_~best~0#1.base| |ULTIMATE.start_lis_~prev~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:34,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {11682#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_lis_~best~0#1.base| |ULTIMATE.start_lis_~prev~0#1.base|)) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(1bv32, lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518 {11689#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|) ((_ extract 7 0) (_ bv1 32))) (not (= |ULTIMATE.start_lis_~best~0#1.base| |ULTIMATE.start_lis_~prev~0#1.base|)) (= ((_ extract 31 24) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:34,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {11689#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|) ((_ extract 7 0) (_ bv1 32))) (not (= |ULTIMATE.start_lis_~best~0#1.base| |ULTIMATE.start_lis_~prev~0#1.base|)) (= ((_ extract 31 24) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(lis_~i~0#1, lis_~prev~0#1.base, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518-1 {11693#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 31 24) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:34,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {11693#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 31 24) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := ~bvadd32(1bv32, lis_#t~post4#1);havoc lis_#t~post4#1; {11693#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 31 24) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:34,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {11693#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 31 24) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} assume !~bvslt32(lis_~i~0#1, lis_~N#1); {11693#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 31 24) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:34,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {11693#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 31 24) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} lis_~i~0#1 := 1bv32; {11693#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 31 24) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:34,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {11693#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 31 24) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} assume !~bvslt32(lis_~i~0#1, lis_~N#1); {11693#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 31 24) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:34,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {11693#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 31 24) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} lis_~i~0#1 := 0bv32; {11709#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 31 24) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:34,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {11709#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 31 24) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {11709#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 31 24) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:34,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {11709#(and (= |ULTIMATE.start_lis_~best~0#1.offset| (_ bv0 32)) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|)) ((_ extract 23 16) (_ bv1 32))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|) ((_ extract 7 0) (_ bv1 32))) (= ((_ extract 31 24) (_ bv1 32)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (= (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) (= |ULTIMATE.start_lis_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} SUMMARY for call lis_#t~mem14#1 := read~intINTTYPE4(lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L524 {11716#(and (= (concat (concat (concat ((_ extract 31 24) (_ bv1 32)) ((_ extract 23 16) (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) ((_ extract 7 0) (_ bv1 32))) |ULTIMATE.start_lis_#t~mem14#1|) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} is VALID [2022-02-20 23:41:34,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {11716#(and (= (concat (concat (concat ((_ extract 31 24) (_ bv1 32)) ((_ extract 23 16) (_ bv1 32))) ((_ extract 15 8) (_ bv1 32))) ((_ extract 7 0) (_ bv1 32))) |ULTIMATE.start_lis_#t~mem14#1|) (= |ULTIMATE.start_lis_~max~0#1| (_ bv0 32)))} assume !~bvslt32(lis_~max~0#1, lis_#t~mem14#1);havoc lis_#t~mem14#1; {11651#false} is VALID [2022-02-20 23:41:34,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {11651#false} lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := ~bvadd32(1bv32, lis_#t~post13#1);havoc lis_#t~post13#1; {11651#false} is VALID [2022-02-20 23:41:34,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {11651#false} assume !~bvslt32(lis_~i~0#1, lis_~N#1); {11651#false} is VALID [2022-02-20 23:41:34,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {11651#false} lis_#res#1 := lis_~max~0#1;call ULTIMATE.dealloc(lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset);havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call ULTIMATE.dealloc(lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset);havoc lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset; {11651#false} is VALID [2022-02-20 23:41:34,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {11651#false} main_#t~ret20#1 := lis_#res#1;assume { :end_inline_lis } true;main_#res#1 := main_#t~ret20#1;havoc main_#t~ret20#1;call ULTIMATE.dealloc(main_#t~malloc17#1.base, main_#t~malloc17#1.offset);havoc main_#t~malloc17#1.base, main_#t~malloc17#1.offset; {11651#false} is VALID [2022-02-20 23:41:34,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {11651#false} assume !(#valid == main_old_#valid#1); {11651#false} is VALID [2022-02-20 23:41:34,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:41:34,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:41:34,773 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |c_ULTIMATE.start_lis_~max~0#1| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_365) |c_ULTIMATE.start_lis_~best~0#1.base|))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|))))) is different from false [2022-02-20 23:41:34,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:41:34,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:41:34,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:41:34,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:41:34,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:41:34,853 INFO L356 Elim1Store]: treesize reduction 303, result has 14.6 percent of original size [2022-02-20 23:41:34,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 203 treesize of output 95 [2022-02-20 23:41:34,977 INFO L356 Elim1Store]: treesize reduction 359, result has 10.3 percent of original size [2022-02-20 23:41:34,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 115 treesize of output 98 [2022-02-20 23:41:34,987 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-02-20 23:41:34,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 13 [2022-02-20 23:41:35,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {11651#false} assume !(#valid == main_old_#valid#1); {11651#false} is VALID [2022-02-20 23:41:35,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {11651#false} main_#t~ret20#1 := lis_#res#1;assume { :end_inline_lis } true;main_#res#1 := main_#t~ret20#1;havoc main_#t~ret20#1;call ULTIMATE.dealloc(main_#t~malloc17#1.base, main_#t~malloc17#1.offset);havoc main_#t~malloc17#1.base, main_#t~malloc17#1.offset; {11651#false} is VALID [2022-02-20 23:41:35,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {11651#false} lis_#res#1 := lis_~max~0#1;call ULTIMATE.dealloc(lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset);havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call ULTIMATE.dealloc(lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset);havoc lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset; {11651#false} is VALID [2022-02-20 23:41:35,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {11651#false} assume !~bvslt32(lis_~i~0#1, lis_~N#1); {11651#false} is VALID [2022-02-20 23:41:35,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {11651#false} lis_#t~post13#1 := lis_~i~0#1;lis_~i~0#1 := ~bvadd32(1bv32, lis_#t~post13#1);havoc lis_#t~post13#1; {11651#false} is VALID [2022-02-20 23:41:35,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {11750#(bvslt |ULTIMATE.start_lis_~max~0#1| |ULTIMATE.start_lis_#t~mem14#1|)} assume !~bvslt32(lis_~max~0#1, lis_#t~mem14#1);havoc lis_#t~mem14#1; {11651#false} is VALID [2022-02-20 23:41:35,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {11754#(bvslt |ULTIMATE.start_lis_~max~0#1| (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|))))} SUMMARY for call lis_#t~mem14#1 := read~intINTTYPE4(lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L524 {11750#(bvslt |ULTIMATE.start_lis_~max~0#1| |ULTIMATE.start_lis_#t~mem14#1|)} is VALID [2022-02-20 23:41:35,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {11754#(bvslt |ULTIMATE.start_lis_~max~0#1| (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|))))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {11754#(bvslt |ULTIMATE.start_lis_~max~0#1| (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|))))} is VALID [2022-02-20 23:41:35,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {11761#(bvslt |ULTIMATE.start_lis_~max~0#1| (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|)))} lis_~i~0#1 := 0bv32; {11754#(bvslt |ULTIMATE.start_lis_~max~0#1| (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) |ULTIMATE.start_lis_~best~0#1.offset|))))} is VALID [2022-02-20 23:41:35,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {11761#(bvslt |ULTIMATE.start_lis_~max~0#1| (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|)))} assume !~bvslt32(lis_~i~0#1, lis_~N#1); {11761#(bvslt |ULTIMATE.start_lis_~max~0#1| (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|)))} is VALID [2022-02-20 23:41:35,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {11761#(bvslt |ULTIMATE.start_lis_~max~0#1| (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|)))} lis_~i~0#1 := 1bv32; {11761#(bvslt |ULTIMATE.start_lis_~max~0#1| (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|)))} is VALID [2022-02-20 23:41:35,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {11761#(bvslt |ULTIMATE.start_lis_~max~0#1| (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|)))} assume !~bvslt32(lis_~i~0#1, lis_~N#1); {11761#(bvslt |ULTIMATE.start_lis_~max~0#1| (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|)))} is VALID [2022-02-20 23:41:35,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {11761#(bvslt |ULTIMATE.start_lis_~max~0#1| (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|)))} lis_#t~post4#1 := lis_~i~0#1;lis_~i~0#1 := ~bvadd32(1bv32, lis_#t~post4#1);havoc lis_#t~post4#1; {11761#(bvslt |ULTIMATE.start_lis_~max~0#1| (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|)))} is VALID [2022-02-20 23:41:35,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {11777#(forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |ULTIMATE.start_lis_~max~0#1| (concat (concat (concat (select (select (store |#memory_int| |ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_365) |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|)) (select (select (store |#memory_int| |ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_365) |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (select (select (store |#memory_int| |ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_365) |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select (select (store |#memory_int| |ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_365) |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|))))} SUMMARY for call write~intINTTYPE4(lis_~i~0#1, lis_~prev~0#1.base, ~bvadd32(lis_~prev~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518-1 {11761#(bvslt |ULTIMATE.start_lis_~max~0#1| (concat (concat (concat (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select (select |#memory_int| |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|)))} is VALID [2022-02-20 23:41:35,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {11781#(forall ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8))) (or (and (not (= (_ bv1 8) v_arrayElimCell_15)) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv0 32))) (and (not (= v_arrayElimCell_14 (_ bv0 8))) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv0 32))) (and (not (= |ULTIMATE.start_lis_~best~0#1.base| |ULTIMATE.start_lis_~prev~0#1.base|)) (bvslt |ULTIMATE.start_lis_~max~0#1| (concat (concat (concat v_arrayElimCell_14 (_ bv0 8)) (_ bv0 8)) v_arrayElimCell_15)))))} SUMMARY for call write~intINTTYPE4(1bv32, lis_~best~0#1.base, ~bvadd32(lis_~best~0#1.offset, ~bvmul32(4bv32, lis_~i~0#1)), 4bv32); srcloc: L518 {11777#(forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |ULTIMATE.start_lis_~max~0#1| (concat (concat (concat (select (select (store |#memory_int| |ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_365) |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv3 32) |ULTIMATE.start_lis_~best~0#1.offset|)) (select (select (store |#memory_int| |ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_365) |ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv2 32) |ULTIMATE.start_lis_~best~0#1.offset|))) (select (select (store |#memory_int| |ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_365) |ULTIMATE.start_lis_~best~0#1.base|) (bvadd |ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select (select (store |#memory_int| |ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_365) |ULTIMATE.start_lis_~best~0#1.base|) |ULTIMATE.start_lis_~best~0#1.offset|))))} is VALID [2022-02-20 23:41:35,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {11781#(forall ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8))) (or (and (not (= (_ bv1 8) v_arrayElimCell_15)) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv0 32))) (and (not (= v_arrayElimCell_14 (_ bv0 8))) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv0 32))) (and (not (= |ULTIMATE.start_lis_~best~0#1.base| |ULTIMATE.start_lis_~prev~0#1.base|)) (bvslt |ULTIMATE.start_lis_~max~0#1| (concat (concat (concat v_arrayElimCell_14 (_ bv0 8)) (_ bv0 8)) v_arrayElimCell_15)))))} assume !!~bvslt32(lis_~i~0#1, lis_~N#1); {11781#(forall ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8))) (or (and (not (= (_ bv1 8) v_arrayElimCell_15)) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv0 32))) (and (not (= v_arrayElimCell_14 (_ bv0 8))) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv0 32))) (and (not (= |ULTIMATE.start_lis_~best~0#1.base| |ULTIMATE.start_lis_~prev~0#1.base|)) (bvslt |ULTIMATE.start_lis_~max~0#1| (concat (concat (concat v_arrayElimCell_14 (_ bv0 8)) (_ bv0 8)) v_arrayElimCell_15)))))} is VALID [2022-02-20 23:41:35,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {11650#true} assume { :begin_inline_lis } true;lis_#in~a#1.base, lis_#in~a#1.offset, lis_#in~N#1 := main_~numbers~0#1.base, main_~numbers~0#1.offset, main_~array_size~0#1;havoc lis_#res#1;havoc lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset, lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset, lis_#t~post4#1, lis_#t~mem7#1, lis_#t~mem8#1, lis_#t~mem10#1, lis_#t~mem9#1, lis_#t~short11#1, lis_#t~mem12#1, lis_#t~post6#1, lis_#t~post5#1, lis_#t~mem14#1, lis_#t~mem15#1, lis_#t~post13#1, lis_~a#1.base, lis_~a#1.offset, lis_~N#1, lis_~best~0#1.base, lis_~best~0#1.offset, lis_~prev~0#1.base, lis_~prev~0#1.offset, lis_~i~0#1, lis_~j~0#1, lis_~max~0#1;lis_~a#1.base, lis_~a#1.offset := lis_#in~a#1.base, lis_#in~a#1.offset;lis_~N#1 := lis_#in~N#1;havoc lis_~best~0#1.base, lis_~best~0#1.offset;havoc lis_~prev~0#1.base, lis_~prev~0#1.offset;havoc lis_~i~0#1;havoc lis_~j~0#1;lis_~max~0#1 := 0bv32;call lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~best~0#1.base, lis_~best~0#1.offset := lis_#t~malloc2#1.base, lis_#t~malloc2#1.offset;call lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, lis_~N#1));lis_~prev~0#1.base, lis_~prev~0#1.offset := lis_#t~malloc3#1.base, lis_#t~malloc3#1.offset;lis_~i~0#1 := 0bv32; {11781#(forall ((v_arrayElimCell_14 (_ BitVec 8)) (v_arrayElimCell_15 (_ BitVec 8))) (or (and (not (= (_ bv1 8) v_arrayElimCell_15)) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv0 32))) (and (not (= v_arrayElimCell_14 (_ bv0 8))) (= (bvmul (_ bv4 32) |ULTIMATE.start_lis_~i~0#1|) (_ bv0 32))) (and (not (= |ULTIMATE.start_lis_~best~0#1.base| |ULTIMATE.start_lis_~prev~0#1.base|)) (bvslt |ULTIMATE.start_lis_~max~0#1| (concat (concat (concat v_arrayElimCell_14 (_ bv0 8)) (_ bv0 8)) v_arrayElimCell_15)))))} is VALID [2022-02-20 23:41:35,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {11650#true} assume !~bvslt32(main_~i~1#1, main_~array_size~0#1); {11650#true} is VALID [2022-02-20 23:41:35,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {11650#true} main_#t~post18#1 := main_~i~1#1;main_~i~1#1 := ~bvadd32(1bv32, main_#t~post18#1);havoc main_#t~post18#1; {11650#true} is VALID [2022-02-20 23:41:35,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {11650#true} havoc main_#t~nondet19#1; {11650#true} is VALID [2022-02-20 23:41:35,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {11650#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet19#1, main_~numbers~0#1.base, ~bvadd32(main_~numbers~0#1.offset, ~bvmul32(4bv32, main_~i~1#1)), 4bv32); srcloc: L537 {11650#true} is VALID [2022-02-20 23:41:35,477 INFO L290 TraceCheckUtils]: 4: Hoare triple {11650#true} assume !!~bvslt32(main_~i~1#1, main_~array_size~0#1); {11650#true} is VALID [2022-02-20 23:41:35,477 INFO L290 TraceCheckUtils]: 3: Hoare triple {11650#true} call main_#t~malloc17#1.base, main_#t~malloc17#1.offset := #Ultimate.allocOnStack(~bvmul32(4bv32, main_~array_size~0#1));main_~numbers~0#1.base, main_~numbers~0#1.offset := main_#t~malloc17#1.base, main_#t~malloc17#1.offset;main_~i~1#1 := 0bv32; {11650#true} is VALID [2022-02-20 23:41:35,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {11650#true} assume ~bvslt32(main_~array_size~0#1, 1bv32) || ~bvuge32(main_~array_size~0#1, 536870911bv32);main_~array_size~0#1 := 1bv32; {11650#true} is VALID [2022-02-20 23:41:35,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {11650#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~nondet19#1, main_#t~post18#1, main_~i~1#1, main_#t~ret20#1, main_~array_size~0#1, main_~numbers~0#1.base, main_~numbers~0#1.offset;main_~array_size~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; {11650#true} is VALID [2022-02-20 23:41:35,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {11650#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {11650#true} is VALID [2022-02-20 23:41:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:41:35,478 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:41:35,478 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280520775] [2022-02-20 23:41:35,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280520775] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:41:35,478 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:41:35,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-02-20 23:41:35,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850788736] [2022-02-20 23:41:35,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:41:35,478 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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 26 [2022-02-20 23:41:35,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:41:35,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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 23:41:36,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:41:36,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:41:36,913 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:41:36,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:41:36,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2022-02-20 23:41:36,914 INFO L87 Difference]: Start difference. First operand 125 states and 150 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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)