./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0019_1-2.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/list-ext-properties/test-0019_1-2.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 ef47df31d033e531a0040913ad039c21826bf787c77c5128ceae3ef436a47b49 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:48:19,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:48:19,782 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:48:19,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:48:19,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:48:19,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:48:19,803 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:48:19,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:48:19,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:48:19,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:48:19,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:48:19,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:48:19,808 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:48:19,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:48:19,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:48:19,810 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:48:19,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:48:19,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:48:19,812 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:48:19,813 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:48:19,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:48:19,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:48:19,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:48:19,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:48:19,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:48:19,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:48:19,818 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:48:19,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:48:19,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:48:19,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:48:19,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:48:19,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:48:19,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:48:19,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:48:19,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:48:19,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:48:19,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:48:19,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:48:19,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:48:19,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:48:19,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:48:19,824 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:48:19,841 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:48:19,842 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:48:19,842 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:48:19,843 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:48:19,843 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:48:19,843 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:48:19,844 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:48:19,844 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:48:19,844 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:48:19,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:48:19,844 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:48:19,844 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:48:19,845 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:48:19,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:48:19,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:48:19,845 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:48:19,845 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:48:19,845 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:48:19,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:48:19,846 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:48:19,846 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:48:19,846 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:48:19,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:48:19,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:48:19,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:48:19,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:19,847 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:48:19,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:48:19,847 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:48:19,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:48:19,847 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 -> ef47df31d033e531a0040913ad039c21826bf787c77c5128ceae3ef436a47b49 [2022-02-20 23:48:20,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:48:20,067 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:48:20,069 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:48:20,070 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:48:20,070 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:48:20,071 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2022-02-20 23:48:20,117 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32b0af222/27caf816e70c421f83fd01d340e4ccf5/FLAGe9f65af21 [2022-02-20 23:48:20,479 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:48:20,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2022-02-20 23:48:20,494 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32b0af222/27caf816e70c421f83fd01d340e4ccf5/FLAGe9f65af21 [2022-02-20 23:48:20,502 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32b0af222/27caf816e70c421f83fd01d340e4ccf5 [2022-02-20 23:48:20,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:48:20,505 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:48:20,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:20,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:48:20,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:48:20,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:20" (1/1) ... [2022-02-20 23:48:20,509 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42d695f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:20, skipping insertion in model container [2022-02-20 23:48:20,509 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:20" (1/1) ... [2022-02-20 23:48:20,514 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:48:20,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:48:20,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:20,760 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:48:20,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@70723364 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:20, skipping insertion in model container [2022-02-20 23:48:20,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:20,761 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:48:20,763 INFO L158 Benchmark]: Toolchain (without parser) took 257.35ms. Allocated memory is still 102.8MB. Free memory was 61.7MB in the beginning and 74.7MB in the end (delta: -13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:48:20,763 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 102.8MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:48:20,763 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.45ms. Allocated memory is still 102.8MB. Free memory was 61.5MB in the beginning and 74.7MB in the end (delta: -13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:48:20,764 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.16ms. Allocated memory is still 102.8MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.45ms. Allocated memory is still 102.8MB. Free memory was 61.5MB in the beginning and 74.7MB in the end (delta: -13.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 529]: 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/list-ext-properties/test-0019_1-2.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 ef47df31d033e531a0040913ad039c21826bf787c77c5128ceae3ef436a47b49 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:48:22,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:48:22,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:48:22,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:48:22,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:48:22,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:48:22,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:48:22,409 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:48:22,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:48:22,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:48:22,415 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:48:22,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:48:22,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:48:22,420 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:48:22,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:48:22,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:48:22,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:48:22,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:48:22,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:48:22,430 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:48:22,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:48:22,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:48:22,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:48:22,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:48:22,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:48:22,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:48:22,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:48:22,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:48:22,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:48:22,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:48:22,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:48:22,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:48:22,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:48:22,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:48:22,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:48:22,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:48:22,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:48:22,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:48:22,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:48:22,447 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:48:22,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:48:22,450 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:48:22,478 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:48:22,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:48:22,479 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:48:22,479 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:48:22,480 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:48:22,480 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:48:22,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:48:22,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:48:22,481 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:48:22,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:48:22,482 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:48:22,482 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:48:22,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:48:22,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:48:22,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:48:22,483 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:48:22,483 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:48:22,483 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:48:22,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:48:22,484 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:48:22,484 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:48:22,484 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:48:22,484 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:48:22,484 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:48:22,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:48:22,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:48:22,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:48:22,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:22,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:48:22,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:48:22,492 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:48:22,492 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:48:22,492 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:48:22,492 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 -> ef47df31d033e531a0040913ad039c21826bf787c77c5128ceae3ef436a47b49 [2022-02-20 23:48:22,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:48:22,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:48:22,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:48:22,745 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:48:22,746 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:48:22,747 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2022-02-20 23:48:22,812 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ef40aa73/42541b4b0e37477a86db67d3772d02d7/FLAGd9f883129 [2022-02-20 23:48:23,191 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:48:23,191 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0019_1-2.i [2022-02-20 23:48:23,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ef40aa73/42541b4b0e37477a86db67d3772d02d7/FLAGd9f883129 [2022-02-20 23:48:23,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ef40aa73/42541b4b0e37477a86db67d3772d02d7 [2022-02-20 23:48:23,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:48:23,557 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:48:23,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:23,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:48:23,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:48:23,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:23" (1/1) ... [2022-02-20 23:48:23,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29662526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:23, skipping insertion in model container [2022-02-20 23:48:23,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:23" (1/1) ... [2022-02-20 23:48:23,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:48:23,600 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:48:23,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:23,858 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:48:23,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:48:23,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:23,906 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:48:23,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:23,981 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:48:23,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:23 WrapperNode [2022-02-20 23:48:23,982 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:23,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:48:23,984 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:48:23,984 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:48:23,988 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:48:23" (1/1) ... [2022-02-20 23:48:24,014 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:48:23" (1/1) ... [2022-02-20 23:48:24,030 INFO L137 Inliner]: procedures = 128, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2022-02-20 23:48:24,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:48:24,033 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:48:24,033 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:48:24,033 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:48:24,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:23" (1/1) ... [2022-02-20 23:48:24,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:23" (1/1) ... [2022-02-20 23:48:24,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:23" (1/1) ... [2022-02-20 23:48:24,049 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:23" (1/1) ... [2022-02-20 23:48:24,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:23" (1/1) ... [2022-02-20 23:48:24,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:23" (1/1) ... [2022-02-20 23:48:24,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:23" (1/1) ... [2022-02-20 23:48:24,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:48:24,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:48:24,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:48:24,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:48:24,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:23" (1/1) ... [2022-02-20 23:48:24,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:24,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:48:24,113 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:48:24,118 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:48:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:48:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:48:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:48:24,151 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:48:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:48:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:48:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:48:24,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:48:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:48:24,155 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:48:24,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:48:24,249 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:48:24,250 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:48:24,569 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:48:24,574 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:48:24,574 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:48:24,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:24 BoogieIcfgContainer [2022-02-20 23:48:24,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:48:24,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:48:24,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:48:24,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:48:24,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:48:23" (1/3) ... [2022-02-20 23:48:24,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcdc6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:48:24, skipping insertion in model container [2022-02-20 23:48:24,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:23" (2/3) ... [2022-02-20 23:48:24,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fcdc6a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:48:24, skipping insertion in model container [2022-02-20 23:48:24,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:24" (3/3) ... [2022-02-20 23:48:24,581 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0019_1-2.i [2022-02-20 23:48:24,588 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:48:24,588 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2022-02-20 23:48:24,613 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:48:24,617 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:48:24,618 INFO L340 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2022-02-20 23:48:24,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 69 states have internal predecessors, (70), 0 states have call successors, (0), 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:48:24,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:48:24,632 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:24,632 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:48:24,633 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2022-02-20 23:48:24,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:24,639 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:48:24,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:24,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401295036] [2022-02-20 23:48:24,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:24,649 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:24,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:24,651 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:48:24,655 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:48:24,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:24,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:48:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:24,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:24,813 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:48:24,814 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 14 [2022-02-20 23:48:24,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {73#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {73#true} is VALID [2022-02-20 23:48:24,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {73#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {81#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:48:24,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {81#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[alloc_data_~pdata#1.base]); {74#false} is VALID [2022-02-20 23:48:24,840 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:48:24,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:24,841 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:24,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401295036] [2022-02-20 23:48:24,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401295036] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:24,841 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:24,842 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:24,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885135934] [2022-02-20 23:48:24,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:24,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-02-20 23:48:24,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:24,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:48:24,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:24,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:24,859 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:24,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:24,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:24,886 INFO L87 Difference]: Start difference. First operand has 70 states, 34 states have (on average 2.0588235294117645) internal successors, (70), 69 states have internal predecessors, (70), 0 states have call successors, (0), 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 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:48:25,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:25,189 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-02-20 23:48:25,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:25,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-02-20 23:48:25,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:25,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:48:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-02-20 23:48:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:48:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-02-20 23:48:25,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-02-20 23:48:25,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:25,286 INFO L225 Difference]: With dead ends: 66 [2022-02-20 23:48:25,286 INFO L226 Difference]: Without dead ends: 64 [2022-02-20 23:48:25,287 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:48:25,289 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 50 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:25,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 38 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:25,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-20 23:48:25,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-02-20 23:48:25,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:25,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 63 states have internal predecessors, (64), 0 states have call successors, (0), 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:48:25,316 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 63 states have internal predecessors, (64), 0 states have call successors, (0), 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:48:25,317 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 63 states have internal predecessors, (64), 0 states have call successors, (0), 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:48:25,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:25,328 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-02-20 23:48:25,328 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-02-20 23:48:25,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:25,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:25,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 63 states have internal predecessors, (64), 0 states have call successors, (0), 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:48:25,330 INFO L87 Difference]: Start difference. First operand has 64 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 63 states have internal predecessors, (64), 0 states have call successors, (0), 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:48:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:25,335 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-02-20 23:48:25,335 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-02-20 23:48:25,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:25,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:25,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:25,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:25,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 33 states have (on average 1.9393939393939394) internal successors, (64), 63 states have internal predecessors, (64), 0 states have call successors, (0), 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:48:25,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2022-02-20 23:48:25,342 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 3 [2022-02-20 23:48:25,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:25,342 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2022-02-20 23:48:25,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:48:25,343 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-02-20 23:48:25,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:48:25,345 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:25,345 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:48:25,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 23:48:25,545 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:48:25,546 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2022-02-20 23:48:25,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:25,547 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:48:25,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:25,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348161350] [2022-02-20 23:48:25,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:25,550 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:25,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:25,552 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:48:25,553 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:48:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:25,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:48:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:25,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:25,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:25,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, 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:48:25,659 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:48:25,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {342#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {342#true} is VALID [2022-02-20 23:48:25,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {342#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {350#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:25,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {350#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, alloc_data_~pdata#1.offset), #length[alloc_data_~pdata#1.base]) && ~bvule32(alloc_data_~pdata#1.offset, ~bvadd32(4bv32, alloc_data_~pdata#1.offset))) && ~bvule32(0bv32, alloc_data_~pdata#1.offset)); {343#false} is VALID [2022-02-20 23:48:25,676 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:48:25,676 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:25,676 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:25,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348161350] [2022-02-20 23:48:25,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348161350] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:25,677 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:25,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:25,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780487697] [2022-02-20 23:48:25,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:25,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-02-20 23:48:25,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:25,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:48:25,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:25,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:25,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:25,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:25,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:25,683 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:48:25,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:25,936 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-02-20 23:48:25,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:25,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-02-20 23:48:25,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:25,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:48:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-02-20 23:48:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:48:25,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-02-20 23:48:25,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 64 transitions. [2022-02-20 23:48:26,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:26,008 INFO L225 Difference]: With dead ends: 63 [2022-02-20 23:48:26,008 INFO L226 Difference]: Without dead ends: 63 [2022-02-20 23:48:26,009 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:48:26,009 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:26,010 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:26,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-20 23:48:26,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-02-20 23:48:26,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:26,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 62 states have internal predecessors, (63), 0 states have call successors, (0), 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:48:26,013 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 62 states have internal predecessors, (63), 0 states have call successors, (0), 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:48:26,013 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 62 states have internal predecessors, (63), 0 states have call successors, (0), 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:48:26,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:26,019 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-02-20 23:48:26,019 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-02-20 23:48:26,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:26,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:26,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 62 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 states. [2022-02-20 23:48:26,020 INFO L87 Difference]: Start difference. First operand has 63 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 62 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 states. [2022-02-20 23:48:26,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:26,024 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-02-20 23:48:26,024 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-02-20 23:48:26,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:26,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:26,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:26,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:26,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 33 states have (on average 1.9090909090909092) internal successors, (63), 62 states have internal predecessors, (63), 0 states have call successors, (0), 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:48:26,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2022-02-20 23:48:26,030 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 3 [2022-02-20 23:48:26,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:26,031 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2022-02-20 23:48:26,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:48:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-02-20 23:48:26,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:48:26,032 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:26,033 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:48:26,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:26,239 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:48:26,240 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2022-02-20 23:48:26,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:26,240 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2022-02-20 23:48:26,241 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:26,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703504676] [2022-02-20 23:48:26,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:26,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:26,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:26,242 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:48:26,243 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:48:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:26,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:48:26,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:26,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:26,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:26,340 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:48:26,344 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:48:26,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:26,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-02-20 23:48:26,409 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:48:26,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:48:26,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {605#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {605#true} is VALID [2022-02-20 23:48:26,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {605#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {613#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:26,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {613#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {617#(and (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:26,422 INFO L290 TraceCheckUtils]: 3: Hoare triple {617#(and (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) (_ bv1 1)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {613#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:26,422 INFO L290 TraceCheckUtils]: 4: Hoare triple {613#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, alloc_data_~pdata#1.offset)), #length[alloc_data_~pdata#1.base]) && ~bvule32(~bvadd32(4bv32, alloc_data_~pdata#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, alloc_data_~pdata#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, alloc_data_~pdata#1.offset))); {606#false} is VALID [2022-02-20 23:48:26,423 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:48:26,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:26,423 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:26,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703504676] [2022-02-20 23:48:26,423 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703504676] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:26,423 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:26,423 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:26,424 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944748521] [2022-02-20 23:48:26,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:26,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-02-20 23:48:26,424 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:26,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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:48:26,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:26,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:26,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:26,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:26,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:26,432 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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:48:26,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:26,658 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-02-20 23:48:26,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:26,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-02-20 23:48:26,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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:48:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-02-20 23:48:26,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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:48:26,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-02-20 23:48:26,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2022-02-20 23:48:26,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:26,726 INFO L225 Difference]: With dead ends: 60 [2022-02-20 23:48:26,726 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 23:48:26,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:26,727 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 54 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:26,727 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 25 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:26,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 23:48:26,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-02-20 23:48:26,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:26,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 59 states have internal predecessors, (60), 0 states have call successors, (0), 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:48:26,730 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 59 states have internal predecessors, (60), 0 states have call successors, (0), 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:48:26,730 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 59 states have internal predecessors, (60), 0 states have call successors, (0), 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:48:26,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:26,731 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-02-20 23:48:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-02-20 23:48:26,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:26,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:26,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 59 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 states. [2022-02-20 23:48:26,732 INFO L87 Difference]: Start difference. First operand has 60 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 59 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 states. [2022-02-20 23:48:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:26,733 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-02-20 23:48:26,733 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-02-20 23:48:26,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:26,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:26,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:26,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 59 states have internal predecessors, (60), 0 states have call successors, (0), 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:48:26,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2022-02-20 23:48:26,735 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 5 [2022-02-20 23:48:26,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:26,735 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2022-02-20 23:48:26,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 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:48:26,735 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-02-20 23:48:26,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:48:26,735 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:26,735 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:26,744 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:48:26,935 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:48:26,936 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2022-02-20 23:48:26,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:26,936 INFO L85 PathProgramCache]: Analyzing trace with hash 59199982, now seen corresponding path program 1 times [2022-02-20 23:48:26,936 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:26,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785729096] [2022-02-20 23:48:26,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:26,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:26,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:26,938 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:48:26,939 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:48:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:26,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:48:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:27,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:27,033 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:48:27,033 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:48:27,047 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:48:27,047 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:48:27,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:48:27,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:48:27,150 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-02-20 23:48:27,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-02-20 23:48:27,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 18 [2022-02-20 23:48:27,205 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:48:27,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 22 [2022-02-20 23:48:27,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:27,222 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 21 treesize of output 20 [2022-02-20 23:48:27,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 [2022-02-20 23:48:27,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-02-20 23:48:27,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {863#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {863#true} is VALID [2022-02-20 23:48:27,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {863#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {871#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (= |ULTIMATE.start_alloc_data_#t~malloc3#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:27,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {871#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (= |ULTIMATE.start_alloc_data_#t~malloc3#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {875#(and (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:48:27,267 INFO L290 TraceCheckUtils]: 3: Hoare triple {875#(and (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (_ bv0 32)))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {879#(and (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:48:27,268 INFO L290 TraceCheckUtils]: 4: Hoare triple {879#(and (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (_ bv0 32)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {879#(and (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:48:27,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {879#(and (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (_ bv0 32)))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {879#(and (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:48:27,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {879#(and (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (_ bv0 32)))} SUMMARY for call alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L531 {889#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_alloc_data_#t~mem5#1.base|)) (= |ULTIMATE.start_alloc_data_#t~mem5#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:27,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {889#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_alloc_data_#t~mem5#1.base|)) (= |ULTIMATE.start_alloc_data_#t~mem5#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, alloc_data_#t~mem5#1.offset), #length[alloc_data_#t~mem5#1.base]) && ~bvule32(alloc_data_#t~mem5#1.offset, ~bvadd32(4bv32, alloc_data_#t~mem5#1.offset))) && ~bvule32(0bv32, alloc_data_#t~mem5#1.offset)); {864#false} is VALID [2022-02-20 23:48:27,270 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:48:27,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:27,270 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:27,271 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785729096] [2022-02-20 23:48:27,271 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785729096] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:27,271 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:27,271 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:48:27,271 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219847997] [2022-02-20 23:48:27,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:27,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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:48:27,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:27,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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:48:27,282 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:48:27,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:27,283 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:27,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:27,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:27,283 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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:48:27,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:27,859 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-02-20 23:48:27,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:48:27,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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:48:27,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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:48:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-02-20 23:48:27,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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:48:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-02-20 23:48:27,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-02-20 23:48:27,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:27,922 INFO L225 Difference]: With dead ends: 59 [2022-02-20 23:48:27,922 INFO L226 Difference]: Without dead ends: 59 [2022-02-20 23:48:27,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:48:27,923 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:27,923 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 128 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:27,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-20 23:48:27,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-02-20 23:48:27,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:27,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 58 states have internal predecessors, (59), 0 states have call successors, (0), 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:48:27,925 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 58 states have internal predecessors, (59), 0 states have call successors, (0), 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:48:27,926 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 58 states have internal predecessors, (59), 0 states have call successors, (0), 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:48:27,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:27,927 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-02-20 23:48:27,927 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-02-20 23:48:27,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:27,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:27,928 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 58 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 states. [2022-02-20 23:48:27,928 INFO L87 Difference]: Start difference. First operand has 59 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 58 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 states. [2022-02-20 23:48:27,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:27,931 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-02-20 23:48:27,931 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-02-20 23:48:27,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:27,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:27,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:27,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:27,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 58 states have internal predecessors, (59), 0 states have call successors, (0), 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:48:27,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2022-02-20 23:48:27,933 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 8 [2022-02-20 23:48:27,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:27,933 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2022-02-20 23:48:27,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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:48:27,933 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-02-20 23:48:27,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:48:27,934 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:27,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:27,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:48:28,144 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:48:28,145 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2022-02-20 23:48:28,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:28,145 INFO L85 PathProgramCache]: Analyzing trace with hash 59199981, now seen corresponding path program 1 times [2022-02-20 23:48:28,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:28,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609050700] [2022-02-20 23:48:28,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:28,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:28,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:28,146 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:48:28,148 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:48:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:28,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:48:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:28,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:28,222 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:48:28,222 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:48:28,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:48:28,273 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-02-20 23:48:28,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 34 [2022-02-20 23:48:28,327 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:48:28,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 29 [2022-02-20 23:48:28,377 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-02-20 23:48:28,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 16 [2022-02-20 23:48:28,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {1132#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {1132#true} is VALID [2022-02-20 23:48:28,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {1132#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {1140#(= (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (_ bv0 1))} is VALID [2022-02-20 23:48:28,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {1140#(= (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (_ bv0 1))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {1144#(= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)))} is VALID [2022-02-20 23:48:28,393 INFO L290 TraceCheckUtils]: 3: Hoare triple {1144#(= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {1148#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (_ bv1 1))) (not (= |ULTIMATE.start_alloc_data_#t~malloc4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:28,395 INFO L290 TraceCheckUtils]: 4: Hoare triple {1148#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (_ bv1 1))) (not (= |ULTIMATE.start_alloc_data_#t~malloc4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {1152#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (_ bv1 1))))} is VALID [2022-02-20 23:48:28,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {1152#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (_ bv1 1))))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1152#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (_ bv1 1))))} is VALID [2022-02-20 23:48:28,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {1152#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (_ bv1 1))))} SUMMARY for call alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L531 {1159#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_#t~mem5#1.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:48:28,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {1159#(= (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_#t~mem5#1.base|)) (_ bv1 1)) (_ bv0 1))} assume !(1bv1 == #valid[alloc_data_#t~mem5#1.base]); {1133#false} is VALID [2022-02-20 23:48:28,398 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:48:28,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:28,398 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:28,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609050700] [2022-02-20 23:48:28,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609050700] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:28,399 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:28,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:48:28,399 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995513156] [2022-02-20 23:48:28,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:28,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 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:48:28,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:28,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 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:48:28,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:48:28,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:48:28,409 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:28,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:48:28,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:28,409 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 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:48:28,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:28,962 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-02-20 23:48:28,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:48:28,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 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:48:28,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:28,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 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:48:28,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2022-02-20 23:48:28,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 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:48:28,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 59 transitions. [2022-02-20 23:48:28,964 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 59 transitions. [2022-02-20 23:48:29,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:29,015 INFO L225 Difference]: With dead ends: 58 [2022-02-20 23:48:29,015 INFO L226 Difference]: Without dead ends: 58 [2022-02-20 23:48:29,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:48:29,016 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 4 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:29,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 123 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:29,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-20 23:48:29,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-02-20 23:48:29,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:29,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 57 states have internal predecessors, (58), 0 states have call successors, (0), 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:48:29,019 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 57 states have internal predecessors, (58), 0 states have call successors, (0), 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:48:29,019 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 57 states have internal predecessors, (58), 0 states have call successors, (0), 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:48:29,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:29,020 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-02-20 23:48:29,020 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-02-20 23:48:29,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:29,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:29,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 57 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 states. [2022-02-20 23:48:29,021 INFO L87 Difference]: Start difference. First operand has 58 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 57 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 states. [2022-02-20 23:48:29,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:29,022 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-02-20 23:48:29,022 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-02-20 23:48:29,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:29,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:29,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:29,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 57 states have internal predecessors, (58), 0 states have call successors, (0), 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:48:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-02-20 23:48:29,024 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 8 [2022-02-20 23:48:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:29,024 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-02-20 23:48:29,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 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:48:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-02-20 23:48:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:48:29,025 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:29,025 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:29,036 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:48:29,231 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:48:29,231 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2022-02-20 23:48:29,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:29,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937559, now seen corresponding path program 1 times [2022-02-20 23:48:29,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:29,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603677691] [2022-02-20 23:48:29,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:29,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:29,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:29,233 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:48:29,234 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:48:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:29,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 23:48:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:29,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:29,344 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:48:29,370 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:48:29,385 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:48:29,423 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:48:29,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 21 [2022-02-20 23:48:29,499 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:48:29,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-02-20 23:48:29,524 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-02-20 23:48:29,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 13 [2022-02-20 23:48:29,543 INFO L290 TraceCheckUtils]: 0: Hoare triple {1400#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {1400#true} is VALID [2022-02-20 23:48:29,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {1400#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {1408#(not (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|))} is VALID [2022-02-20 23:48:29,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {1408#(not (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {1412#(not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)))} is VALID [2022-02-20 23:48:29,546 INFO L290 TraceCheckUtils]: 3: Hoare triple {1412#(not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {1416#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:48:29,548 INFO L290 TraceCheckUtils]: 4: Hoare triple {1416#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {1420#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:48:29,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {1420#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1420#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:48:29,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {1420#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)))} SUMMARY for call alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L531 {1427#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)))} is VALID [2022-02-20 23:48:29,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {1427#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)))} SUMMARY for call write~intINTTYPE4(4bv32, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, 4bv32); srcloc: L531-1 {1420#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:48:29,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {1420#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)))} havoc alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset; {1420#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:48:29,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {1420#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)))} SUMMARY for call alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L532 {1437#(= (select |#valid| |ULTIMATE.start_alloc_data_#t~mem6#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:29,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {1437#(= (select |#valid| |ULTIMATE.start_alloc_data_#t~mem6#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[alloc_data_#t~mem6#1.base]); {1401#false} is VALID [2022-02-20 23:48:29,554 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:48:29,555 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:29,555 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:29,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603677691] [2022-02-20 23:48:29,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603677691] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:29,555 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:29,555 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:48:29,555 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553433012] [2022-02-20 23:48:29,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:29,555 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-02-20 23:48:29,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:29,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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:48:29,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:29,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:48:29,570 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:29,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:48:29,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:48:29,571 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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:48:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:30,396 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-02-20 23:48:30,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:48:30,396 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-02-20 23:48:30,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:30,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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:48:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2022-02-20 23:48:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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:48:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2022-02-20 23:48:30,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 58 transitions. [2022-02-20 23:48:30,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:30,456 INFO L225 Difference]: With dead ends: 57 [2022-02-20 23:48:30,456 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 23:48:30,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:48:30,457 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 11 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:30,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 204 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:48:30,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 23:48:30,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-02-20 23:48:30,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:30,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 56 states have internal predecessors, (57), 0 states have call successors, (0), 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:48:30,459 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 56 states have internal predecessors, (57), 0 states have call successors, (0), 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:48:30,459 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 56 states have internal predecessors, (57), 0 states have call successors, (0), 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:48:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:30,460 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-02-20 23:48:30,460 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-02-20 23:48:30,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:30,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:30,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 56 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 states. [2022-02-20 23:48:30,461 INFO L87 Difference]: Start difference. First operand has 57 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 56 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 states. [2022-02-20 23:48:30,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:30,462 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-02-20 23:48:30,462 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-02-20 23:48:30,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:30,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:30,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:30,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:30,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 56 states have internal predecessors, (57), 0 states have call successors, (0), 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:48:30,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2022-02-20 23:48:30,464 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 11 [2022-02-20 23:48:30,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:30,464 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2022-02-20 23:48:30,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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:48:30,464 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-02-20 23:48:30,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:48:30,464 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:30,464 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:30,479 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:48:30,671 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:48:30,671 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2022-02-20 23:48:30,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:30,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937558, now seen corresponding path program 1 times [2022-02-20 23:48:30,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:30,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001980614] [2022-02-20 23:48:30,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:30,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:30,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:30,673 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:48:30,674 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:48:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:30,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 23:48:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:30,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:30,792 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:48:30,841 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:48:30,862 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:48:30,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:48:30,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:30,906 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 22 treesize of output 21 [2022-02-20 23:48:31,006 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:48:31,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-02-20 23:48:31,011 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 20 treesize of output 22 [2022-02-20 23:48:31,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-02-20 23:48:31,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-02-20 23:48:31,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {1674#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {1674#true} is VALID [2022-02-20 23:48:31,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {1674#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {1682#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)))} is VALID [2022-02-20 23:48:31,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {1682#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {1686#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:31,093 INFO L290 TraceCheckUtils]: 3: Hoare triple {1686#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {1690#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (= |ULTIMATE.start_alloc_data_#t~malloc4#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:31,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {1690#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (_ bv4 32) (select |#length| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (= |ULTIMATE.start_alloc_data_#t~malloc4#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {1694#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:31,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {1694#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1694#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:31,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {1694#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} SUMMARY for call alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L531 {1701#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:31,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {1701#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(4bv32, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, 4bv32); srcloc: L531-1 {1694#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:31,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {1694#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} havoc alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset; {1694#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:31,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {1694#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))) (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv0 32)))} SUMMARY for call alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L532 {1711#(and (= (_ bv0 32) |ULTIMATE.start_alloc_data_#t~mem6#1.offset|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_alloc_data_#t~mem6#1.base|)))} is VALID [2022-02-20 23:48:31,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {1711#(and (= (_ bv0 32) |ULTIMATE.start_alloc_data_#t~mem6#1.offset|) (= (_ bv4 32) (select |#length| |ULTIMATE.start_alloc_data_#t~mem6#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, alloc_data_#t~mem6#1.offset), #length[alloc_data_#t~mem6#1.base]) && ~bvule32(alloc_data_#t~mem6#1.offset, ~bvadd32(4bv32, alloc_data_#t~mem6#1.offset))) && ~bvule32(0bv32, alloc_data_#t~mem6#1.offset)); {1675#false} is VALID [2022-02-20 23:48:31,114 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:48:31,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:31,114 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:31,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001980614] [2022-02-20 23:48:31,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001980614] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:31,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:31,114 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:48:31,115 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006109347] [2022-02-20 23:48:31,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:31,115 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-02-20 23:48:31,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:31,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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:48:31,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:31,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:48:31,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:31,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:48:31,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:48:31,142 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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:48:31,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:31,889 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-02-20 23:48:31,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:48:31,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-02-20 23:48:31,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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:48:31,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2022-02-20 23:48:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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:48:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2022-02-20 23:48:31,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 57 transitions. [2022-02-20 23:48:31,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:31,954 INFO L225 Difference]: With dead ends: 56 [2022-02-20 23:48:31,954 INFO L226 Difference]: Without dead ends: 56 [2022-02-20 23:48:31,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:48:31,955 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 6 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:31,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 225 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:31,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-20 23:48:31,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-02-20 23:48:31,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:31,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.696969696969697) internal successors, (56), 55 states have internal predecessors, (56), 0 states have call successors, (0), 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:48:31,958 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.696969696969697) internal successors, (56), 55 states have internal predecessors, (56), 0 states have call successors, (0), 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:48:31,958 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.696969696969697) internal successors, (56), 55 states have internal predecessors, (56), 0 states have call successors, (0), 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:48:31,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:31,959 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-02-20 23:48:31,959 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-02-20 23:48:31,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:31,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:31,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 33 states have (on average 1.696969696969697) internal successors, (56), 55 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 states. [2022-02-20 23:48:31,960 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.696969696969697) internal successors, (56), 55 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 states. [2022-02-20 23:48:31,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:31,961 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-02-20 23:48:31,961 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-02-20 23:48:31,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:31,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:31,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:31,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:31,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.696969696969697) internal successors, (56), 55 states have internal predecessors, (56), 0 states have call successors, (0), 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:48:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-02-20 23:48:31,963 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 11 [2022-02-20 23:48:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:31,963 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-02-20 23:48:31,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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:48:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-02-20 23:48:31,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:48:31,963 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:31,963 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:31,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-02-20 23:48:32,170 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:48:32,170 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2022-02-20 23:48:32,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:32,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1118886990, now seen corresponding path program 1 times [2022-02-20 23:48:32,171 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:32,171 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741971478] [2022-02-20 23:48:32,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:32,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:32,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:32,192 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:48:32,193 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:48:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:32,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:48:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:32,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:32,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {1944#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {1944#true} is VALID [2022-02-20 23:48:32,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {1944#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {1952#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:48:32,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {1952#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {1952#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:48:32,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {1952#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {1952#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:48:32,330 INFO L290 TraceCheckUtils]: 4: Hoare triple {1952#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {1952#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:48:32,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {1952#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {1952#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} is VALID [2022-02-20 23:48:32,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {1952#(= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|)} SUMMARY for call alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L531 {1968#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:32,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {1968#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(4bv32, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, 4bv32); srcloc: L531-1 {1968#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:32,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {1968#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} havoc alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset; {1968#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:32,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {1968#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} SUMMARY for call alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L532 {1968#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:32,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {1968#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(8bv32, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, 4bv32); srcloc: L532-1 {1968#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:32,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {1968#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} havoc alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset; {1968#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:32,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {1968#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} assume { :end_inline_alloc_data } true; {1968#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:48:32,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {1968#(= (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~#data~0#1.base]); {1945#false} is VALID [2022-02-20 23:48:32,350 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:48:32,350 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:32,350 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:32,350 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741971478] [2022-02-20 23:48:32,350 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741971478] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:32,350 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:32,350 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:32,351 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468583988] [2022-02-20 23:48:32,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:32,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-20 23:48:32,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:32,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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:48:32,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:32,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:32,367 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:32,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:32,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:32,367 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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:48:32,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:32,529 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-02-20 23:48:32,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:32,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-20 23:48:32,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:32,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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:48:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 23:48:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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:48:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 23:48:32,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-02-20 23:48:32,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:32,587 INFO L225 Difference]: With dead ends: 54 [2022-02-20 23:48:32,587 INFO L226 Difference]: Without dead ends: 54 [2022-02-20 23:48:32,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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:48:32,588 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 76 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:32,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 32 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:32,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-20 23:48:32,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-02-20 23:48:32,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:32,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 53 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:32,590 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 53 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:32,590 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 53 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:32,591 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-02-20 23:48:32,591 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-02-20 23:48:32,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:32,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:32,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 53 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 54 states. [2022-02-20 23:48:32,592 INFO L87 Difference]: Start difference. First operand has 54 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 53 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 54 states. [2022-02-20 23:48:32,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:32,593 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-02-20 23:48:32,593 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-02-20 23:48:32,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:32,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:32,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:32,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 53 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:32,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-02-20 23:48:32,594 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 14 [2022-02-20 23:48:32,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:32,595 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-02-20 23:48:32,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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:48:32,595 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-02-20 23:48:32,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:48:32,595 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:32,595 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:32,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-02-20 23:48:32,799 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:48:32,799 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2022-02-20 23:48:32,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:32,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1118886989, now seen corresponding path program 1 times [2022-02-20 23:48:32,800 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:32,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747632066] [2022-02-20 23:48:32,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:32,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:32,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:32,802 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:48:32,802 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:48:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:32,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:48:32,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:32,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:33,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {2207#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {2207#true} is VALID [2022-02-20 23:48:33,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {2207#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {2215#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:48:33,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {2215#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {2215#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:48:33,012 INFO L290 TraceCheckUtils]: 3: Hoare triple {2215#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {2215#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:48:33,013 INFO L290 TraceCheckUtils]: 4: Hoare triple {2215#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {2225#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:48:33,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {2225#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {2225#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:48:33,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {2225#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} SUMMARY for call alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L531 {2225#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:48:33,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {2225#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} SUMMARY for call write~intINTTYPE4(4bv32, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, 4bv32); srcloc: L531-1 {2225#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:48:33,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {2225#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} havoc alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset; {2225#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:48:33,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {2225#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} SUMMARY for call alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L532 {2225#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:48:33,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {2225#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} SUMMARY for call write~intINTTYPE4(8bv32, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, 4bv32); srcloc: L532-1 {2225#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:48:33,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {2225#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} havoc alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset; {2225#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:48:33,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {2225#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} assume { :end_inline_alloc_data } true; {2225#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} is VALID [2022-02-20 23:48:33,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {2225#(and (= |ULTIMATE.start_main_~#data~0#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv8 32) |ULTIMATE.start_main_~#data~0#1.offset|) (select |#length| |ULTIMATE.start_main_~#data~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, main_~#data~0#1.offset), #length[main_~#data~0#1.base]) && ~bvule32(main_~#data~0#1.offset, ~bvadd32(4bv32, main_~#data~0#1.offset))) && ~bvule32(0bv32, main_~#data~0#1.offset)); {2208#false} is VALID [2022-02-20 23:48:33,019 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:48:33,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:33,019 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:33,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747632066] [2022-02-20 23:48:33,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747632066] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:33,019 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:33,019 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:33,019 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411857955] [2022-02-20 23:48:33,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:33,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-20 23:48:33,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:33,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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:48:33,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:33,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:33,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:33,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:33,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:33,039 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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:48:33,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:33,214 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-02-20 23:48:33,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:33,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-20 23:48:33,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:33,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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:48:33,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-02-20 23:48:33,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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:48:33,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-02-20 23:48:33,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-02-20 23:48:33,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:33,281 INFO L225 Difference]: With dead ends: 52 [2022-02-20 23:48:33,281 INFO L226 Difference]: Without dead ends: 52 [2022-02-20 23:48:33,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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:48:33,282 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:33,282 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 32 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:33,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-20 23:48:33,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-02-20 23:48:33,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:33,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 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:48:33,284 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 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:48:33,284 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 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:48:33,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:33,285 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-02-20 23:48:33,285 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-02-20 23:48:33,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:33,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:33,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 states. [2022-02-20 23:48:33,286 INFO L87 Difference]: Start difference. First operand has 52 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 states. [2022-02-20 23:48:33,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:33,287 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-02-20 23:48:33,287 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-02-20 23:48:33,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:33,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:33,287 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:33,287 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.5757575757575757) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 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:48:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-02-20 23:48:33,288 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 14 [2022-02-20 23:48:33,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:33,289 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-02-20 23:48:33,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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:48:33,289 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-02-20 23:48:33,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:48:33,289 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:33,289 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:33,300 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:48:33,498 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:48:33,498 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2022-02-20 23:48:33,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:33,499 INFO L85 PathProgramCache]: Analyzing trace with hash 478865263, now seen corresponding path program 1 times [2022-02-20 23:48:33,499 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:33,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007155475] [2022-02-20 23:48:33,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:33,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:33,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:33,500 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:48:33,503 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:48:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:33,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:48:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:33,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:33,626 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:48:33,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {2462#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {2462#true} is VALID [2022-02-20 23:48:33,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {2462#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {2462#true} is VALID [2022-02-20 23:48:33,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {2462#true} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {2462#true} is VALID [2022-02-20 23:48:33,630 INFO L290 TraceCheckUtils]: 3: Hoare triple {2462#true} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {2462#true} is VALID [2022-02-20 23:48:33,630 INFO L290 TraceCheckUtils]: 4: Hoare triple {2462#true} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {2462#true} is VALID [2022-02-20 23:48:33,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {2462#true} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {2462#true} is VALID [2022-02-20 23:48:33,630 INFO L290 TraceCheckUtils]: 6: Hoare triple {2462#true} SUMMARY for call alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L531 {2462#true} is VALID [2022-02-20 23:48:33,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {2462#true} SUMMARY for call write~intINTTYPE4(4bv32, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, 4bv32); srcloc: L531-1 {2462#true} is VALID [2022-02-20 23:48:33,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {2462#true} havoc alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset; {2462#true} is VALID [2022-02-20 23:48:33,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {2462#true} SUMMARY for call alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L532 {2462#true} is VALID [2022-02-20 23:48:33,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {2462#true} SUMMARY for call write~intINTTYPE4(8bv32, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, 4bv32); srcloc: L532-1 {2462#true} is VALID [2022-02-20 23:48:33,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {2462#true} havoc alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset; {2462#true} is VALID [2022-02-20 23:48:33,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {2462#true} assume { :end_inline_alloc_data } true; {2462#true} is VALID [2022-02-20 23:48:33,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {2462#true} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4bv32); srcloc: L546 {2462#true} is VALID [2022-02-20 23:48:33,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {2462#true} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#data~0#1.base, ~bvadd32(4bv32, main_~#data~0#1.offset), 4bv32); srcloc: L546-1 {2462#true} is VALID [2022-02-20 23:48:33,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {2462#true} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset, free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset, free_data_#t~mem9#1, free_data_#t~mem10#1, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8bv32); {2512#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|))} is VALID [2022-02-20 23:48:33,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {2512#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_free_data_~#data#1.base|))} assume !(1bv1 == #valid[free_data_~#data#1.base]); {2463#false} is VALID [2022-02-20 23:48:33,632 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:48:33,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:33,632 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:33,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007155475] [2022-02-20 23:48:33,632 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007155475] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:33,633 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:33,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:33,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146720516] [2022-02-20 23:48:33,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:33,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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 17 [2022-02-20 23:48:33,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:33,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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:48:33,651 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:48:33,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:33,652 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:33,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:33,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:33,652 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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:48:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:33,804 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-02-20 23:48:33,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:33,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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 17 [2022-02-20 23:48:33,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:33,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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:48:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-02-20 23:48:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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:48:33,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-02-20 23:48:33,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2022-02-20 23:48:33,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:33,853 INFO L225 Difference]: With dead ends: 48 [2022-02-20 23:48:33,853 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 23:48:33,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:48:33,854 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 22 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:33,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 41 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:33,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 23:48:33,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-20 23:48:33,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:33,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 47 states have internal predecessors, (48), 0 states have call successors, (0), 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:48:33,856 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 47 states have internal predecessors, (48), 0 states have call successors, (0), 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:48:33,856 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 47 states have internal predecessors, (48), 0 states have call successors, (0), 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:48:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:33,856 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-02-20 23:48:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-02-20 23:48:33,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:33,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:33,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 47 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 states. [2022-02-20 23:48:33,857 INFO L87 Difference]: Start difference. First operand has 48 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 47 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 states. [2022-02-20 23:48:33,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:33,858 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-02-20 23:48:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-02-20 23:48:33,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:33,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:33,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:33,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 47 states have internal predecessors, (48), 0 states have call successors, (0), 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:48:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-02-20 23:48:33,859 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 17 [2022-02-20 23:48:33,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:33,859 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-02-20 23:48:33,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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:48:33,859 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-02-20 23:48:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:48:33,860 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:33,860 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:33,869 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:48:34,063 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:48:34,063 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2022-02-20 23:48:34,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:34,064 INFO L85 PathProgramCache]: Analyzing trace with hash 478865264, now seen corresponding path program 1 times [2022-02-20 23:48:34,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:34,064 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591749332] [2022-02-20 23:48:34,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:34,064 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:34,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:34,065 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:48:34,067 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:48:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:34,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:48:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:34,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:34,182 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:48:34,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {2707#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {2707#true} is VALID [2022-02-20 23:48:34,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {2707#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {2707#true} is VALID [2022-02-20 23:48:34,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {2707#true} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {2707#true} is VALID [2022-02-20 23:48:34,188 INFO L290 TraceCheckUtils]: 3: Hoare triple {2707#true} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {2707#true} is VALID [2022-02-20 23:48:34,188 INFO L290 TraceCheckUtils]: 4: Hoare triple {2707#true} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {2707#true} is VALID [2022-02-20 23:48:34,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {2707#true} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {2707#true} is VALID [2022-02-20 23:48:34,188 INFO L290 TraceCheckUtils]: 6: Hoare triple {2707#true} SUMMARY for call alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L531 {2707#true} is VALID [2022-02-20 23:48:34,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {2707#true} SUMMARY for call write~intINTTYPE4(4bv32, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, 4bv32); srcloc: L531-1 {2707#true} is VALID [2022-02-20 23:48:34,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {2707#true} havoc alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset; {2707#true} is VALID [2022-02-20 23:48:34,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {2707#true} SUMMARY for call alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L532 {2707#true} is VALID [2022-02-20 23:48:34,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {2707#true} SUMMARY for call write~intINTTYPE4(8bv32, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, 4bv32); srcloc: L532-1 {2707#true} is VALID [2022-02-20 23:48:34,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {2707#true} havoc alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset; {2707#true} is VALID [2022-02-20 23:48:34,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {2707#true} assume { :end_inline_alloc_data } true; {2707#true} is VALID [2022-02-20 23:48:34,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {2707#true} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4bv32); srcloc: L546 {2707#true} is VALID [2022-02-20 23:48:34,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {2707#true} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#data~0#1.base, ~bvadd32(4bv32, main_~#data~0#1.offset), 4bv32); srcloc: L546-1 {2707#true} is VALID [2022-02-20 23:48:34,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {2707#true} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset, free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset, free_data_#t~mem9#1, free_data_#t~mem10#1, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8bv32); {2757#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_free_data_~#data#1.base|)) (= |ULTIMATE.start_free_data_~#data#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:48:34,192 INFO L290 TraceCheckUtils]: 16: Hoare triple {2757#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_free_data_~#data#1.base|)) (= |ULTIMATE.start_free_data_~#data#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, free_data_~#data#1.offset), #length[free_data_~#data#1.base]) && ~bvule32(free_data_~#data#1.offset, ~bvadd32(4bv32, free_data_~#data#1.offset))) && ~bvule32(0bv32, free_data_~#data#1.offset)); {2708#false} is VALID [2022-02-20 23:48:34,192 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:48:34,192 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:34,193 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:34,193 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591749332] [2022-02-20 23:48:34,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591749332] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:34,193 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:34,193 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:34,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993392109] [2022-02-20 23:48:34,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:34,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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 17 [2022-02-20 23:48:34,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:34,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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:48:34,212 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:48:34,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:34,212 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:34,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:34,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:34,212 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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:48:34,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:34,373 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-02-20 23:48:34,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:34,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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 17 [2022-02-20 23:48:34,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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:48:34,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-02-20 23:48:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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:48:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-02-20 23:48:34,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-02-20 23:48:34,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:34,423 INFO L225 Difference]: With dead ends: 44 [2022-02-20 23:48:34,424 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 23:48:34,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:48:34,424 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:34,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 40 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:34,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 23:48:34,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 23:48:34,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:34,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 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:48:34,426 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 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:48:34,426 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 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:48:34,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:34,426 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-02-20 23:48:34,426 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-02-20 23:48:34,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:34,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:34,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 states. [2022-02-20 23:48:34,429 INFO L87 Difference]: Start difference. First operand has 44 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 states. [2022-02-20 23:48:34,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:34,429 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-02-20 23:48:34,429 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-02-20 23:48:34,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:34,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:34,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:34,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 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:48:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-02-20 23:48:34,430 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 17 [2022-02-20 23:48:34,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:34,430 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-02-20 23:48:34,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 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:48:34,430 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-02-20 23:48:34,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:48:34,430 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:34,430 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] [2022-02-20 23:48:34,438 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:48:34,631 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:48:34,631 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2022-02-20 23:48:34,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:34,631 INFO L85 PathProgramCache]: Analyzing trace with hash -925217004, now seen corresponding path program 1 times [2022-02-20 23:48:34,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:34,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851536235] [2022-02-20 23:48:34,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:34,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:34,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:34,633 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:48:34,633 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:48:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:34,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-20 23:48:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:34,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:34,845 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:48:34,886 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:48:34,941 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:48:34,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-02-20 23:48:34,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:35,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-02-20 23:48:35,125 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:48:35,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-02-20 23:48:35,268 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:48:35,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-02-20 23:48:35,498 INFO L356 Elim1Store]: treesize reduction 42, result has 44.0 percent of original size [2022-02-20 23:48:35,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 48 [2022-02-20 23:48:35,655 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-02-20 23:48:35,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2022-02-20 23:48:35,838 INFO L356 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2022-02-20 23:48:35,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 56 [2022-02-20 23:48:36,018 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-02-20 23:48:36,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 27 [2022-02-20 23:48:36,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {2936#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {2936#true} is VALID [2022-02-20 23:48:36,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {2936#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {2944#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:48:36,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {2944#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {2948#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:36,232 INFO L290 TraceCheckUtils]: 3: Hoare triple {2948#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {2952#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)))} is VALID [2022-02-20 23:48:36,234 INFO L290 TraceCheckUtils]: 4: Hoare triple {2952#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {2956#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:36,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {2956#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {2956#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:36,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {2956#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L531 {2963#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:36,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {2963#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call write~intINTTYPE4(4bv32, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, 4bv32); srcloc: L531-1 {2967#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:36,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {2967#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} havoc alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset; {2967#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:48:37,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {2967#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L532 {2974#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= |ULTIMATE.start_alloc_data_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} is VALID [2022-02-20 23:48:37,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {2974#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= |ULTIMATE.start_alloc_data_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} SUMMARY for call write~intINTTYPE4(8bv32, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, 4bv32); srcloc: L532-1 {2978#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} is VALID [2022-02-20 23:48:37,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {2978#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} havoc alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset; {2978#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} is VALID [2022-02-20 23:48:37,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {2978#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} assume { :end_inline_alloc_data } true; {2978#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} is VALID [2022-02-20 23:48:37,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {2978#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4bv32); srcloc: L546 {2988#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1))))} is VALID [2022-02-20 23:48:37,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {2988#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1))))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#data~0#1.base, ~bvadd32(4bv32, main_~#data~0#1.offset), 4bv32); srcloc: L546-1 {2988#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1))))} is VALID [2022-02-20 23:48:37,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {2988#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1))))} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset, free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset, free_data_#t~mem9#1, free_data_#t~mem10#1, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8bv32); {2995#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_#in~data#1.lo.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_~#data#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))))))} is VALID [2022-02-20 23:48:37,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {2995#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_#in~data#1.lo.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_~#data#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))))))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L534 {2999#(and (= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|))) (_ bv1 1)) (_ bv0 1)) (exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |ULTIMATE.start_main_~#data~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |ULTIMATE.start_free_data_~#data#1.base|)))} is VALID [2022-02-20 23:48:37,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {2999#(and (= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|))) (_ bv1 1)) (_ bv0 1)) (exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |ULTIMATE.start_main_~#data~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |ULTIMATE.start_free_data_~#data#1.base|)))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset, free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L534-1 {2999#(and (= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|))) (_ bv1 1)) (_ bv0 1)) (exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |ULTIMATE.start_main_~#data~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |ULTIMATE.start_free_data_~#data#1.base|)))} is VALID [2022-02-20 23:48:37,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {2999#(and (= (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|))) (_ bv1 1)) (_ bv0 1)) (exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |ULTIMATE.start_main_~#data~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |ULTIMATE.start_free_data_~#data#1.base|)))} SUMMARY for call free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset := read~$Pointer$(free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L534-2 {3006#(and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_#t~mem7#1.base|)))) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_#t~mem7#1.base|)))))} is VALID [2022-02-20 23:48:37,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {3006#(and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_#t~mem7#1.base|)))) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_#t~mem7#1.base|)))))} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset;havoc free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset; {3010#(and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|)))) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)) (= (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))))))} is VALID [2022-02-20 23:48:37,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {3010#(and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|)))) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)) (= (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))))))} SUMMARY for call free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset := read~$Pointer$(free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L537 {3010#(and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|)))) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)) (= (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))))))} is VALID [2022-02-20 23:48:37,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {3010#(and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|)))) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)) (= (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))))))} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset;havoc free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset; {3010#(and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|)))) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)) (= (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))))))} is VALID [2022-02-20 23:48:37,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {3010#(and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~lo~0#1.base|)))) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~lo~0#1.base|)) (= (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))))))} assume !(1bv1 == #valid[free_data_~lo~0#1.base]); {2937#false} is VALID [2022-02-20 23:48:37,124 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:48:37,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:48:37,124 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:37,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851536235] [2022-02-20 23:48:37,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851536235] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:37,124 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:37,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-20 23:48:37,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046336174] [2022-02-20 23:48:37,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:37,125 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 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:48:37,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:37,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 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:48:38,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:38,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:48:38,086 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:48:38,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:48:38,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:48:38,086 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 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:48:39,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:39,160 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-02-20 23:48:39,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:48:39,160 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 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:48:39,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 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:48:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 44 transitions. [2022-02-20 23:48:39,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 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:48:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 44 transitions. [2022-02-20 23:48:39,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 44 transitions. [2022-02-20 23:48:41,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:41,042 INFO L225 Difference]: With dead ends: 43 [2022-02-20 23:48:41,042 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 23:48:41,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-02-20 23:48:41,043 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 15 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:41,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 154 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 65 Invalid, 0 Unknown, 105 Unchecked, 0.2s Time] [2022-02-20 23:48:41,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 23:48:41,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-20 23:48:41,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:41,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 33 states have (on average 1.303030303030303) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 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:48:41,045 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 33 states have (on average 1.303030303030303) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 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:48:41,045 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 33 states have (on average 1.303030303030303) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 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:48:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:41,046 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-02-20 23:48:41,046 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-02-20 23:48:41,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:41,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:41,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 33 states have (on average 1.303030303030303) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 states. [2022-02-20 23:48:41,046 INFO L87 Difference]: Start difference. First operand has 43 states, 33 states have (on average 1.303030303030303) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 states. [2022-02-20 23:48:41,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:41,047 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-02-20 23:48:41,047 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-02-20 23:48:41,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:41,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:41,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:41,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 33 states have (on average 1.303030303030303) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 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:48:41,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-02-20 23:48:41,048 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 23 [2022-02-20 23:48:41,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:41,048 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-02-20 23:48:41,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 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:48:41,049 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-02-20 23:48:41,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:48:41,049 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:41,049 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] [2022-02-20 23:48:41,059 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:48:41,259 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:48:41,259 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2022-02-20 23:48:41,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:41,260 INFO L85 PathProgramCache]: Analyzing trace with hash -925217003, now seen corresponding path program 1 times [2022-02-20 23:48:41,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:48:41,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794735348] [2022-02-20 23:48:41,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:41,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:48:41,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:48:41,262 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:48:41,262 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:48:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:41,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 51 conjunts are in the unsatisfiable core [2022-02-20 23:48:41,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:41,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:41,535 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:48:41,535 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:48:41,556 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:48:41,556 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:48:41,609 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:48:41,666 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-02-20 23:48:41,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-02-20 23:48:41,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-20 23:48:41,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:41,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-02-20 23:48:41,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:48:41,956 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:48:41,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 75 [2022-02-20 23:48:41,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-02-20 23:48:42,249 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:48:42,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 79 [2022-02-20 23:48:42,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2022-02-20 23:48:42,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:42,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2022-02-20 23:48:42,652 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-02-20 23:48:42,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-02-20 23:48:42,846 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-02-20 23:48:42,847 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 1 case distinctions, treesize of input 44 treesize of output 31 [2022-02-20 23:48:42,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:42,892 INFO L356 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2022-02-20 23:48:42,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 66 [2022-02-20 23:48:43,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:43,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:44,314 INFO L356 Elim1Store]: treesize reduction 70, result has 33.3 percent of original size [2022-02-20 23:48:44,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 100 treesize of output 97 [2022-02-20 23:48:44,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:44,989 INFO L356 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2022-02-20 23:48:44,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 53 [2022-02-20 23:49:01,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 24 [2022-02-20 23:49:01,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 32 treesize of output 16 [2022-02-20 23:49:01,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {3201#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {3201#true} is VALID [2022-02-20 23:49:01,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {3201#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {3209#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:49:01,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {3209#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_alloc_data_#t~malloc3#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {3213#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:49:01,805 INFO L290 TraceCheckUtils]: 3: Hoare triple {3213#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {3217#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_alloc_data_#t~malloc4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:49:01,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {3217#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (not (= |ULTIMATE.start_alloc_data_#t~malloc4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {3221#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:49:01,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {3221#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {3221#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:49:01,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {3221#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L531 {3228#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) |ULTIMATE.start_alloc_data_#t~mem5#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:49:01,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {3228#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) |ULTIMATE.start_alloc_data_#t~mem5#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call write~intINTTYPE4(4bv32, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, 4bv32); srcloc: L531-1 {3232#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:49:01,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {3232#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} havoc alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset; {3232#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:49:03,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {3232#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L532 {3239#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv4 32)) (= |ULTIMATE.start_alloc_data_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} is VALID [2022-02-20 23:49:03,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {3239#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv4 32)) (= |ULTIMATE.start_alloc_data_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} SUMMARY for call write~intINTTYPE4(8bv32, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, 4bv32); srcloc: L532-1 {3243#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv4 32)) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} is VALID [2022-02-20 23:49:03,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {3243#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv4 32)) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} havoc alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset; {3243#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv4 32)) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} is VALID [2022-02-20 23:49:03,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {3243#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv4 32)) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} assume { :end_inline_alloc_data } true; {3243#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv4 32)) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} is VALID [2022-02-20 23:49:03,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {3243#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv4 32)) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1)))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4bv32); srcloc: L546 {3253#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv4 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1.offset|) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1))))} is VALID [2022-02-20 23:49:03,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {3253#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv4 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1.offset|) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1))))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#data~0#1.base, ~bvadd32(4bv32, main_~#data~0#1.offset), 4bv32); srcloc: L546-1 {3253#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv4 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1.offset|) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1))))} is VALID [2022-02-20 23:49:03,693 INFO L290 TraceCheckUtils]: 15: Hoare triple {3253#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv4 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_main_#t~mem11#1.offset|) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv1 1))))} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset, free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset, free_data_#t~mem9#1, free_data_#t~mem10#1, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8bv32); {3260#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv4 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_#in~data#1.lo.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_#in~data#1.lo.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_~#data#1.base|)) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))))} is VALID [2022-02-20 23:49:03,942 INFO L290 TraceCheckUtils]: 16: Hoare triple {3260#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv4 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_#in~data#1.lo.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_#in~data#1.lo.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_~#data#1.base|)) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L534 {3264#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv4 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_~#data#1.base|)) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)) (or (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (and (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|) (= |ULTIMATE.start_free_data_~#data#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))))))} is VALID [2022-02-20 23:49:03,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {3264#(exists ((|ULTIMATE.start_main_~#data~0#1.offset| (_ BitVec 32)) (|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (_ bv4 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) |ULTIMATE.start_free_data_~#data#1.base|)) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)) (or (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|)))) (and (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|) (= |ULTIMATE.start_free_data_~#data#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))))))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset, free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L534-1 {3268#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)) (_ bv4 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |ULTIMATE.start_free_data_~#data#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|))))} is VALID [2022-02-20 23:49:03,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {3268#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|))) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|)) (_ bv4 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) |ULTIMATE.start_free_data_~#data#1.base|)) (bvule (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_free_data_~#data#1.base|) |ULTIMATE.start_free_data_~#data#1.offset|))))} SUMMARY for call free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset := read~$Pointer$(free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L534-2 {3272#(and (bvule |ULTIMATE.start_free_data_#t~mem7#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_free_data_#t~mem7#1.offset|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_free_data_#t~mem7#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_free_data_#t~mem7#1.offset|) (select |#length| |ULTIMATE.start_free_data_#t~mem7#1.base|)))} is VALID [2022-02-20 23:49:03,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {3272#(and (bvule |ULTIMATE.start_free_data_#t~mem7#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_free_data_#t~mem7#1.offset|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_free_data_#t~mem7#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_free_data_#t~mem7#1.offset|) (select |#length| |ULTIMATE.start_free_data_#t~mem7#1.base|)))} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset;havoc free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset; {3276#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)) (bvule |ULTIMATE.start_free_data_~lo~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|) (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)))} is VALID [2022-02-20 23:49:03,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {3276#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)) (bvule |ULTIMATE.start_free_data_~lo~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|) (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)))} SUMMARY for call free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset := read~$Pointer$(free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L537 {3276#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)) (bvule |ULTIMATE.start_free_data_~lo~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|) (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)))} is VALID [2022-02-20 23:49:03,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {3276#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)) (bvule |ULTIMATE.start_free_data_~lo~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|) (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)))} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset;havoc free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset; {3276#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)) (bvule |ULTIMATE.start_free_data_~lo~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|) (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)))} is VALID [2022-02-20 23:49:03,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {3276#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)) (bvule |ULTIMATE.start_free_data_~lo~0#1.offset| (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_free_data_~lo~0#1.offset|) (select |#length| |ULTIMATE.start_free_data_~lo~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, free_data_~lo~0#1.offset), #length[free_data_~lo~0#1.base]) && ~bvule32(free_data_~lo~0#1.offset, ~bvadd32(4bv32, free_data_~lo~0#1.offset))) && ~bvule32(0bv32, free_data_~lo~0#1.offset)); {3202#false} is VALID [2022-02-20 23:49:03,951 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:49:03,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:03,952 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:49:03,952 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794735348] [2022-02-20 23:49:03,952 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794735348] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:03,952 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:03,952 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-20 23:49:03,952 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806048739] [2022-02-20 23:49:03,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:03,953 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 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:49:03,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:03,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 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:49:06,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 22 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:06,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:49:06,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:49:06,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:49:06,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:49:06,147 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 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:49:10,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:10,625 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-02-20 23:49:10,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 23:49:10,625 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 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:49:10,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 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:49:10,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 43 transitions. [2022-02-20 23:49:10,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 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:49:10,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 43 transitions. [2022-02-20 23:49:10,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 43 transitions. [2022-02-20 23:49:15,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 41 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:15,128 INFO L225 Difference]: With dead ends: 41 [2022-02-20 23:49:15,128 INFO L226 Difference]: Without dead ends: 41 [2022-02-20 23:49:15,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2022-02-20 23:49:15,129 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 54 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:15,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 129 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 207 Invalid, 0 Unknown, 64 Unchecked, 0.9s Time] [2022-02-20 23:49:15,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-02-20 23:49:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-02-20 23:49:15,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:15,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 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:49:15,130 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 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:49:15,130 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 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:49:15,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:15,131 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-02-20 23:49:15,131 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-02-20 23:49:15,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:15,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:15,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states. [2022-02-20 23:49:15,131 INFO L87 Difference]: Start difference. First operand has 41 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states. [2022-02-20 23:49:15,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:15,132 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-02-20 23:49:15,132 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-02-20 23:49:15,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:15,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:15,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:15,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 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:49:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-02-20 23:49:15,132 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 23 [2022-02-20 23:49:15,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:15,133 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-02-20 23:49:15,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 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:49:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-02-20 23:49:15,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:49:15,133 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:15,133 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] [2022-02-20 23:49:15,145 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:49:15,333 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:49:15,334 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 31 more)] === [2022-02-20 23:49:15,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:15,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1383043969, now seen corresponding path program 1 times [2022-02-20 23:49:15,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:15,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976867147] [2022-02-20 23:49:15,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:15,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:15,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:15,338 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:49:15,343 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:49:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:15,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 30 conjunts are in the unsatisfiable core [2022-02-20 23:49:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:15,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:15,561 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:49:15,597 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:49:15,644 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:49:15,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-02-20 23:49:15,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:15,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-02-20 23:49:15,872 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:49:15,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2022-02-20 23:49:15,985 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:49:15,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-02-20 23:49:20,089 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-02-20 23:49:20,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 17 [2022-02-20 23:49:20,203 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-02-20 23:49:20,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 42 [2022-02-20 23:49:20,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:49:20,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 42 treesize of output 18 [2022-02-20 23:49:20,842 INFO L290 TraceCheckUtils]: 0: Hoare triple {3471#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(16bv32, 2bv32); {3471#true} is VALID [2022-02-20 23:49:20,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {3471#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_~#data~0#1.base, main_~#data~0#1.offset;call main_~#data~0#1.base, main_~#data~0#1.offset := #Ultimate.allocOnStack(8bv32);assume { :begin_inline_alloc_data } true;alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset := main_~#data~0#1.base, main_~#data~0#1.offset;havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset;alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset := alloc_data_#in~pdata#1.base, alloc_data_#in~pdata#1.offset;call alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset := #Ultimate.allocOnHeap(4bv32); {3479#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} is VALID [2022-02-20 23:49:20,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {3479#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (not (= |ULTIMATE.start_alloc_data_#t~malloc3#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset, alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L529 {3483#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:49:20,846 INFO L290 TraceCheckUtils]: 3: Hoare triple {3483#(and (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} havoc alloc_data_#t~malloc3#1.base, alloc_data_#t~malloc3#1.offset;call alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset := #Ultimate.allocOnHeap(4bv32); {3487#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:49:20,849 INFO L290 TraceCheckUtils]: 4: Hoare triple {3487#(and (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))) (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|)) (= (select |#valid| |ULTIMATE.start_alloc_data_#t~malloc4#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset, alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L530 {3491#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:49:20,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {3491#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} havoc alloc_data_#t~malloc4#1.base, alloc_data_#t~malloc4#1.offset; {3491#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:49:20,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {3491#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, alloc_data_~pdata#1.offset, 4bv32); srcloc: L531 {3498#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:49:20,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {3498#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call write~intINTTYPE4(4bv32, alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset, 4bv32); srcloc: L531-1 {3491#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:49:20,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {3491#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} havoc alloc_data_#t~mem5#1.base, alloc_data_#t~mem5#1.offset; {3491#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} is VALID [2022-02-20 23:49:21,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {3491#(and (not (= |ULTIMATE.start_alloc_data_~pdata#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32))))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_alloc_data_~pdata#1.base|)) (_ bv1 1))) (= |ULTIMATE.start_alloc_data_~pdata#1.offset| |ULTIMATE.start_main_~#data~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) (bvadd |ULTIMATE.start_alloc_data_~pdata#1.offset| (_ bv4 32)))) (_ bv1 1)) (= |ULTIMATE.start_alloc_data_~pdata#1.base| |ULTIMATE.start_main_~#data~0#1.base|) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_alloc_data_~pdata#1.base|) |ULTIMATE.start_alloc_data_~pdata#1.offset|))))} SUMMARY for call alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset := read~$Pointer$(alloc_data_~pdata#1.base, ~bvadd32(4bv32, alloc_data_~pdata#1.offset), 4bv32); srcloc: L532 {3508#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= |ULTIMATE.start_alloc_data_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1))))} is VALID [2022-02-20 23:49:21,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {3508#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= |ULTIMATE.start_alloc_data_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1))))} SUMMARY for call write~intINTTYPE4(8bv32, alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset, 4bv32); srcloc: L532-1 {3512#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1))))} is VALID [2022-02-20 23:49:21,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {3512#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1))))} havoc alloc_data_#t~mem6#1.base, alloc_data_#t~mem6#1.offset; {3512#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1))))} is VALID [2022-02-20 23:49:21,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {3512#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1))))} assume { :end_inline_alloc_data } true; {3512#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1))))} is VALID [2022-02-20 23:49:21,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {3512#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1))))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#data~0#1.base, main_~#data~0#1.offset, 4bv32); srcloc: L546 {3512#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1))))} is VALID [2022-02-20 23:49:21,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {3512#(and (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) |ULTIMATE.start_main_~#data~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|))) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~#data~0#1.offset|)) |ULTIMATE.start_main_~#data~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1))))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#data~0#1.base, ~bvadd32(4bv32, main_~#data~0#1.offset), 4bv32); srcloc: L546-1 {3525#(and (= (select |#valid| |ULTIMATE.start_main_#t~mem12#1.base|) (_ bv1 1)) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_#t~mem12#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1))))))} is VALID [2022-02-20 23:49:21,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {3525#(and (= (select |#valid| |ULTIMATE.start_main_#t~mem12#1.base|) (_ bv1 1)) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_#t~mem12#1.base| |ULTIMATE.start_main_~#data~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)) (_ bv1 1))))))} assume { :begin_inline_free_data } true;free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset := main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset, free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset, free_data_#t~mem9#1, free_data_#t~mem10#1, free_data_~#data#1.base, free_data_~#data#1.offset, free_data_~lo~0#1.base, free_data_~lo~0#1.offset, free_data_~hi~0#1.base, free_data_~hi~0#1.offset;call free_data_~#data#1.base, free_data_~#data#1.offset := #Ultimate.allocOnStack(8bv32); {3529#(and (= (bvneg (select |#valid| |ULTIMATE.start_free_data_#in~data#1.hi.base|)) (_ bv1 1)) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_#in~data#1.hi.base|)) (= (bvadd (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (_ bv0 1)))) (not (= |ULTIMATE.start_free_data_#in~data#1.hi.base| |ULTIMATE.start_free_data_~#data#1.base|)))} is VALID [2022-02-20 23:49:21,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {3529#(and (= (bvneg (select |#valid| |ULTIMATE.start_free_data_#in~data#1.hi.base|)) (_ bv1 1)) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_#in~data#1.hi.base|)) (= (bvadd (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (_ bv0 1)))) (not (= |ULTIMATE.start_free_data_#in~data#1.hi.base| |ULTIMATE.start_free_data_~#data#1.base|)))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.lo.base, free_data_#in~data#1.lo.offset, free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L534 {3529#(and (= (bvneg (select |#valid| |ULTIMATE.start_free_data_#in~data#1.hi.base|)) (_ bv1 1)) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_#in~data#1.hi.base|)) (= (bvadd (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (_ bv0 1)))) (not (= |ULTIMATE.start_free_data_#in~data#1.hi.base| |ULTIMATE.start_free_data_~#data#1.base|)))} is VALID [2022-02-20 23:49:21,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {3529#(and (= (bvneg (select |#valid| |ULTIMATE.start_free_data_#in~data#1.hi.base|)) (_ bv1 1)) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_#in~data#1.hi.base|)) (= (bvadd (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (_ bv0 1)))) (not (= |ULTIMATE.start_free_data_#in~data#1.hi.base| |ULTIMATE.start_free_data_~#data#1.base|)))} SUMMARY for call write~$Pointer$(free_data_#in~data#1.hi.base, free_data_#in~data#1.hi.offset, free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L534-1 {3536#(and (= (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (_ bv1 1)) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= (bvadd (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) |ULTIMATE.start_free_data_~#data#1.base|)))} is VALID [2022-02-20 23:49:21,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {3536#(and (= (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (_ bv1 1)) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= (bvadd (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) |ULTIMATE.start_free_data_~#data#1.base|)))} SUMMARY for call free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset := read~$Pointer$(free_data_~#data#1.base, free_data_~#data#1.offset, 4bv32); srcloc: L534-2 {3536#(and (= (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (_ bv1 1)) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= (bvadd (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) |ULTIMATE.start_free_data_~#data#1.base|)))} is VALID [2022-02-20 23:49:21,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {3536#(and (= (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (_ bv1 1)) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= (bvadd (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) |ULTIMATE.start_free_data_~#data#1.base|)))} free_data_~lo~0#1.base, free_data_~lo~0#1.offset := free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset;havoc free_data_#t~mem7#1.base, free_data_#t~mem7#1.offset; {3536#(and (= (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (_ bv1 1)) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= (bvadd (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) |ULTIMATE.start_free_data_~#data#1.base|)))} is VALID [2022-02-20 23:49:21,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {3536#(and (= (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))) (_ bv1 1)) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~#data#1.base|)) (= (bvadd (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))))))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_free_data_~#data#1.base|) (bvadd |ULTIMATE.start_free_data_~#data#1.offset| (_ bv4 32))) |ULTIMATE.start_free_data_~#data#1.base|)))} SUMMARY for call free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset := read~$Pointer$(free_data_~#data#1.base, ~bvadd32(4bv32, free_data_~#data#1.offset), 4bv32); srcloc: L537 {3546#(and (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_#t~mem8#1.base|)))) (= (bvneg (select |#valid| |ULTIMATE.start_free_data_#t~mem8#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:49:21,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {3546#(and (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_#t~mem8#1.base|)))) (= (bvneg (select |#valid| |ULTIMATE.start_free_data_#t~mem8#1.base|)) (_ bv1 1)))} free_data_~hi~0#1.base, free_data_~hi~0#1.offset := free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset;havoc free_data_#t~mem8#1.base, free_data_#t~mem8#1.offset; {3550#(and (= (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|))) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~hi~0#1.base|)))))} is VALID [2022-02-20 23:49:21,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {3550#(and (= (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|))) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~hi~0#1.base|)))))} SUMMARY for call free_data_#t~mem9#1 := read~intINTTYPE4(free_data_~lo~0#1.base, free_data_~lo~0#1.offset, 4bv32); srcloc: L538 {3550#(and (= (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|))) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~hi~0#1.base|)))))} is VALID [2022-02-20 23:49:21,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {3550#(and (= (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_free_data_~hi~0#1.base|))) (exists ((|ULTIMATE.start_main_~#data~0#1.base| (_ BitVec 32))) (and (= (bvadd (_ bv1 1) (bvneg (bvneg (select |#valid| |ULTIMATE.start_main_~#data~0#1.base|)))) (_ bv0 1)) (not (= |ULTIMATE.start_main_~#data~0#1.base| |ULTIMATE.start_free_data_~hi~0#1.base|)))))} assume !(1bv1 == #valid[free_data_~hi~0#1.base]); {3472#false} is VALID [2022-02-20 23:49:21,684 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:49:21,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:21,684 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:49:21,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976867147] [2022-02-20 23:49:21,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976867147] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:21,684 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:21,684 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 23:49:21,684 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190943483] [2022-02-20 23:49:21,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:21,684 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 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 24 [2022-02-20 23:49:21,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:21,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 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:49:31,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 20 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:31,752 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:49:31,752 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:49:31,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:49:31,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=150, Unknown=2, NotChecked=0, Total=182 [2022-02-20 23:49:31,753 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 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:49:33,872 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []