./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:46:54,812 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:46:54,814 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:46:54,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:46:54,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:46:54,856 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:46:54,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:46:54,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:46:54,860 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:46:54,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:46:54,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:46:54,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:46:54,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:46:54,868 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:46:54,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:46:54,870 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:46:54,872 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:46:54,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:46:54,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:46:54,878 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:46:54,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:46:54,881 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:46:54,882 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:46:54,883 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:46:54,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:46:54,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:46:54,886 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:46:54,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:46:54,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:46:54,887 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:46:54,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:46:54,888 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:46:54,889 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:46:54,890 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:46:54,891 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:46:54,891 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:46:54,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:46:54,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:46:54,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:46:54,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:46:54,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:46:54,894 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:46:54,916 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:46:54,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:46:54,916 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:46:54,916 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:46:54,917 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:46:54,917 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:46:54,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:46:54,918 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:46:54,918 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:46:54,918 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:46:54,919 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:46:54,919 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:46:54,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:46:54,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:46:54,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:46:54,919 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:46:54,920 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:46:54,920 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:46:54,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:46:54,920 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:46:54,920 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:46:54,920 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:46:54,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:46:54,921 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:46:54,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:46:54,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:46:54,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:46:54,922 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:46:54,922 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:46:54,923 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:46:54,923 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 -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2022-02-20 23:46:55,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:46:55,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:46:55,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:46:55,132 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:46:55,132 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:46:55,133 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2022-02-20 23:46:55,170 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a409cfea8/8915ff2b6a264a0f86b2d3bd52ab8d8c/FLAGd647d29e1 [2022-02-20 23:46:55,634 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:46:55,635 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2022-02-20 23:46:55,648 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a409cfea8/8915ff2b6a264a0f86b2d3bd52ab8d8c/FLAGd647d29e1 [2022-02-20 23:46:55,661 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a409cfea8/8915ff2b6a264a0f86b2d3bd52ab8d8c [2022-02-20 23:46:55,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:46:55,666 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:46:55,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:46:55,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:46:55,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:46:55,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:46:55" (1/1) ... [2022-02-20 23:46:55,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1babae76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:55, skipping insertion in model container [2022-02-20 23:46:55,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:46:55" (1/1) ... [2022-02-20 23:46:55,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:46:55,708 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:46:55,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:46:55,930 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:46:55,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3f504e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:55, skipping insertion in model container [2022-02-20 23:46:55,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:46:55,932 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:46:55,935 INFO L158 Benchmark]: Toolchain (without parser) took 267.00ms. Allocated memory is still 111.1MB. Free memory was 80.5MB in the beginning and 84.0MB in the end (delta: -3.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:46:55,935 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 92.3MB. Free memory is still 53.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:46:55,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.54ms. Allocated memory is still 111.1MB. Free memory was 80.2MB in the beginning and 84.0MB in the end (delta: -3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:46:55,937 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.14ms. Allocated memory is still 92.3MB. Free memory is still 53.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.54ms. Allocated memory is still 111.1MB. Free memory was 80.2MB in the beginning and 84.0MB in the end (delta: -3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 556]: 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/memsafety-ext2/complex_data_creation_test01-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:46:57,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:46:57,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:46:57,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:46:57,502 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:46:57,505 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:46:57,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:46:57,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:46:57,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:46:57,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:46:57,517 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:46:57,518 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:46:57,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:46:57,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:46:57,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:46:57,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:46:57,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:46:57,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:46:57,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:46:57,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:46:57,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:46:57,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:46:57,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:46:57,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:46:57,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:46:57,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:46:57,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:46:57,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:46:57,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:46:57,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:46:57,542 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:46:57,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:46:57,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:46:57,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:46:57,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:46:57,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:46:57,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:46:57,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:46:57,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:46:57,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:46:57,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:46:57,550 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:46:57,571 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:46:57,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:46:57,573 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:46:57,573 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:46:57,573 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:46:57,573 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:46:57,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:46:57,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:46:57,575 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:46:57,575 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:46:57,575 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:46:57,576 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:46:57,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:46:57,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:46:57,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:46:57,576 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:46:57,576 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:46:57,576 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:46:57,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:46:57,577 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:46:57,577 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:46:57,577 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:46:57,577 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:46:57,577 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:46:57,577 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:46:57,577 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:46:57,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:46:57,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:46:57,578 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:46:57,578 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:46:57,578 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:46:57,578 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:46:57,579 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:46:57,579 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 -> 52769785b06238c88fd6b21b09d77c08165e59529f322f93adf725e9d68e47df [2022-02-20 23:46:57,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:46:57,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:46:57,846 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:46:57,847 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:46:57,847 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:46:57,848 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2022-02-20 23:46:57,885 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9a1a5415/5d4f1955aaeb4121b26c7d3f711b47ed/FLAG7b6572dd2 [2022-02-20 23:46:58,254 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:46:58,255 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-1.i [2022-02-20 23:46:58,266 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9a1a5415/5d4f1955aaeb4121b26c7d3f711b47ed/FLAG7b6572dd2 [2022-02-20 23:46:58,614 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9a1a5415/5d4f1955aaeb4121b26c7d3f711b47ed [2022-02-20 23:46:58,617 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:46:58,620 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:46:58,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:46:58,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:46:58,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:46:58,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:46:58" (1/1) ... [2022-02-20 23:46:58,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@88fe298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:58, skipping insertion in model container [2022-02-20 23:46:58,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:46:58" (1/1) ... [2022-02-20 23:46:58,632 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:46:58,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:46:58,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:46:58,890 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:46:58,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:46:58,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:46:58,930 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:46:58,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:46:59,006 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:46:59,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:59 WrapperNode [2022-02-20 23:46:59,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:46:59,007 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:46:59,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:46:59,008 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:46:59,012 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:46:59" (1/1) ... [2022-02-20 23:46:59,039 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:46:59" (1/1) ... [2022-02-20 23:46:59,072 INFO L137 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2022-02-20 23:46:59,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:46:59,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:46:59,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:46:59,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:46:59,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:59" (1/1) ... [2022-02-20 23:46:59,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:59" (1/1) ... [2022-02-20 23:46:59,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:59" (1/1) ... [2022-02-20 23:46:59,094 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:59" (1/1) ... [2022-02-20 23:46:59,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:59" (1/1) ... [2022-02-20 23:46:59,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:59" (1/1) ... [2022-02-20 23:46:59,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:59" (1/1) ... [2022-02-20 23:46:59,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:46:59,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:46:59,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:46:59,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:46:59,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:59" (1/1) ... [2022-02-20 23:46:59,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:46:59,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:59,171 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:46:59,188 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:46:59,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:46:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:46:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2022-02-20 23:46:59,200 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2022-02-20 23:46:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:46:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:46:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:46:59,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:46:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:46:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:46:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:46:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:46:59,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:46:59,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:46:59,277 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:46:59,279 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:47:00,041 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:47:00,046 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:47:00,046 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 23:47:00,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:47:00 BoogieIcfgContainer [2022-02-20 23:47:00,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:47:00,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:47:00,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:47:00,055 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:47:00,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:46:58" (1/3) ... [2022-02-20 23:47:00,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac98448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:47:00, skipping insertion in model container [2022-02-20 23:47:00,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:59" (2/3) ... [2022-02-20 23:47:00,057 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ac98448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:47:00, skipping insertion in model container [2022-02-20 23:47:00,057 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:47:00" (3/3) ... [2022-02-20 23:47:00,058 INFO L111 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-1.i [2022-02-20 23:47:00,061 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:47:00,061 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2022-02-20 23:47:00,096 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:47:00,118 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:47:00,118 INFO L340 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2022-02-20 23:47:00,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:47:00,144 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:00,144 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:47:00,144 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:00,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:00,152 INFO L85 PathProgramCache]: Analyzing trace with hash 4835205, now seen corresponding path program 1 times [2022-02-20 23:47:00,159 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:00,160 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1310347108] [2022-02-20 23:47:00,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:00,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:00,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:00,162 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:47:00,163 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:47:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:00,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:47:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:00,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:00,288 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:47:00,336 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:47:00,337 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 12 treesize of output 17 [2022-02-20 23:47:00,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#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(33bv32, 2bv32); {191#true} is VALID [2022-02-20 23:47:00,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {199#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:00,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {199#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1))} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {203#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_append_~pointerToList#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:47:00,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {203#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_append_~pointerToList#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[append_~pointerToList#1.base]); {192#false} is VALID [2022-02-20 23:47:00,361 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:47:00,361 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:00,362 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:00,362 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1310347108] [2022-02-20 23:47:00,362 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1310347108] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:00,362 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:00,362 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:00,364 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236949437] [2022-02-20 23:47:00,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:00,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-02-20 23:47:00,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:00,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:00,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:00,376 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:00,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:00,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:00,390 INFO L87 Difference]: Start difference. First operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:01,449 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2022-02-20 23:47:01,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:01,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-02-20 23:47:01,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:01,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 235 transitions. [2022-02-20 23:47:01,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 235 transitions. [2022-02-20 23:47:01,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 235 transitions. [2022-02-20 23:47:01,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:01,703 INFO L225 Difference]: With dead ends: 208 [2022-02-20 23:47:01,703 INFO L226 Difference]: Without dead ends: 206 [2022-02-20 23:47:01,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:47:01,723 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 149 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:01,724 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 288 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-02-20 23:47:01,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 180. [2022-02-20 23:47:01,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:01,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:01,773 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:01,774 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:01,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:01,796 INFO L93 Difference]: Finished difference Result 206 states and 218 transitions. [2022-02-20 23:47:01,796 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 218 transitions. [2022-02-20 23:47:01,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:01,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:01,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 206 states. [2022-02-20 23:47:01,803 INFO L87 Difference]: Start difference. First operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 206 states. [2022-02-20 23:47:01,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:01,812 INFO L93 Difference]: Finished difference Result 206 states and 218 transitions. [2022-02-20 23:47:01,813 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 218 transitions. [2022-02-20 23:47:01,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:01,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:01,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:01,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 191 transitions. [2022-02-20 23:47:01,825 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 191 transitions. Word has length 4 [2022-02-20 23:47:01,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:01,826 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 191 transitions. [2022-02-20 23:47:01,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,826 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 191 transitions. [2022-02-20 23:47:01,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:47:01,827 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:01,827 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:47:01,850 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:47:02,033 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:47:02,033 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:02,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:02,037 INFO L85 PathProgramCache]: Analyzing trace with hash 4835206, now seen corresponding path program 1 times [2022-02-20 23:47:02,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:02,040 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354356328] [2022-02-20 23:47:02,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:02,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:02,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:02,041 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:47:02,054 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:47:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:02,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:47:02,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:02,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:02,127 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:47:02,131 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:47:02,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:47:02,201 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:47:02,214 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:47:02,214 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 12 treesize of output 12 [2022-02-20 23:47:02,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {1008#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(33bv32, 2bv32); {1008#true} is VALID [2022-02-20 23:47:02,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {1008#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {1016#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} is VALID [2022-02-20 23:47:02,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {1016#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {1020#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} is VALID [2022-02-20 23:47:02,235 INFO L290 TraceCheckUtils]: 3: Hoare triple {1020#(and (= |ULTIMATE.start_append_~pointerToList#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_append_~pointerToList#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, append_~pointerToList#1.offset), #length[append_~pointerToList#1.base]) && ~bvule32(append_~pointerToList#1.offset, ~bvadd32(4bv32, append_~pointerToList#1.offset))) && ~bvule32(0bv32, append_~pointerToList#1.offset)); {1009#false} is VALID [2022-02-20 23:47:02,235 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:47:02,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:02,235 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:02,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354356328] [2022-02-20 23:47:02,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354356328] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:02,236 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:02,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:02,236 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241681275] [2022-02-20 23:47:02,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:02,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-02-20 23:47:02,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:02,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:02,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:02,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:02,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:02,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:02,243 INFO L87 Difference]: Start difference. First operand 180 states and 191 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:03,599 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-02-20 23:47:03,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:47:03,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-02-20 23:47:03,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2022-02-20 23:47:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2022-02-20 23:47:03,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 212 transitions. [2022-02-20 23:47:03,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:03,863 INFO L225 Difference]: With dead ends: 196 [2022-02-20 23:47:03,863 INFO L226 Difference]: Without dead ends: 196 [2022-02-20 23:47:03,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:47:03,864 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 28 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:03,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 341 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:47:03,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-02-20 23:47:03,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2022-02-20 23:47:03,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:03,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:03,870 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:03,871 INFO L87 Difference]: Start difference. First operand 196 states. Second operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:03,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:03,878 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-02-20 23:47:03,878 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2022-02-20 23:47:03,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:03,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:03,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 196 states. [2022-02-20 23:47:03,880 INFO L87 Difference]: Start difference. First operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 196 states. [2022-02-20 23:47:03,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:03,887 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2022-02-20 23:47:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2022-02-20 23:47:03,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:03,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:03,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:03,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:03,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2022-02-20 23:47:03,894 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 4 [2022-02-20 23:47:03,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:03,894 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2022-02-20 23:47:03,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,895 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2022-02-20 23:47:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:47:03,895 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:03,895 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:47:03,906 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:47:04,101 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:47:04,102 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:04,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:04,106 INFO L85 PathProgramCache]: Analyzing trace with hash 149891462, now seen corresponding path program 1 times [2022-02-20 23:47:04,106 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:04,106 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422256589] [2022-02-20 23:47:04,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:04,107 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:04,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:04,108 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:47:04,109 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:47:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:04,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:47:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:04,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:04,166 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:47:04,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {1798#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(33bv32, 2bv32); {1798#true} is VALID [2022-02-20 23:47:04,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {1798#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {1798#true} is VALID [2022-02-20 23:47:04,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {1798#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {1809#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:04,174 INFO L290 TraceCheckUtils]: 3: Hoare triple {1809#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L588 {1809#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:04,174 INFO L290 TraceCheckUtils]: 4: Hoare triple {1809#(= (select |#valid| |ULTIMATE.start_append_~node~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[append_~node~0#1.base]); {1799#false} is VALID [2022-02-20 23:47:04,174 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:47:04,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:04,174 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:04,174 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422256589] [2022-02-20 23:47:04,175 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422256589] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:04,175 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:04,176 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:04,178 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390499314] [2022-02-20 23:47:04,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:04,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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:47:04,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:04,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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:47:04,183 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:47:04,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:04,184 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:04,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:04,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:04,188 INFO L87 Difference]: Start difference. First operand 185 states and 198 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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:47:04,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:04,899 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2022-02-20 23:47:04,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:04,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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:47:04,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:04,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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:47:04,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2022-02-20 23:47:04,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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:47:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2022-02-20 23:47:04,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 218 transitions. [2022-02-20 23:47:05,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:05,140 INFO L225 Difference]: With dead ends: 208 [2022-02-20 23:47:05,140 INFO L226 Difference]: Without dead ends: 208 [2022-02-20 23:47:05,140 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:47:05,143 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 64 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:05,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 230 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:05,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-02-20 23:47:05,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 183. [2022-02-20 23:47:05,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:05,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:05,160 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:05,166 INFO L87 Difference]: Start difference. First operand 208 states. Second operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:05,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:05,171 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2022-02-20 23:47:05,171 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 221 transitions. [2022-02-20 23:47:05,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:05,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:05,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 208 states. [2022-02-20 23:47:05,172 INFO L87 Difference]: Start difference. First operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 208 states. [2022-02-20 23:47:05,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:05,176 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2022-02-20 23:47:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 221 transitions. [2022-02-20 23:47:05,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:05,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:05,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:05,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:05,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2022-02-20 23:47:05,180 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 5 [2022-02-20 23:47:05,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:05,181 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2022-02-20 23:47:05,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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:47:05,181 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2022-02-20 23:47:05,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:47:05,181 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:05,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:47:05,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 23:47:05,387 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:47:05,388 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:05,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:05,388 INFO L85 PathProgramCache]: Analyzing trace with hash 149891463, now seen corresponding path program 1 times [2022-02-20 23:47:05,389 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:05,389 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004131144] [2022-02-20 23:47:05,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:05,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:05,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:05,390 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:47:05,393 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:47:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:05,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:47:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:05,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:05,472 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:47:05,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {2622#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(33bv32, 2bv32); {2622#true} is VALID [2022-02-20 23:47:05,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {2622#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {2622#true} is VALID [2022-02-20 23:47:05,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {2622#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {2633#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:05,485 INFO L290 TraceCheckUtils]: 3: Hoare triple {2633#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L588 {2633#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:05,486 INFO L290 TraceCheckUtils]: 4: Hoare triple {2633#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~node~0#1.base|)) (= |ULTIMATE.start_append_~node~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, append_~node~0#1.offset)), #length[append_~node~0#1.base]) && ~bvule32(~bvadd32(4bv32, append_~node~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, append_~node~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, append_~node~0#1.offset))); {2623#false} is VALID [2022-02-20 23:47:05,486 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:47:05,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:05,486 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:05,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004131144] [2022-02-20 23:47:05,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004131144] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:05,487 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:05,487 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:05,487 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310941730] [2022-02-20 23:47:05,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:05,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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:47:05,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:05,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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:47:05,493 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:47:05,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:05,493 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:05,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:05,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:05,494 INFO L87 Difference]: Start difference. First operand 183 states and 195 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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:47:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:06,193 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2022-02-20 23:47:06,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:06,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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:47:06,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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:47:06,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-20 23:47:06,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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:47:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-20 23:47:06,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2022-02-20 23:47:06,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:06,372 INFO L225 Difference]: With dead ends: 181 [2022-02-20 23:47:06,372 INFO L226 Difference]: Without dead ends: 181 [2022-02-20 23:47:06,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:47:06,372 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:06,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 271 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:06,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-02-20 23:47:06,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-02-20 23:47:06,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:06,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 181 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 177 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:06,377 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 181 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 177 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:06,377 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 181 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 177 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:06,380 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2022-02-20 23:47:06,380 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2022-02-20 23:47:06,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:06,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:06,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 177 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 181 states. [2022-02-20 23:47:06,382 INFO L87 Difference]: Start difference. First operand has 181 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 177 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 181 states. [2022-02-20 23:47:06,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:06,385 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2022-02-20 23:47:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2022-02-20 23:47:06,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:06,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:06,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:06,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:06,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 177 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2022-02-20 23:47:06,389 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 5 [2022-02-20 23:47:06,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:06,389 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2022-02-20 23:47:06,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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:47:06,390 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2022-02-20 23:47:06,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:47:06,390 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:06,390 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:06,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-20 23:47:06,599 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:47:06,599 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:06,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:06,599 INFO L85 PathProgramCache]: Analyzing trace with hash 370034199, now seen corresponding path program 1 times [2022-02-20 23:47:06,600 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:06,600 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019994789] [2022-02-20 23:47:06,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:06,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:06,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:06,601 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:47:06,602 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:47:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:06,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:47:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:06,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:06,671 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:47:06,702 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:47:06,702 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 12 treesize of output 12 [2022-02-20 23:47:06,756 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 14 treesize of output 16 [2022-02-20 23:47:06,767 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 14 treesize of output 16 [2022-02-20 23:47:06,802 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:47:06,805 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:47:06,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {3363#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(33bv32, 2bv32); {3363#true} is VALID [2022-02-20 23:47:06,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {3363#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {3371#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:06,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {3371#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (_ bv0 32)))} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {3375#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_append_~pointerToList#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:06,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {3375#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_append_~pointerToList#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)))} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L588 {3375#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_append_~pointerToList#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:06,824 INFO L290 TraceCheckUtils]: 4: Hoare triple {3375#(and (not (= |ULTIMATE.start_append_~node~0#1.base| |ULTIMATE.start_append_~pointerToList#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)))} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L588-1 {3382#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:06,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {3382#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)))} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {3382#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:06,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {3382#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset|) (_ bv0 32)))} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {3389#(and (= |ULTIMATE.start_append_#t~mem26#1.base| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_append_#t~mem26#1.offset|))} is VALID [2022-02-20 23:47:06,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {3389#(and (= |ULTIMATE.start_append_#t~mem26#1.base| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_append_#t~mem26#1.offset|))} assume !(append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32);havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {3364#false} is VALID [2022-02-20 23:47:06,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {3364#false} SUMMARY for call append_#t~mem28#1.base, append_#t~mem28#1.offset := read~$Pointer$(append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L592 {3364#false} is VALID [2022-02-20 23:47:06,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {3364#false} assume !(1bv1 == #valid[append_#t~mem28#1.base]); {3364#false} is VALID [2022-02-20 23:47:06,826 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:47:06,826 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:06,826 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:06,826 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019994789] [2022-02-20 23:47:06,826 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1019994789] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:06,826 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:06,826 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:47:06,826 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731373163] [2022-02-20 23:47:06,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:06,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:47:06,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:06,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:06,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:06,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:47:06,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:06,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:47:06,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:06,839 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:08,660 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2022-02-20 23:47:08,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:47:08,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:47:08,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:08,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:08,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2022-02-20 23:47:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:08,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 196 transitions. [2022-02-20 23:47:08,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 196 transitions. [2022-02-20 23:47:08,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:08,837 INFO L225 Difference]: With dead ends: 183 [2022-02-20 23:47:08,837 INFO L226 Difference]: Without dead ends: 183 [2022-02-20 23:47:08,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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:47:08,837 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 4 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:08,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 743 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:47:08,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-02-20 23:47:08,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2022-02-20 23:47:08,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:08,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:08,841 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:08,842 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:08,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:08,845 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2022-02-20 23:47:08,846 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2022-02-20 23:47:08,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:08,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:08,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 183 states. [2022-02-20 23:47:08,847 INFO L87 Difference]: Start difference. First operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 183 states. [2022-02-20 23:47:08,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:08,850 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2022-02-20 23:47:08,850 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2022-02-20 23:47:08,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:08,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:08,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:08,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:08,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:08,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2022-02-20 23:47:08,854 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 10 [2022-02-20 23:47:08,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:08,854 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2022-02-20 23:47:08,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2022-02-20 23:47:08,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:47:08,855 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:08,855 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:08,877 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:47:09,078 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:47:09,078 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr0REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:09,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:09,078 INFO L85 PathProgramCache]: Analyzing trace with hash -882700124, now seen corresponding path program 1 times [2022-02-20 23:47:09,079 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:09,079 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750685471] [2022-02-20 23:47:09,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:09,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:09,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:09,081 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:47:09,082 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:47:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:09,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:47:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:09,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:09,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {4133#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(33bv32, 2bv32); {4133#true} is VALID [2022-02-20 23:47:09,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {4133#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {4133#true} is VALID [2022-02-20 23:47:09,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {4133#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {4133#true} is VALID [2022-02-20 23:47:09,180 INFO L290 TraceCheckUtils]: 3: Hoare triple {4133#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L588 {4133#true} is VALID [2022-02-20 23:47:09,180 INFO L290 TraceCheckUtils]: 4: Hoare triple {4133#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L588-1 {4133#true} is VALID [2022-02-20 23:47:09,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {4133#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {4133#true} is VALID [2022-02-20 23:47:09,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {4133#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {4133#true} is VALID [2022-02-20 23:47:09,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {4133#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {4133#true} is VALID [2022-02-20 23:47:09,181 INFO L272 TraceCheckUtils]: 8: Hoare triple {4133#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {4162#(and (= (_ bv0 32) |create_data_#in~prevData.offset|) (= |create_data_#in~prevData.base| (_ bv0 32)))} is VALID [2022-02-20 23:47:09,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {4162#(and (= (_ bv0 32) |create_data_#in~prevData.offset|) (= |create_data_#in~prevData.base| (_ bv0 32)))} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {4166#(not |create_data_#t~short4|)} is VALID [2022-02-20 23:47:09,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {4166#(not |create_data_#t~short4|)} assume #t~short4; {4134#false} is VALID [2022-02-20 23:47:09,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {4134#false} assume !(1bv1 == #valid[~prevData.base]); {4134#false} is VALID [2022-02-20 23:47:09,182 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:47:09,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:09,182 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:09,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750685471] [2022-02-20 23:47:09,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750685471] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:09,183 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:09,183 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:09,183 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534354617] [2022-02-20 23:47:09,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:09,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:47:09,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:09,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:09,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:09,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:09,194 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:09,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:09,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:09,195 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:09,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:09,927 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions. [2022-02-20 23:47:09,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:09,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:47:09,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:09,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:09,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 270 transitions. [2022-02-20 23:47:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 270 transitions. [2022-02-20 23:47:09,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 270 transitions. [2022-02-20 23:47:10,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:10,187 INFO L225 Difference]: With dead ends: 258 [2022-02-20 23:47:10,187 INFO L226 Difference]: Without dead ends: 258 [2022-02-20 23:47:10,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:10,188 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 79 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:10,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 545 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:47:10,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-02-20 23:47:10,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 222. [2022-02-20 23:47:10,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:10,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:10,192 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:10,192 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:10,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:10,196 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions. [2022-02-20 23:47:10,197 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 273 transitions. [2022-02-20 23:47:10,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:10,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:10,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 258 states. [2022-02-20 23:47:10,198 INFO L87 Difference]: Start difference. First operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 258 states. [2022-02-20 23:47:10,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:10,203 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions. [2022-02-20 23:47:10,203 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 273 transitions. [2022-02-20 23:47:10,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:10,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:10,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:10,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:10,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 273 transitions. [2022-02-20 23:47:10,208 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 273 transitions. Word has length 12 [2022-02-20 23:47:10,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:10,208 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 273 transitions. [2022-02-20 23:47:10,208 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,208 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 273 transitions. [2022-02-20 23:47:10,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:47:10,208 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:10,208 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:10,227 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:47:10,427 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:47:10,429 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr4REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:10,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:10,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893879, now seen corresponding path program 1 times [2022-02-20 23:47:10,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:10,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779256918] [2022-02-20 23:47:10,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:10,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:10,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:10,431 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:47:10,432 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:47:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:10,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:47:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:10,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:10,522 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:47:10,523 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:47:10,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {5170#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(33bv32, 2bv32); {5170#true} is VALID [2022-02-20 23:47:10,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {5170#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {5170#true} is VALID [2022-02-20 23:47:10,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {5170#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {5170#true} is VALID [2022-02-20 23:47:10,539 INFO L290 TraceCheckUtils]: 3: Hoare triple {5170#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L588 {5170#true} is VALID [2022-02-20 23:47:10,539 INFO L290 TraceCheckUtils]: 4: Hoare triple {5170#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L588-1 {5170#true} is VALID [2022-02-20 23:47:10,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {5170#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {5170#true} is VALID [2022-02-20 23:47:10,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {5170#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {5170#true} is VALID [2022-02-20 23:47:10,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {5170#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {5170#true} is VALID [2022-02-20 23:47:10,540 INFO L272 TraceCheckUtils]: 8: Hoare triple {5170#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {5170#true} is VALID [2022-02-20 23:47:10,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {5170#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {5170#true} is VALID [2022-02-20 23:47:10,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {5170#true} assume !#t~short4; {5170#true} is VALID [2022-02-20 23:47:10,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {5170#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {5208#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| create_data_~data~0.base))) (_ bv1 1)))} is VALID [2022-02-20 23:47:10,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {5208#(= (_ bv0 1) (bvadd (bvneg (bvneg (select |#valid| create_data_~data~0.base))) (_ bv1 1)))} assume !(1bv1 == #valid[~data~0.base]); {5171#false} is VALID [2022-02-20 23:47:10,547 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:47:10,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:10,547 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:10,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779256918] [2022-02-20 23:47:10,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779256918] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:10,547 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:10,547 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:10,548 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882232722] [2022-02-20 23:47:10,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:10,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:47:10,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:10,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:10,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:10,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:10,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:10,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:10,566 INFO L87 Difference]: Start difference. First operand 222 states and 273 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:11,121 INFO L93 Difference]: Finished difference Result 209 states and 245 transitions. [2022-02-20 23:47:11,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:11,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:47:11,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-20 23:47:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-20 23:47:11,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2022-02-20 23:47:11,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:11,300 INFO L225 Difference]: With dead ends: 209 [2022-02-20 23:47:11,301 INFO L226 Difference]: Without dead ends: 209 [2022-02-20 23:47:11,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:11,301 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 60 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:11,301 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 196 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:11,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-02-20 23:47:11,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-02-20 23:47:11,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:11,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 207 states, 136 states have (on average 1.7573529411764706) internal successors, (239), 202 states have internal predecessors, (239), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:11,305 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 207 states, 136 states have (on average 1.7573529411764706) internal successors, (239), 202 states have internal predecessors, (239), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:11,305 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 207 states, 136 states have (on average 1.7573529411764706) internal successors, (239), 202 states have internal predecessors, (239), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:11,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:11,309 INFO L93 Difference]: Finished difference Result 209 states and 245 transitions. [2022-02-20 23:47:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 245 transitions. [2022-02-20 23:47:11,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:11,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:11,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 136 states have (on average 1.7573529411764706) internal successors, (239), 202 states have internal predecessors, (239), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 209 states. [2022-02-20 23:47:11,310 INFO L87 Difference]: Start difference. First operand has 207 states, 136 states have (on average 1.7573529411764706) internal successors, (239), 202 states have internal predecessors, (239), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 209 states. [2022-02-20 23:47:11,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:11,313 INFO L93 Difference]: Finished difference Result 209 states and 245 transitions. [2022-02-20 23:47:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 245 transitions. [2022-02-20 23:47:11,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:11,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:11,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:11,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 136 states have (on average 1.7573529411764706) internal successors, (239), 202 states have internal predecessors, (239), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 243 transitions. [2022-02-20 23:47:11,331 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 243 transitions. Word has length 13 [2022-02-20 23:47:11,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:11,331 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 243 transitions. [2022-02-20 23:47:11,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,332 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 243 transitions. [2022-02-20 23:47:11,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:47:11,332 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:11,332 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:11,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:11,539 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:47:11,539 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr5REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:11,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:11,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893878, now seen corresponding path program 1 times [2022-02-20 23:47:11,540 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:11,540 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703091237] [2022-02-20 23:47:11,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:11,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:11,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:11,541 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:47:11,545 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:47:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:11,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:47:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:11,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:11,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:47:11,643 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:47:11,660 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:47:11,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {6045#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(33bv32, 2bv32); {6045#true} is VALID [2022-02-20 23:47:11,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {6045#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {6045#true} is VALID [2022-02-20 23:47:11,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {6045#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {6045#true} is VALID [2022-02-20 23:47:11,670 INFO L290 TraceCheckUtils]: 3: Hoare triple {6045#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L588 {6045#true} is VALID [2022-02-20 23:47:11,672 INFO L290 TraceCheckUtils]: 4: Hoare triple {6045#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L588-1 {6045#true} is VALID [2022-02-20 23:47:11,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {6045#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {6045#true} is VALID [2022-02-20 23:47:11,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {6045#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {6045#true} is VALID [2022-02-20 23:47:11,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {6045#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {6045#true} is VALID [2022-02-20 23:47:11,673 INFO L272 TraceCheckUtils]: 8: Hoare triple {6045#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {6045#true} is VALID [2022-02-20 23:47:11,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {6045#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {6045#true} is VALID [2022-02-20 23:47:11,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {6045#true} assume !#t~short4; {6045#true} is VALID [2022-02-20 23:47:11,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {6045#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {6083#(and (= (_ bv16 32) (select |#length| create_data_~data~0.base)) (= create_data_~data~0.offset (_ bv0 32)))} is VALID [2022-02-20 23:47:11,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {6083#(and (= (_ bv16 32) (select |#length| create_data_~data~0.base)) (= create_data_~data~0.offset (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, ~data~0.offset)), #length[~data~0.base]) && ~bvule32(~bvadd32(4bv32, ~data~0.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, ~data~0.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, ~data~0.offset))); {6046#false} is VALID [2022-02-20 23:47:11,675 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:47:11,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:11,675 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:11,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703091237] [2022-02-20 23:47:11,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703091237] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:11,676 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:11,676 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:11,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001414588] [2022-02-20 23:47:11,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:11,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:47:11,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:11,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:11,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:11,688 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:11,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:11,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:11,688 INFO L87 Difference]: Start difference. First operand 207 states and 243 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:12,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:12,226 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2022-02-20 23:47:12,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:12,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 23:47:12,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-02-20 23:47:12,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:12,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 174 transitions. [2022-02-20 23:47:12,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 174 transitions. [2022-02-20 23:47:12,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:12,398 INFO L225 Difference]: With dead ends: 194 [2022-02-20 23:47:12,398 INFO L226 Difference]: Without dead ends: 194 [2022-02-20 23:47:12,398 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:12,398 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 45 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:12,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 198 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:12,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-02-20 23:47:12,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2022-02-20 23:47:12,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:12,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 192 states, 136 states have (on average 1.536764705882353) internal successors, (209), 187 states have internal predecessors, (209), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:12,402 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 192 states, 136 states have (on average 1.536764705882353) internal successors, (209), 187 states have internal predecessors, (209), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:12,402 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 192 states, 136 states have (on average 1.536764705882353) internal successors, (209), 187 states have internal predecessors, (209), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:12,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:12,404 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2022-02-20 23:47:12,405 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 215 transitions. [2022-02-20 23:47:12,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:12,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:12,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 192 states, 136 states have (on average 1.536764705882353) internal successors, (209), 187 states have internal predecessors, (209), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 194 states. [2022-02-20 23:47:12,406 INFO L87 Difference]: Start difference. First operand has 192 states, 136 states have (on average 1.536764705882353) internal successors, (209), 187 states have internal predecessors, (209), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 194 states. [2022-02-20 23:47:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:12,408 INFO L93 Difference]: Finished difference Result 194 states and 215 transitions. [2022-02-20 23:47:12,408 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 215 transitions. [2022-02-20 23:47:12,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:12,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:12,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:12,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 136 states have (on average 1.536764705882353) internal successors, (209), 187 states have internal predecessors, (209), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions. [2022-02-20 23:47:12,412 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 13 [2022-02-20 23:47:12,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:12,412 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions. [2022-02-20 23:47:12,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:12,412 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions. [2022-02-20 23:47:12,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:47:12,412 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:12,413 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:47:12,419 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:47:12,619 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:47:12,619 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr8REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:12,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:12,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744652, now seen corresponding path program 1 times [2022-02-20 23:47:12,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:12,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574056729] [2022-02-20 23:47:12,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:12,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:12,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:12,622 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:47:12,623 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:47:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:12,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:47:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:12,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:12,722 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:47:12,722 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:47:12,759 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:47:12,792 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 24 treesize of output 12 [2022-02-20 23:47:12,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {6860#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(33bv32, 2bv32); {6860#true} is VALID [2022-02-20 23:47:12,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {6860#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {6860#true} is VALID [2022-02-20 23:47:12,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {6860#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {6860#true} is VALID [2022-02-20 23:47:12,801 INFO L290 TraceCheckUtils]: 3: Hoare triple {6860#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L588 {6860#true} is VALID [2022-02-20 23:47:12,801 INFO L290 TraceCheckUtils]: 4: Hoare triple {6860#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L588-1 {6860#true} is VALID [2022-02-20 23:47:12,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {6860#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {6860#true} is VALID [2022-02-20 23:47:12,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {6860#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {6860#true} is VALID [2022-02-20 23:47:12,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {6860#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {6860#true} is VALID [2022-02-20 23:47:12,802 INFO L272 TraceCheckUtils]: 8: Hoare triple {6860#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {6860#true} is VALID [2022-02-20 23:47:12,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {6860#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {6860#true} is VALID [2022-02-20 23:47:12,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {6860#true} assume !#t~short4; {6860#true} is VALID [2022-02-20 23:47:12,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {6860#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {6898#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |create_data_#t~malloc7.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:47:12,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {6898#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |create_data_#t~malloc7.base|)) (_ bv1 1)))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {6902#(= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1)))} is VALID [2022-02-20 23:47:12,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {6902#(= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1)))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {6902#(= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1)))} is VALID [2022-02-20 23:47:12,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {6902#(= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1)))} assume !!~bvslt32(~counter~0, 20bv32); {6902#(= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1)))} is VALID [2022-02-20 23:47:12,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {6902#(= (_ bv0 1) (bvadd (bvneg (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (_ bv1 1)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {6912#(= (bvadd (bvneg (select |#valid| |create_data_#t~mem9.base|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:47:12,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {6912#(= (bvadd (bvneg (select |#valid| |create_data_#t~mem9.base|)) (_ bv1 1)) (_ bv0 1))} assume !(1bv1 == #valid[#t~mem9.base]); {6861#false} is VALID [2022-02-20 23:47:12,809 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:47:12,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:12,809 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:12,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574056729] [2022-02-20 23:47:12,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574056729] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:12,809 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:12,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:12,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105899401] [2022-02-20 23:47:12,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:12,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:47:12,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:12,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:12,829 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:47:12,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:12,829 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:12,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:12,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:12,830 INFO L87 Difference]: Start difference. First operand 192 states and 213 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:14,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:14,305 INFO L93 Difference]: Finished difference Result 243 states and 277 transitions. [2022-02-20 23:47:14,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:14,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:47:14,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:14,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 191 transitions. [2022-02-20 23:47:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 191 transitions. [2022-02-20 23:47:14,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 191 transitions. [2022-02-20 23:47:14,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:14,494 INFO L225 Difference]: With dead ends: 243 [2022-02-20 23:47:14,494 INFO L226 Difference]: Without dead ends: 243 [2022-02-20 23:47:14,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:14,495 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 25 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:14,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 387 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:47:14,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-02-20 23:47:14,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 198. [2022-02-20 23:47:14,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:14,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand has 198 states, 142 states have (on average 1.5422535211267605) internal successors, (219), 193 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:14,499 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand has 198 states, 142 states have (on average 1.5422535211267605) internal successors, (219), 193 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:14,500 INFO L87 Difference]: Start difference. First operand 243 states. Second operand has 198 states, 142 states have (on average 1.5422535211267605) internal successors, (219), 193 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:14,504 INFO L93 Difference]: Finished difference Result 243 states and 277 transitions. [2022-02-20 23:47:14,504 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 277 transitions. [2022-02-20 23:47:14,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:14,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:14,505 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 142 states have (on average 1.5422535211267605) internal successors, (219), 193 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 243 states. [2022-02-20 23:47:14,506 INFO L87 Difference]: Start difference. First operand has 198 states, 142 states have (on average 1.5422535211267605) internal successors, (219), 193 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 243 states. [2022-02-20 23:47:14,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:14,509 INFO L93 Difference]: Finished difference Result 243 states and 277 transitions. [2022-02-20 23:47:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 277 transitions. [2022-02-20 23:47:14,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:14,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:14,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:14,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 142 states have (on average 1.5422535211267605) internal successors, (219), 193 states have internal predecessors, (219), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:14,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 223 transitions. [2022-02-20 23:47:14,512 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 223 transitions. Word has length 17 [2022-02-20 23:47:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:14,513 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 223 transitions. [2022-02-20 23:47:14,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:14,513 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 223 transitions. [2022-02-20 23:47:14,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:47:14,513 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:14,513 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:47:14,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-02-20 23:47:14,720 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:47:14,720 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:14,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:14,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744651, now seen corresponding path program 1 times [2022-02-20 23:47:14,721 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:14,721 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930527770] [2022-02-20 23:47:14,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:14,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:14,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:14,722 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:47:14,723 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:47:14,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:14,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:47:14,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:14,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:14,849 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:47:14,849 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:47:14,875 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:47:14,880 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:47:14,955 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 21 treesize of output 9 [2022-02-20 23:47:14,959 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 19 treesize of output 7 [2022-02-20 23:47:14,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {7846#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(33bv32, 2bv32); {7846#true} is VALID [2022-02-20 23:47:14,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {7846#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {7846#true} is VALID [2022-02-20 23:47:14,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {7846#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {7846#true} is VALID [2022-02-20 23:47:14,985 INFO L290 TraceCheckUtils]: 3: Hoare triple {7846#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L588 {7846#true} is VALID [2022-02-20 23:47:14,986 INFO L290 TraceCheckUtils]: 4: Hoare triple {7846#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L588-1 {7846#true} is VALID [2022-02-20 23:47:14,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {7846#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {7846#true} is VALID [2022-02-20 23:47:14,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {7846#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {7846#true} is VALID [2022-02-20 23:47:14,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {7846#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {7846#true} is VALID [2022-02-20 23:47:14,986 INFO L272 TraceCheckUtils]: 8: Hoare triple {7846#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {7846#true} is VALID [2022-02-20 23:47:14,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {7846#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {7846#true} is VALID [2022-02-20 23:47:14,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {7846#true} assume !#t~short4; {7846#true} is VALID [2022-02-20 23:47:14,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {7846#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {7884#(and (= |create_data_#t~malloc7.offset| (_ bv0 32)) (= (select |#length| |create_data_#t~malloc7.base|) (_ bv80 32)))} is VALID [2022-02-20 23:47:14,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {7884#(and (= |create_data_#t~malloc7.offset| (_ bv0 32)) (= (select |#length| |create_data_#t~malloc7.base|) (_ bv80 32)))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {7888#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:47:14,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {7888#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {7892#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:47:14,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {7892#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)))} assume !!~bvslt32(~counter~0, 20bv32); {7892#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:47:14,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {7892#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {7899#(and (= (_ bv80 32) (select |#length| |create_data_#t~mem9.base|)) (= create_data_~counter~0 (_ bv0 32)) (= |create_data_#t~mem9.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:14,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {7899#(and (= (_ bv80 32) (select |#length| |create_data_#t~mem9.base|)) (= create_data_~counter~0 (_ bv0 32)) (= |create_data_#t~mem9.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))), #length[#t~mem9.base]) && ~bvule32(~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), ~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))))) && ~bvule32(0bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)))); {7847#false} is VALID [2022-02-20 23:47:14,991 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:47:14,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:14,992 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:14,992 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1930527770] [2022-02-20 23:47:14,992 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1930527770] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:14,992 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:14,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:47:14,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116514337] [2022-02-20 23:47:14,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:14,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:47:14,994 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:14,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:15,009 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:47:15,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:47:15,010 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:15,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:47:15,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:15,010 INFO L87 Difference]: Start difference. First operand 198 states and 223 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:16,540 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-02-20 23:47:16,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:16,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:47:16,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:16,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2022-02-20 23:47:16,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:16,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2022-02-20 23:47:16,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 163 transitions. [2022-02-20 23:47:16,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:16,694 INFO L225 Difference]: With dead ends: 200 [2022-02-20 23:47:16,694 INFO L226 Difference]: Without dead ends: 200 [2022-02-20 23:47:16,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:47:16,694 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 5 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:16,694 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 404 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:47:16,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-02-20 23:47:16,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2022-02-20 23:47:16,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:16,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 198 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 193 states have internal predecessors, (215), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:16,697 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 198 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 193 states have internal predecessors, (215), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:16,698 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 198 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 193 states have internal predecessors, (215), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:16,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:16,700 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-02-20 23:47:16,700 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-02-20 23:47:16,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:16,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:16,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 193 states have internal predecessors, (215), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 200 states. [2022-02-20 23:47:16,701 INFO L87 Difference]: Start difference. First operand has 198 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 193 states have internal predecessors, (215), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 200 states. [2022-02-20 23:47:16,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:16,703 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-02-20 23:47:16,704 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-02-20 23:47:16,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:16,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:16,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:16,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 142 states have (on average 1.5140845070422535) internal successors, (215), 193 states have internal predecessors, (215), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2022-02-20 23:47:16,707 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 17 [2022-02-20 23:47:16,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:16,707 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2022-02-20 23:47:16,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2022-02-20 23:47:16,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:47:16,707 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:16,708 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:16,727 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:47:16,914 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:47:16,914 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr8REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:16,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:16,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184013, now seen corresponding path program 1 times [2022-02-20 23:47:16,915 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:16,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344972028] [2022-02-20 23:47:16,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:16,915 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:16,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:16,916 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:47:16,918 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:47:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:17,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:47:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:17,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:17,075 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:47:17,076 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:47:17,115 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 13 treesize of output 9 [2022-02-20 23:47:17,219 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:17,219 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 34 treesize of output 35 [2022-02-20 23:47:17,290 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 31 treesize of output 13 [2022-02-20 23:47:17,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {8704#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(33bv32, 2bv32); {8704#true} is VALID [2022-02-20 23:47:17,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {8704#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {8704#true} is VALID [2022-02-20 23:47:17,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {8704#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {8704#true} is VALID [2022-02-20 23:47:17,326 INFO L290 TraceCheckUtils]: 3: Hoare triple {8704#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L588 {8704#true} is VALID [2022-02-20 23:47:17,326 INFO L290 TraceCheckUtils]: 4: Hoare triple {8704#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L588-1 {8704#true} is VALID [2022-02-20 23:47:17,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {8704#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {8704#true} is VALID [2022-02-20 23:47:17,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {8704#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {8704#true} is VALID [2022-02-20 23:47:17,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {8704#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {8704#true} is VALID [2022-02-20 23:47:17,329 INFO L272 TraceCheckUtils]: 8: Hoare triple {8704#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {8704#true} is VALID [2022-02-20 23:47:17,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {8704#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {8704#true} is VALID [2022-02-20 23:47:17,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {8704#true} assume !#t~short4; {8704#true} is VALID [2022-02-20 23:47:17,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {8704#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {8742#(and (= (select |#valid| |create_data_#t~malloc7.base|) (_ bv1 1)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:47:17,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {8742#(and (= (select |#valid| |create_data_#t~malloc7.base|) (_ bv1 1)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {8746#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:47:17,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {8746#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {8746#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:47:17,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {8746#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} assume !!~bvslt32(~counter~0, 20bv32); {8746#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:47:17,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {8746#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {8756#(and (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:47:17,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {8756#(and (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {8746#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:47:17,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {8746#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {8746#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:47:17,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {8746#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {8746#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:47:17,345 INFO L290 TraceCheckUtils]: 19: Hoare triple {8746#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} assume !!~bvslt32(~counter~0, 20bv32); {8746#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:47:17,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {8746#(and (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {8772#(and (exists ((create_data_~data~0.base (_ BitVec 32))) (and (not (= create_data_~data~0.base |create_data_#t~mem9.base|)) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))) (= (select |#valid| |create_data_#t~mem9.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:17,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {8772#(and (exists ((create_data_~data~0.base (_ BitVec 32))) (and (not (= create_data_~data~0.base |create_data_#t~mem9.base|)) (= (bvadd (bvneg (select |#valid| create_data_~data~0.base)) (_ bv1 1)) (_ bv0 1)))) (= (select |#valid| |create_data_#t~mem9.base|) (_ bv1 1)))} assume !(1bv1 == #valid[#t~mem9.base]); {8705#false} is VALID [2022-02-20 23:47:17,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:47:17,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:17,400 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_176) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (_ bv1 1))) is different from false [2022-02-20 23:47:17,436 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_176) c_create_data_~data~0.base) .cse0))) (_ bv1 1))) is different from false [2022-02-20 23:47:17,470 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:17,471 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-02-20 23:47:17,474 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 28 [2022-02-20 23:47:17,477 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 13 treesize of output 9 [2022-02-20 23:47:17,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {8776#(= (select |#valid| |create_data_#t~mem9.base|) (_ bv1 1))} assume !(1bv1 == #valid[#t~mem9.base]); {8705#false} is VALID [2022-02-20 23:47:17,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {8780#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {8776#(= (select |#valid| |create_data_#t~mem9.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:17,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {8780#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))} assume !!~bvslt32(~counter~0, 20bv32); {8780#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))} is VALID [2022-02-20 23:47:17,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {8780#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {8780#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))} is VALID [2022-02-20 23:47:17,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {8780#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {8780#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))} is VALID [2022-02-20 23:47:17,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {8793#(forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_176) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (_ bv1 1)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {8780#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))} is VALID [2022-02-20 23:47:17,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {8797#(forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_176) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {8793#(forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_176) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (_ bv1 1)))} is VALID [2022-02-20 23:47:17,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {8797#(forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_176) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} assume !!~bvslt32(~counter~0, 20bv32); {8797#(forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_176) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} is VALID [2022-02-20 23:47:17,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {8797#(forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_176) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {8797#(forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_176) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} is VALID [2022-02-20 23:47:17,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {8807#(or (forall ((v_arrayElimCell_19 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| v_arrayElimCell_19)) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (bvneg (select |#valid| |create_data_#t~malloc7.base|)) (_ bv1 1))) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|))))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {8797#(forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_176) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} is VALID [2022-02-20 23:47:17,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {8704#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {8807#(or (forall ((v_arrayElimCell_19 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| v_arrayElimCell_19)) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (bvneg (select |#valid| |create_data_#t~malloc7.base|)) (_ bv1 1))) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|))))} is VALID [2022-02-20 23:47:17,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {8704#true} assume !#t~short4; {8704#true} is VALID [2022-02-20 23:47:17,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {8704#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {8704#true} is VALID [2022-02-20 23:47:17,572 INFO L272 TraceCheckUtils]: 8: Hoare triple {8704#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {8704#true} is VALID [2022-02-20 23:47:17,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {8704#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {8704#true} is VALID [2022-02-20 23:47:17,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {8704#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {8704#true} is VALID [2022-02-20 23:47:17,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {8704#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {8704#true} is VALID [2022-02-20 23:47:17,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {8704#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L588-1 {8704#true} is VALID [2022-02-20 23:47:17,573 INFO L290 TraceCheckUtils]: 3: Hoare triple {8704#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L588 {8704#true} is VALID [2022-02-20 23:47:17,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {8704#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {8704#true} is VALID [2022-02-20 23:47:17,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {8704#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {8704#true} is VALID [2022-02-20 23:47:17,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {8704#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(33bv32, 2bv32); {8704#true} is VALID [2022-02-20 23:47:17,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-02-20 23:47:17,573 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:17,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344972028] [2022-02-20 23:47:17,574 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344972028] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:17,574 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:47:17,574 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2022-02-20 23:47:17,574 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161893595] [2022-02-20 23:47:17,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:17,574 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:47:17,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:17,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:17,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:17,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:47:17,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:17,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:47:17,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2022-02-20 23:47:17,645 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:19,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:19,522 INFO L93 Difference]: Finished difference Result 203 states and 223 transitions. [2022-02-20 23:47:19,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:47:19,523 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:47:19,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2022-02-20 23:47:19,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2022-02-20 23:47:19,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 161 transitions. [2022-02-20 23:47:19,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:19,687 INFO L225 Difference]: With dead ends: 203 [2022-02-20 23:47:19,687 INFO L226 Difference]: Without dead ends: 203 [2022-02-20 23:47:19,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=64, Unknown=2, NotChecked=34, Total=132 [2022-02-20 23:47:19,687 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 28 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 337 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:19,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 640 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 212 Invalid, 0 Unknown, 337 Unchecked, 0.4s Time] [2022-02-20 23:47:19,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-02-20 23:47:19,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 197. [2022-02-20 23:47:19,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:19,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 203 states. Second operand has 197 states, 142 states have (on average 1.5) internal successors, (213), 192 states have internal predecessors, (213), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:19,691 INFO L74 IsIncluded]: Start isIncluded. First operand 203 states. Second operand has 197 states, 142 states have (on average 1.5) internal successors, (213), 192 states have internal predecessors, (213), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:19,691 INFO L87 Difference]: Start difference. First operand 203 states. Second operand has 197 states, 142 states have (on average 1.5) internal successors, (213), 192 states have internal predecessors, (213), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:19,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:19,699 INFO L93 Difference]: Finished difference Result 203 states and 223 transitions. [2022-02-20 23:47:19,699 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 223 transitions. [2022-02-20 23:47:19,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:19,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:19,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 197 states, 142 states have (on average 1.5) internal successors, (213), 192 states have internal predecessors, (213), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 203 states. [2022-02-20 23:47:19,700 INFO L87 Difference]: Start difference. First operand has 197 states, 142 states have (on average 1.5) internal successors, (213), 192 states have internal predecessors, (213), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 203 states. [2022-02-20 23:47:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:19,703 INFO L93 Difference]: Finished difference Result 203 states and 223 transitions. [2022-02-20 23:47:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 223 transitions. [2022-02-20 23:47:19,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:19,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:19,704 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:19,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:19,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 142 states have (on average 1.5) internal successors, (213), 192 states have internal predecessors, (213), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 217 transitions. [2022-02-20 23:47:19,706 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 217 transitions. Word has length 22 [2022-02-20 23:47:19,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:19,706 INFO L470 AbstractCegarLoop]: Abstraction has 197 states and 217 transitions. [2022-02-20 23:47:19,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:19,707 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 217 transitions. [2022-02-20 23:47:19,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:47:19,707 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:19,707 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:19,715 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:47:19,914 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:47:19,915 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:19,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:19,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184014, now seen corresponding path program 1 times [2022-02-20 23:47:19,915 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:19,915 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729923422] [2022-02-20 23:47:19,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:19,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:19,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:19,916 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:47:19,918 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:47:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:20,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:47:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:20,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:20,073 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:47:20,083 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:47:20,122 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 13 treesize of output 9 [2022-02-20 23:47:20,130 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:47:20,255 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:20,256 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 46 treesize of output 45 [2022-02-20 23:47:20,261 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 24 [2022-02-20 23:47:20,351 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 31 treesize of output 13 [2022-02-20 23:47:20,365 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 19 treesize of output 7 [2022-02-20 23:47:20,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {9653#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(33bv32, 2bv32); {9653#true} is VALID [2022-02-20 23:47:20,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {9653#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {9653#true} is VALID [2022-02-20 23:47:20,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {9653#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {9653#true} is VALID [2022-02-20 23:47:20,386 INFO L290 TraceCheckUtils]: 3: Hoare triple {9653#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L588 {9653#true} is VALID [2022-02-20 23:47:20,386 INFO L290 TraceCheckUtils]: 4: Hoare triple {9653#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L588-1 {9653#true} is VALID [2022-02-20 23:47:20,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {9653#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {9653#true} is VALID [2022-02-20 23:47:20,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {9653#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {9653#true} is VALID [2022-02-20 23:47:20,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {9653#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {9653#true} is VALID [2022-02-20 23:47:20,386 INFO L272 TraceCheckUtils]: 8: Hoare triple {9653#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {9653#true} is VALID [2022-02-20 23:47:20,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {9653#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {9653#true} is VALID [2022-02-20 23:47:20,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {9653#true} assume !#t~short4; {9653#true} is VALID [2022-02-20 23:47:20,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {9653#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {9691#(and (= |create_data_#t~malloc7.offset| (_ bv0 32)) (= (select |#length| |create_data_#t~malloc7.base|) (_ bv80 32)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} is VALID [2022-02-20 23:47:20,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {9691#(and (= |create_data_#t~malloc7.offset| (_ bv0 32)) (= (select |#length| |create_data_#t~malloc7.base|) (_ bv80 32)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {9695#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:20,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {9695#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {9699#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:20,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {9699#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} assume !!~bvslt32(~counter~0, 20bv32); {9699#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:20,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {9699#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {9706#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:20,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {9706#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {9699#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:20,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {9699#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {9699#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:20,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {9699#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {9716#(and (= create_data_~counter~0 (_ bv1 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:20,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {9716#(and (= create_data_~counter~0 (_ bv1 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} assume !!~bvslt32(~counter~0, 20bv32); {9716#(and (= create_data_~counter~0 (_ bv1 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:20,399 INFO L290 TraceCheckUtils]: 20: Hoare triple {9716#(and (= create_data_~counter~0 (_ bv1 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {9723#(and (= (_ bv80 32) (select |#length| |create_data_#t~mem9.base|)) (= create_data_~counter~0 (_ bv1 32)) (= |create_data_#t~mem9.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:20,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {9723#(and (= (_ bv80 32) (select |#length| |create_data_#t~mem9.base|)) (= create_data_~counter~0 (_ bv1 32)) (= |create_data_#t~mem9.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))), #length[#t~mem9.base]) && ~bvule32(~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), ~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))))) && ~bvule32(0bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)))); {9654#false} is VALID [2022-02-20 23:47:20,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:20,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:20,756 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (bvule (bvadd (_ bv8 32) (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_222) c_create_data_~data~0.base) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_222) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset)))) (bvule (bvadd (_ bv4 32) .cse1 .cse2) (bvadd (_ bv8 32) .cse1 .cse2))))) is different from false [2022-02-20 23:47:20,799 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_222) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_222) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_221) c_create_data_~data~0.base) .cse4))))))) is different from false [2022-02-20 23:47:20,862 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1) v_ArrVal_222) c_create_data_~data~0.base) .cse1)))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_222) c_create_data_~data~0.base) .cse3)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_221) c_create_data_~data~0.base) .cse3))))))) is different from false [2022-02-20 23:47:20,880 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:20,880 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-02-20 23:47:20,886 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:20,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-02-20 23:47:20,907 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 62 treesize of output 50 [2022-02-20 23:47:20,991 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 96 treesize of output 78 [2022-02-20 23:47:20,997 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 40 treesize of output 32 [2022-02-20 23:47:20,998 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 66 treesize of output 58 [2022-02-20 23:47:21,089 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:21,089 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-02-20 23:47:21,113 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 54 treesize of output 36 [2022-02-20 23:47:21,117 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 19 treesize of output 11 [2022-02-20 23:47:21,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {9727#(and (bvule (bvadd |create_data_#t~mem9.offset| (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd |create_data_#t~mem9.offset| (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd |create_data_#t~mem9.offset| (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| |create_data_#t~mem9.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))), #length[#t~mem9.base]) && ~bvule32(~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), ~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))))) && ~bvule32(0bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)))); {9654#false} is VALID [2022-02-20 23:47:21,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {9731#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {9727#(and (bvule (bvadd |create_data_#t~mem9.offset| (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd |create_data_#t~mem9.offset| (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd |create_data_#t~mem9.offset| (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| |create_data_#t~mem9.base|)))} is VALID [2022-02-20 23:47:21,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {9731#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))))} assume !!~bvslt32(~counter~0, 20bv32); {9731#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))))} is VALID [2022-02-20 23:47:21,588 INFO L290 TraceCheckUtils]: 18: Hoare triple {9738#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {9731#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))))} is VALID [2022-02-20 23:47:21,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {9738#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {9738#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} is VALID [2022-02-20 23:47:21,719 WARN L290 TraceCheckUtils]: 16: Hoare triple {9745#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_221) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {9738#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} is UNKNOWN [2022-02-20 23:47:21,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {9749#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_221) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {9745#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_221) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:21,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {9749#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_221) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} assume !!~bvslt32(~counter~0, 20bv32); {9749#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_221) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} is VALID [2022-02-20 23:47:21,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {9756#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_221) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {9749#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_221) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} is VALID [2022-02-20 23:47:21,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {9760#(and (bvule (bvadd (_ bv4 32) |create_data_#t~malloc7.offset|) (bvadd (_ bv8 32) |create_data_#t~malloc7.offset|)) (forall ((v_arrayElimCell_28 (_ BitVec 32))) (or (and (bvule (bvadd (_ bv8 32) |create_data_#t~malloc7.offset|) (select |#length| |create_data_#t~malloc7.base|)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|))) (and (forall ((v_arrayElimCell_27 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) v_arrayElimCell_28) (select |#length| v_arrayElimCell_27))) (= create_data_~data~0.base |create_data_#t~malloc7.base|)))) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {9756#(and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_221) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_222) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:21,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {9653#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {9760#(and (bvule (bvadd (_ bv4 32) |create_data_#t~malloc7.offset|) (bvadd (_ bv8 32) |create_data_#t~malloc7.offset|)) (forall ((v_arrayElimCell_28 (_ BitVec 32))) (or (and (bvule (bvadd (_ bv8 32) |create_data_#t~malloc7.offset|) (select |#length| |create_data_#t~malloc7.base|)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|))) (and (forall ((v_arrayElimCell_27 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) v_arrayElimCell_28) (select |#length| v_arrayElimCell_27))) (= create_data_~data~0.base |create_data_#t~malloc7.base|)))) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} is VALID [2022-02-20 23:47:21,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {9653#true} assume !#t~short4; {9653#true} is VALID [2022-02-20 23:47:21,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {9653#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {9653#true} is VALID [2022-02-20 23:47:21,760 INFO L272 TraceCheckUtils]: 8: Hoare triple {9653#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {9653#true} is VALID [2022-02-20 23:47:21,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {9653#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {9653#true} is VALID [2022-02-20 23:47:21,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {9653#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {9653#true} is VALID [2022-02-20 23:47:21,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {9653#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {9653#true} is VALID [2022-02-20 23:47:21,760 INFO L290 TraceCheckUtils]: 4: Hoare triple {9653#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L588-1 {9653#true} is VALID [2022-02-20 23:47:21,760 INFO L290 TraceCheckUtils]: 3: Hoare triple {9653#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L588 {9653#true} is VALID [2022-02-20 23:47:21,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {9653#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {9653#true} is VALID [2022-02-20 23:47:21,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {9653#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {9653#true} is VALID [2022-02-20 23:47:21,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {9653#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(33bv32, 2bv32); {9653#true} is VALID [2022-02-20 23:47:21,761 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-02-20 23:47:21,761 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:21,761 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729923422] [2022-02-20 23:47:21,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729923422] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:21,761 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:47:21,761 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-02-20 23:47:21,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665809714] [2022-02-20 23:47:21,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:21,762 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:47:21,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:21,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:22,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 29 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:22,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 23:47:22,380 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:22,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 23:47:22,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2022-02-20 23:47:22,381 INFO L87 Difference]: Start difference. First operand 197 states and 217 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:29,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:29,804 INFO L93 Difference]: Finished difference Result 209 states and 229 transitions. [2022-02-20 23:47:29,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:47:29,804 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:47:29,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2022-02-20 23:47:29,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 167 transitions. [2022-02-20 23:47:29,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 167 transitions. [2022-02-20 23:47:29,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:29,973 INFO L225 Difference]: With dead ends: 209 [2022-02-20 23:47:29,973 INFO L226 Difference]: Without dead ends: 209 [2022-02-20 23:47:29,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2022-02-20 23:47:29,973 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 15 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 316 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:29,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 968 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 464 Invalid, 0 Unknown, 316 Unchecked, 2.2s Time] [2022-02-20 23:47:29,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-02-20 23:47:29,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-02-20 23:47:29,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:29,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 207 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 202 states have internal predecessors, (223), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:29,976 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 207 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 202 states have internal predecessors, (223), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:29,977 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 207 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 202 states have internal predecessors, (223), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:29,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:29,979 INFO L93 Difference]: Finished difference Result 209 states and 229 transitions. [2022-02-20 23:47:29,979 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 229 transitions. [2022-02-20 23:47:29,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:29,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:29,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 202 states have internal predecessors, (223), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 209 states. [2022-02-20 23:47:29,980 INFO L87 Difference]: Start difference. First operand has 207 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 202 states have internal predecessors, (223), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 209 states. [2022-02-20 23:47:29,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:29,983 INFO L93 Difference]: Finished difference Result 209 states and 229 transitions. [2022-02-20 23:47:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 229 transitions. [2022-02-20 23:47:29,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:29,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:29,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:29,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:29,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 202 states have internal predecessors, (223), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 227 transitions. [2022-02-20 23:47:29,986 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 227 transitions. Word has length 22 [2022-02-20 23:47:29,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:29,987 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 227 transitions. [2022-02-20 23:47:29,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:29,987 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 227 transitions. [2022-02-20 23:47:29,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:47:29,987 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:29,987 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:30,012 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:47:30,195 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:47:30,196 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:30,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:30,196 INFO L85 PathProgramCache]: Analyzing trace with hash 200627285, now seen corresponding path program 2 times [2022-02-20 23:47:30,196 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:30,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458251555] [2022-02-20 23:47:30,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:47:30,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:30,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:30,220 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:47:30,221 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:47:30,399 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:47:30,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:47:30,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 23:47:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:30,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:30,473 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:47:30,473 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:47:30,482 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:47:30,516 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 13 treesize of output 9 [2022-02-20 23:47:30,524 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:47:30,651 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:30,651 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 46 treesize of output 45 [2022-02-20 23:47:30,656 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 24 [2022-02-20 23:47:30,824 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:30,824 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 46 treesize of output 45 [2022-02-20 23:47:30,830 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 24 [2022-02-20 23:47:30,952 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 31 treesize of output 13 [2022-02-20 23:47:30,962 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 19 treesize of output 7 [2022-02-20 23:47:30,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {10638#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(33bv32, 2bv32); {10638#true} is VALID [2022-02-20 23:47:30,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {10638#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {10638#true} is VALID [2022-02-20 23:47:30,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {10638#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {10638#true} is VALID [2022-02-20 23:47:30,988 INFO L290 TraceCheckUtils]: 3: Hoare triple {10638#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L588 {10638#true} is VALID [2022-02-20 23:47:30,988 INFO L290 TraceCheckUtils]: 4: Hoare triple {10638#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L588-1 {10638#true} is VALID [2022-02-20 23:47:30,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {10638#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {10638#true} is VALID [2022-02-20 23:47:30,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {10638#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {10638#true} is VALID [2022-02-20 23:47:30,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {10638#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {10638#true} is VALID [2022-02-20 23:47:30,988 INFO L272 TraceCheckUtils]: 8: Hoare triple {10638#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {10638#true} is VALID [2022-02-20 23:47:30,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {10638#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {10638#true} is VALID [2022-02-20 23:47:30,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {10638#true} assume !#t~short4; {10638#true} is VALID [2022-02-20 23:47:30,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {10638#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {10676#(and (= |create_data_#t~malloc7.offset| (_ bv0 32)) (= (select |#length| |create_data_#t~malloc7.base|) (_ bv80 32)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} is VALID [2022-02-20 23:47:30,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {10676#(and (= |create_data_#t~malloc7.offset| (_ bv0 32)) (= (select |#length| |create_data_#t~malloc7.base|) (_ bv80 32)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {10680#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:30,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {10680#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {10684#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:30,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {10684#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} assume !!~bvslt32(~counter~0, 20bv32); {10684#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:30,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {10684#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {10691#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:30,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {10691#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {10684#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:31,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {10684#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {10684#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:31,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {10684#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {10701#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:31,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {10701#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} assume !!~bvslt32(~counter~0, 20bv32); {10701#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:31,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {10701#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {10708#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:31,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {10708#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {10701#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:31,008 INFO L290 TraceCheckUtils]: 22: Hoare triple {10701#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {10701#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:31,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {10701#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {10718#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} is VALID [2022-02-20 23:47:31,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {10718#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} assume !!~bvslt32(~counter~0, 20bv32); {10718#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} is VALID [2022-02-20 23:47:31,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {10718#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {10725#(and (= (_ bv80 32) (select |#length| |create_data_#t~mem9.base|)) (= |create_data_#t~mem9.offset| (_ bv0 32)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} is VALID [2022-02-20 23:47:31,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {10725#(and (= (_ bv80 32) (select |#length| |create_data_#t~mem9.base|)) (= |create_data_#t~mem9.offset| (_ bv0 32)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))), #length[#t~mem9.base]) && ~bvule32(~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), ~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))))) && ~bvule32(0bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)))); {10639#false} is VALID [2022-02-20 23:47:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:31,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:31,386 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_285) c_create_data_~data~0.base) .cse2)))))) is different from false [2022-02-20 23:47:31,429 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_284) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_284) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_285) c_create_data_~data~0.base) .cse4))))))) is different from false [2022-02-20 23:47:31,489 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_284) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_285) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_284) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse2 .cse3) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false [2022-02-20 23:47:31,556 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_283)) (.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select .cse2 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_282) .cse0 v_ArrVal_284) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_285) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_283) c_create_data_~data~0.base) .cse5) v_ArrVal_284) c_create_data_~data~0.base) .cse5))) (.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse3 .cse4) (bvadd .cse3 .cse4 (_ bv12 32)))))) is different from false [2022-02-20 23:47:31,611 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_283) c_create_data_~data~0.base) .cse3) v_ArrVal_284)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 (_ bv8 32) .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_283))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_282) .cse5 v_ArrVal_284) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_285) c_create_data_~data~0.base) .cse6))))))))) is different from false [2022-02-20 23:47:31,692 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_283) c_create_data_~data~0.base) .cse2) v_ArrVal_284)) c_create_data_~data~0.base) .cse2)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_283))) (let ((.cse4 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_282) .cse4 v_ArrVal_284) c_create_data_~data~0.base) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_285) c_create_data_~data~0.base) .cse5))))))))) is different from false [2022-02-20 23:47:31,717 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:31,717 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2022-02-20 23:47:31,726 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:31,726 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2022-02-20 23:47:31,763 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 102 treesize of output 84 [2022-02-20 23:47:31,836 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 174 treesize of output 144 [2022-02-20 23:47:31,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 102 treesize of output 86 [2022-02-20 23:47:31,854 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 86 treesize of output 78 [2022-02-20 23:47:31,856 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 116 treesize of output 92 [2022-02-20 23:47:31,908 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:31,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-02-20 23:47:31,920 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:31,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2022-02-20 23:47:31,924 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:47:31,954 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 92 treesize of output 56 [2022-02-20 23:47:31,957 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:47:31,962 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 50 treesize of output 32 [2022-02-20 23:47:31,968 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 15 treesize of output 11 [2022-02-20 23:47:32,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {10729#(and (bvule (bvadd |create_data_#t~mem9.offset| (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd |create_data_#t~mem9.offset| (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd |create_data_#t~mem9.offset| (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| |create_data_#t~mem9.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))), #length[#t~mem9.base]) && ~bvule32(~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), ~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))))) && ~bvule32(0bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)))); {10639#false} is VALID [2022-02-20 23:47:32,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {10733#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {10729#(and (bvule (bvadd |create_data_#t~mem9.offset| (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd |create_data_#t~mem9.offset| (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd |create_data_#t~mem9.offset| (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| |create_data_#t~mem9.base|)))} is VALID [2022-02-20 23:47:32,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {10733#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))))} assume !!~bvslt32(~counter~0, 20bv32); {10733#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))))} is VALID [2022-02-20 23:47:32,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {10740#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {10733#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))))} is VALID [2022-02-20 23:47:32,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {10740#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {10740#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} is VALID [2022-02-20 23:47:32,748 WARN L290 TraceCheckUtils]: 21: Hoare triple {10747#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {10740#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} is UNKNOWN [2022-02-20 23:47:32,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {10751#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {10747#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:32,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {10751#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} assume !!~bvslt32(~counter~0, 20bv32); {10751#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} is VALID [2022-02-20 23:47:32,780 WARN L290 TraceCheckUtils]: 18: Hoare triple {10758#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {10751#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} is UNKNOWN [2022-02-20 23:47:32,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {10758#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {10758#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:33,230 WARN L290 TraceCheckUtils]: 16: Hoare triple {10765#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {10758#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is UNKNOWN [2022-02-20 23:47:33,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {10769#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {10765#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))))} is VALID [2022-02-20 23:47:33,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {10769#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))))} assume !!~bvslt32(~counter~0, 20bv32); {10769#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))))} is VALID [2022-02-20 23:47:33,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {10776#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv12 32)))))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {10769#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))))} is VALID [2022-02-20 23:47:33,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {10780#(and (bvule (bvadd (_ bv8 32) |create_data_#t~malloc7.offset|) (bvadd |create_data_#t~malloc7.offset| (_ bv12 32))) (bvule (bvadd |create_data_#t~malloc7.offset| (_ bv12 32)) (select |#length| |create_data_#t~malloc7.base|)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {10776#(and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_285) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))) (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_282) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_283) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_284) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv12 32)))))} is VALID [2022-02-20 23:47:33,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {10638#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {10780#(and (bvule (bvadd (_ bv8 32) |create_data_#t~malloc7.offset|) (bvadd |create_data_#t~malloc7.offset| (_ bv12 32))) (bvule (bvadd |create_data_#t~malloc7.offset| (_ bv12 32)) (select |#length| |create_data_#t~malloc7.base|)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} is VALID [2022-02-20 23:47:33,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {10638#true} assume !#t~short4; {10638#true} is VALID [2022-02-20 23:47:33,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {10638#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {10638#true} is VALID [2022-02-20 23:47:33,281 INFO L272 TraceCheckUtils]: 8: Hoare triple {10638#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {10638#true} is VALID [2022-02-20 23:47:33,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {10638#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {10638#true} is VALID [2022-02-20 23:47:33,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {10638#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {10638#true} is VALID [2022-02-20 23:47:33,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {10638#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {10638#true} is VALID [2022-02-20 23:47:33,281 INFO L290 TraceCheckUtils]: 4: Hoare triple {10638#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L588-1 {10638#true} is VALID [2022-02-20 23:47:33,282 INFO L290 TraceCheckUtils]: 3: Hoare triple {10638#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L588 {10638#true} is VALID [2022-02-20 23:47:33,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {10638#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {10638#true} is VALID [2022-02-20 23:47:33,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {10638#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {10638#true} is VALID [2022-02-20 23:47:33,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {10638#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(33bv32, 2bv32); {10638#true} is VALID [2022-02-20 23:47:33,282 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-02-20 23:47:33,282 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:33,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458251555] [2022-02-20 23:47:33,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1458251555] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:33,282 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:47:33,282 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2022-02-20 23:47:33,283 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693298900] [2022-02-20 23:47:33,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:33,283 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 23:47:33,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:33,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:36,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 34 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:36,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 23:47:36,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:36,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 23:47:36,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380 [2022-02-20 23:47:36,999 INFO L87 Difference]: Start difference. First operand 207 states and 227 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:49,363 INFO L93 Difference]: Finished difference Result 219 states and 239 transitions. [2022-02-20 23:47:49,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:47:49,363 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 23:47:49,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:49,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 172 transitions. [2022-02-20 23:47:49,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:49,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 172 transitions. [2022-02-20 23:47:49,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 172 transitions. [2022-02-20 23:47:49,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:49,557 INFO L225 Difference]: With dead ends: 219 [2022-02-20 23:47:49,557 INFO L226 Difference]: Without dead ends: 219 [2022-02-20 23:47:49,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=239, Unknown=6, NotChecked=222, Total=552 [2022-02-20 23:47:49,557 INFO L933 BasicCegarLoop]: 153 mSDtfsCounter, 24 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 517 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:49,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 1215 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 593 Invalid, 0 Unknown, 517 Unchecked, 3.0s Time] [2022-02-20 23:47:49,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-02-20 23:47:49,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2022-02-20 23:47:49,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:49,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 217 states, 162 states have (on average 1.4382716049382716) internal successors, (233), 212 states have internal predecessors, (233), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:49,560 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 217 states, 162 states have (on average 1.4382716049382716) internal successors, (233), 212 states have internal predecessors, (233), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:49,560 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 217 states, 162 states have (on average 1.4382716049382716) internal successors, (233), 212 states have internal predecessors, (233), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:49,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:49,563 INFO L93 Difference]: Finished difference Result 219 states and 239 transitions. [2022-02-20 23:47:49,563 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 239 transitions. [2022-02-20 23:47:49,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:49,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:49,564 INFO L74 IsIncluded]: Start isIncluded. First operand has 217 states, 162 states have (on average 1.4382716049382716) internal successors, (233), 212 states have internal predecessors, (233), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 219 states. [2022-02-20 23:47:49,564 INFO L87 Difference]: Start difference. First operand has 217 states, 162 states have (on average 1.4382716049382716) internal successors, (233), 212 states have internal predecessors, (233), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 219 states. [2022-02-20 23:47:49,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:49,567 INFO L93 Difference]: Finished difference Result 219 states and 239 transitions. [2022-02-20 23:47:49,567 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 239 transitions. [2022-02-20 23:47:49,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:49,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:49,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:49,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:49,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 162 states have (on average 1.4382716049382716) internal successors, (233), 212 states have internal predecessors, (233), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:47:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 237 transitions. [2022-02-20 23:47:49,570 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 237 transitions. Word has length 27 [2022-02-20 23:47:49,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:49,570 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 237 transitions. [2022-02-20 23:47:49,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:49,571 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 237 transitions. [2022-02-20 23:47:49,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:47:49,571 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:49,571 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:49,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-02-20 23:47:49,779 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:47:49,780 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2022-02-20 23:47:49,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:49,780 INFO L85 PathProgramCache]: Analyzing trace with hash 201129006, now seen corresponding path program 3 times [2022-02-20 23:47:49,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:49,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104623156] [2022-02-20 23:47:49,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 23:47:49,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:49,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:49,782 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:47:49,788 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:47:50,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 23:47:50,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:47:50,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-20 23:47:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:50,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:50,154 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:47:50,162 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:47:50,200 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 13 treesize of output 9 [2022-02-20 23:47:50,211 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:47:50,359 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:50,360 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 46 treesize of output 45 [2022-02-20 23:47:50,366 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 24 [2022-02-20 23:47:50,573 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:50,573 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 46 treesize of output 45 [2022-02-20 23:47:50,580 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 24 [2022-02-20 23:47:50,820 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:50,820 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 46 treesize of output 45 [2022-02-20 23:47:50,827 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 24 [2022-02-20 23:47:50,971 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 31 treesize of output 13 [2022-02-20 23:47:50,983 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 19 treesize of output 7 [2022-02-20 23:47:51,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {11703#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(33bv32, 2bv32); {11703#true} is VALID [2022-02-20 23:47:51,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {11703#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {11703#true} is VALID [2022-02-20 23:47:51,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {11703#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {11703#true} is VALID [2022-02-20 23:47:51,017 INFO L290 TraceCheckUtils]: 3: Hoare triple {11703#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L588 {11703#true} is VALID [2022-02-20 23:47:51,017 INFO L290 TraceCheckUtils]: 4: Hoare triple {11703#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L588-1 {11703#true} is VALID [2022-02-20 23:47:51,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {11703#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {11703#true} is VALID [2022-02-20 23:47:51,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {11703#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {11703#true} is VALID [2022-02-20 23:47:51,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {11703#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {11703#true} is VALID [2022-02-20 23:47:51,018 INFO L272 TraceCheckUtils]: 8: Hoare triple {11703#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {11703#true} is VALID [2022-02-20 23:47:51,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {11703#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {11703#true} is VALID [2022-02-20 23:47:51,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {11703#true} assume !#t~short4; {11703#true} is VALID [2022-02-20 23:47:51,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {11703#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {11741#(and (= |create_data_#t~malloc7.offset| (_ bv0 32)) (= (select |#length| |create_data_#t~malloc7.base|) (_ bv80 32)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} is VALID [2022-02-20 23:47:51,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {11741#(and (= |create_data_#t~malloc7.offset| (_ bv0 32)) (= (select |#length| |create_data_#t~malloc7.base|) (_ bv80 32)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {11745#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:51,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {11745#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {11749#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:51,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {11749#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} assume !!~bvslt32(~counter~0, 20bv32); {11749#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:51,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {11749#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {11756#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:51,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {11756#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {11749#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:51,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {11749#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {11749#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:51,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {11749#(and (= create_data_~counter~0 (_ bv0 32)) (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {11766#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:51,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {11766#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} assume !!~bvslt32(~counter~0, 20bv32); {11766#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:51,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {11766#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {11773#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:51,039 INFO L290 TraceCheckUtils]: 21: Hoare triple {11773#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {11766#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:51,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {11766#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {11766#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:51,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {11766#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (_ bv4294967295 32) create_data_~counter~0) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {11783#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} is VALID [2022-02-20 23:47:51,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {11783#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} assume !!~bvslt32(~counter~0, 20bv32); {11783#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} is VALID [2022-02-20 23:47:51,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {11783#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {11790#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} is VALID [2022-02-20 23:47:51,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {11790#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) |create_data_#t~mem9.base|) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {11783#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} is VALID [2022-02-20 23:47:51,047 INFO L290 TraceCheckUtils]: 27: Hoare triple {11783#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {11783#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} is VALID [2022-02-20 23:47:51,047 INFO L290 TraceCheckUtils]: 28: Hoare triple {11783#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)) (= (_ bv0 32) (bvadd create_data_~counter~0 (_ bv4294967294 32))))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {11800#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd create_data_~counter~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:51,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {11800#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd create_data_~counter~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} assume !!~bvslt32(~counter~0, 20bv32); {11800#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd create_data_~counter~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} is VALID [2022-02-20 23:47:51,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {11800#(and (= (_ bv80 32) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (= (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd create_data_~counter~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) create_data_~data~0.base)))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {11807#(and (= (_ bv80 32) (select |#length| |create_data_#t~mem9.base|)) (= (bvadd create_data_~counter~0 (_ bv4294967293 32)) (_ bv0 32)) (= |create_data_#t~mem9.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:51,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {11807#(and (= (_ bv80 32) (select |#length| |create_data_#t~mem9.base|)) (= (bvadd create_data_~counter~0 (_ bv4294967293 32)) (_ bv0 32)) (= |create_data_#t~mem9.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))), #length[#t~mem9.base]) && ~bvule32(~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), ~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))))) && ~bvule32(0bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)))); {11704#false} is VALID [2022-02-20 23:47:51,049 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:51,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:51,501 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_364) c_create_data_~data~0.base) .cse0) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_365) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_364) c_create_data_~data~0.base) (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse1 .cse2) (bvadd (_ bv8 32) .cse1 .cse2))))) is different from false [2022-02-20 23:47:51,552 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_364) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_364) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_365) c_create_data_~data~0.base) .cse4))))))) is different from false [2022-02-20 23:47:51,620 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_364) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_365) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_364) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse2 .cse3) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false [2022-02-20 23:47:51,753 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_362) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_363) c_create_data_~data~0.base) .cse2) v_ArrVal_364) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_363)) (.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_362) .cse3 v_ArrVal_364) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_365) c_create_data_~data~0.base) .cse4))))))) is different from false [2022-02-20 23:47:52,051 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_362) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_363) c_create_data_~data~0.base) .cse3) v_ArrVal_364)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_363))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_362) .cse5 v_ArrVal_364) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_365) c_create_data_~data~0.base) .cse6))))))))) is different from false [2022-02-20 23:47:52,131 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_362) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_363) c_create_data_~data~0.base) .cse3) v_ArrVal_364)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd (_ bv16 32) .cse0 .cse1)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_363))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (_ bv16 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_362) .cse5 v_ArrVal_364) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_365) c_create_data_~data~0.base) .cse6))))))))) is different from false [2022-02-20 23:47:52,535 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_360)) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_363))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_361) .cse0 v_ArrVal_362) .cse1 v_ArrVal_364) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_365) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse9 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_360))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse9))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_361) .cse7 v_ArrVal_362) (select (select (store .cse8 .cse7 v_ArrVal_363) c_create_data_~data~0.base) .cse9) v_ArrVal_364))) c_create_data_~data~0.base) .cse9))) (.cse6 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse5 .cse6 (_ bv12 32)) (bvadd (_ bv16 32) .cse5 .cse6))))) is different from false [2022-02-20 23:47:53,203 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_360))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_363))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_361) .cse1 v_ArrVal_362) .cse2 v_ArrVal_364) c_create_data_~data~0.base) .cse3) (bvmul c_create_data_~counter~0 (_ bv4 32))) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_365) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse11 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse11))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_360))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse11))) (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_361) .cse9 v_ArrVal_362) (select (select (store .cse10 .cse9 v_ArrVal_363) c_create_data_~data~0.base) .cse11) v_ArrVal_364)))) c_create_data_~data~0.base) .cse11))) (.cse7 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse6 .cse7 (_ bv12 32)) (bvadd (_ bv16 32) .cse6 .cse7))))) is different from false [2022-02-20 23:47:53,299 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_360))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_361) .cse2 v_ArrVal_362) (select (select (store .cse3 .cse2 v_ArrVal_363) c_create_data_~data~0.base) .cse4) v_ArrVal_364)))) c_create_data_~data~0.base) .cse4)))) (bvule (bvadd .cse0 (_ bv12 32)) (bvadd (_ bv16 32) .cse0)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse8))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_360))) (let ((.cse6 (select (select .cse10 c_create_data_~data~0.base) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_363))) (let ((.cse7 (select (select .cse9 c_create_data_~data~0.base) .cse8))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_361) .cse6 v_ArrVal_362) .cse7 v_ArrVal_364) c_create_data_~data~0.base) .cse8)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_365) c_create_data_~data~0.base) .cse8))))))))))) is different from false [2022-02-20 23:47:53,342 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:53,342 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 168 [2022-02-20 23:47:53,360 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:53,360 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 108 [2022-02-20 23:47:53,600 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 588 treesize of output 498 [2022-02-20 23:47:53,969 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 6342 treesize of output 5964 [2022-02-20 23:47:54,012 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 5960 treesize of output 5544 [2022-02-20 23:47:54,033 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 5544 treesize of output 5000 [2022-02-20 23:47:54,054 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 5000 treesize of output 4128 [2022-02-20 23:47:54,079 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 4128 treesize of output 3920 [2022-02-20 23:47:54,100 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 3920 treesize of output 3712 [2022-02-20 23:47:55,352 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:55,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2022-02-20 23:47:55,382 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:47:55,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2022-02-20 23:47:55,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:47:55,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 460 treesize of output 310 [2022-02-20 23:47:55,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:47:55,973 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 368 treesize of output 314 [2022-02-20 23:47:55,984 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 310 treesize of output 286 [2022-02-20 23:47:55,991 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 286 treesize of output 226 [2022-02-20 23:47:56,026 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 226 treesize of output 210 [2022-02-20 23:47:56,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {11811#(and (bvule (bvadd |create_data_#t~mem9.offset| (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd |create_data_#t~mem9.offset| (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd |create_data_#t~mem9.offset| (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| |create_data_#t~mem9.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))), #length[#t~mem9.base]) && ~bvule32(~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), ~bvadd32(4bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0))))) && ~bvule32(0bv32, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)))); {11704#false} is VALID [2022-02-20 23:47:56,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {11815#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {11811#(and (bvule (bvadd |create_data_#t~mem9.offset| (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd |create_data_#t~mem9.offset| (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd |create_data_#t~mem9.offset| (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| |create_data_#t~mem9.base|)))} is VALID [2022-02-20 23:47:56,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {11815#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))))} assume !!~bvslt32(~counter~0, 20bv32); {11815#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))))} is VALID [2022-02-20 23:47:57,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {11822#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {11815#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))))} is VALID [2022-02-20 23:47:57,115 INFO L290 TraceCheckUtils]: 27: Hoare triple {11822#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {11822#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} is VALID [2022-02-20 23:47:57,233 WARN L290 TraceCheckUtils]: 26: Hoare triple {11829#(and (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {11822#(and (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))))))} is UNKNOWN [2022-02-20 23:47:57,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {11833#(and (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {11829#(and (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv4 32) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:57,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {11833#(and (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} assume !!~bvslt32(~counter~0, 20bv32); {11833#(and (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:57,268 WARN L290 TraceCheckUtils]: 23: Hoare triple {11840#(and (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {11833#(and (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is UNKNOWN [2022-02-20 23:47:57,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {11840#(and (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {11840#(and (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:57,607 WARN L290 TraceCheckUtils]: 21: Hoare triple {11847#(and (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_363) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {11840#(and (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is UNKNOWN [2022-02-20 23:47:57,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {11851#(and (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {11847#(and (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_363) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:57,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {11851#(and (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} assume !!~bvslt32(~counter~0, 20bv32); {11851#(and (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is VALID [2022-02-20 23:47:57,795 WARN L290 TraceCheckUtils]: 18: Hoare triple {11858#(and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv16 32) (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (bvadd (_ bv16 32) (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} #t~post8 := ~counter~0;~counter~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {11851#(and (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv8 32) (bvmul (_ bv4 32) create_data_~counter~0)) (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is UNKNOWN [2022-02-20 23:47:57,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {11858#(and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv16 32) (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (bvadd (_ bv16 32) (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} havoc #t~mem9.base, #t~mem9.offset;havoc #t~nondet10; {11858#(and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv16 32) (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (bvadd (_ bv16 32) (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} is VALID [2022-02-20 23:47:59,892 WARN L290 TraceCheckUtils]: 16: Hoare triple {11865#(and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store (store (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) (select (select (store (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (bvadd (_ bv16 32) (select (select (store (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} SUMMARY for call write~intINTTYPE4(#t~nondet10, #t~mem9.base, ~bvadd32(#t~mem9.offset, ~bvmul32(4bv32, ~counter~0)), 4bv32); srcloc: L559-1 {11858#(and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv16 32) (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (bvadd (_ bv16 32) (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} is UNKNOWN [2022-02-20 23:48:02,046 WARN L290 TraceCheckUtils]: 15: Hoare triple {11869#(and (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (bvadd (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv16 32) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv16 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} SUMMARY for call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L559 {11865#(and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv16 32) (select (select (store (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store (store (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) (select (select (store (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (bvadd (_ bv16 32) (select (select (store (store (store |#memory_$Pointer$.offset| |create_data_#t~mem9.base| v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| |create_data_#t~mem9.base| v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0)))))} is UNKNOWN [2022-02-20 23:48:04,148 WARN L290 TraceCheckUtils]: 14: Hoare triple {11869#(and (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (bvadd (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv16 32) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv16 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} assume !!~bvslt32(~counter~0, 20bv32); {11869#(and (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (bvadd (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv16 32) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv16 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is UNKNOWN [2022-02-20 23:48:04,461 WARN L290 TraceCheckUtils]: 13: Hoare triple {11876#(and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv16 32)) (select |#length| (select (select (store (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv12 32)) (bvadd (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv16 32)))))} havoc #t~malloc7.base, #t~malloc7.offset;~counter~0 := 0bv32;~counter~0 := 0bv32; {11869#(and (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (bvmul (_ bv4 32) create_data_~counter~0) (_ bv12 32)) (bvadd (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv16 32) (bvmul (_ bv4 32) create_data_~counter~0)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv16 32) (bvmul (_ bv4 32) create_data_~counter~0)) (select |#length| (select (select (store (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))))} is UNKNOWN [2022-02-20 23:48:04,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {11880#(and (bvule (bvadd (_ bv16 32) |create_data_#t~malloc7.offset|) (select |#length| |create_data_#t~malloc7.base|)) (bvule (bvadd |create_data_#t~malloc7.offset| (_ bv12 32)) (bvadd (_ bv16 32) |create_data_#t~malloc7.offset|)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} SUMMARY for call write~$Pointer$(#t~malloc7.base, #t~malloc7.offset, ~data~0.base, ~bvadd32(4bv32, ~data~0.offset), 4bv32); srcloc: L556 {11876#(and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv16 32)) (select |#length| (select (select (store (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_365) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32)))))) (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv12 32)) (bvadd (select (select (store (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_361) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_362) (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_360) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_363) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) v_ArrVal_364) create_data_~data~0.base) (bvadd create_data_~data~0.offset (_ bv4 32))) (_ bv16 32)))))} is VALID [2022-02-20 23:48:04,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {11703#true} assume !#t~short4;havoc #t~mem3;havoc #t~short4;call #t~malloc6.base, #t~malloc6.offset := #Ultimate.allocOnHeap(16bv32);~data~0.base, ~data~0.offset := #t~malloc6.base, #t~malloc6.offset;havoc #t~malloc6.base, #t~malloc6.offset;call #t~malloc7.base, #t~malloc7.offset := #Ultimate.allocOnHeap(80bv32); {11880#(and (bvule (bvadd (_ bv16 32) |create_data_#t~malloc7.offset|) (select |#length| |create_data_#t~malloc7.base|)) (bvule (bvadd |create_data_#t~malloc7.offset| (_ bv12 32)) (bvadd (_ bv16 32) |create_data_#t~malloc7.offset|)) (not (= create_data_~data~0.base |create_data_#t~malloc7.base|)))} is VALID [2022-02-20 23:48:04,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {11703#true} assume !#t~short4; {11703#true} is VALID [2022-02-20 23:48:04,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {11703#true} ~prevData.base, ~prevData.offset := #in~prevData.base, #in~prevData.offset;#t~short4 := ~prevData.base != 0bv32 || ~prevData.offset != 0bv32; {11703#true} is VALID [2022-02-20 23:48:04,537 INFO L272 TraceCheckUtils]: 8: Hoare triple {11703#true} call append_#t~ret27#1.base, append_#t~ret27#1.offset := create_data(0bv32, 0bv32); {11703#true} is VALID [2022-02-20 23:48:04,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {11703#true} assume append_#t~mem26#1.base == 0bv32 && append_#t~mem26#1.offset == 0bv32;havoc append_#t~mem26#1.base, append_#t~mem26#1.offset; {11703#true} is VALID [2022-02-20 23:48:04,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {11703#true} SUMMARY for call append_#t~mem26#1.base, append_#t~mem26#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L589 {11703#true} is VALID [2022-02-20 23:48:04,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {11703#true} havoc append_#t~mem25#1.base, append_#t~mem25#1.offset; {11703#true} is VALID [2022-02-20 23:48:04,537 INFO L290 TraceCheckUtils]: 4: Hoare triple {11703#true} SUMMARY for call write~$Pointer$(append_#t~mem25#1.base, append_#t~mem25#1.offset, append_~node~0#1.base, ~bvadd32(4bv32, append_~node~0#1.offset), 4bv32); srcloc: L588-1 {11703#true} is VALID [2022-02-20 23:48:04,537 INFO L290 TraceCheckUtils]: 3: Hoare triple {11703#true} SUMMARY for call append_#t~mem25#1.base, append_#t~mem25#1.offset := read~$Pointer$(append_~pointerToList#1.base, append_~pointerToList#1.offset, 4bv32); srcloc: L588 {11703#true} is VALID [2022-02-20 23:48:04,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {11703#true} assume { :begin_inline_append } true;append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset, append_#t~mem25#1.base, append_#t~mem25#1.offset, append_#t~mem26#1.base, append_#t~mem26#1.offset, append_#t~ret27#1.base, append_#t~ret27#1.offset, append_#t~mem28#1.base, append_#t~mem28#1.offset, append_#t~mem29#1.base, append_#t~mem29#1.offset, append_#t~ret30#1.base, append_#t~ret30#1.offset, append_~pointerToList#1.base, append_~pointerToList#1.offset, append_~node~0#1.base, append_~node~0#1.offset;append_~pointerToList#1.base, append_~pointerToList#1.offset := append_#in~pointerToList#1.base, append_#in~pointerToList#1.offset;call append_#t~malloc24#1.base, append_#t~malloc24#1.offset := #Ultimate.allocOnHeap(8bv32);append_~node~0#1.base, append_~node~0#1.offset := append_#t~malloc24#1.base, append_#t~malloc24#1.offset;havoc append_#t~malloc24#1.base, append_#t~malloc24#1.offset; {11703#true} is VALID [2022-02-20 23:48:04,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {11703#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem32#1.base, main_#t~mem32#1.offset, main_#t~mem33#1.base, main_#t~mem33#1.offset, main_#t~mem34#1.base, main_#t~mem34#1.offset, main_#t~mem35#1.base, main_#t~mem35#1.offset, main_#t~mem36#1, main_#t~short37#1, main_#t~nondet31#1, main_#t~mem38#1.base, main_#t~mem38#1.offset, main_#t~mem39#1.base, main_#t~mem39#1.offset, main_#t~mem40#1.base, main_#t~mem40#1.offset, main_#t~mem41#1.base, main_#t~mem41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset, main_~dataNotFinished~0#1;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32);main_~dataNotFinished~0#1 := 0bv32; {11703#true} is VALID [2022-02-20 23:48:04,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {11703#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(33bv32, 2bv32); {11703#true} is VALID [2022-02-20 23:48:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 24 not checked. [2022-02-20 23:48:04,541 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:48:04,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104623156] [2022-02-20 23:48:04,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104623156] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:48:04,541 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:48:04,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 [2022-02-20 23:48:04,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797662561] [2022-02-20 23:48:04,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:48:04,542 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-02-20 23:48:04,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:04,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)