./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test1-3.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/ldv-memsafety/memleaks_test1-3.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 05263e1a00e36e758633b8fa4d2ee72b914ab3e1 ............................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/ldv-memsafety/memleaks_test1-3.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 05263e1a00e36e758633b8fa4d2ee72b914ab3e1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:01:15,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:01:15,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:01:15,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:01:15,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:01:15,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:01:15,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:01:15,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:01:15,902 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:01:15,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:01:15,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:01:15,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:01:15,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:01:15,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:01:15,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:01:15,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:01:15,919 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:01:15,920 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:01:15,922 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:01:15,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:01:15,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:01:15,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:01:15,932 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:01:15,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:01:15,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:01:15,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:01:15,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:01:15,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:01:15,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:01:15,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:01:15,941 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:01:15,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:01:15,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:01:15,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:01:15,946 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:01:15,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:01:15,947 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:01:15,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:01:15,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:01:15,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:01:15,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:01:15,950 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-07-29 01:01:15,970 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:01:15,970 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:01:15,971 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:01:15,972 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:01:15,972 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:01:15,972 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:01:15,973 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:01:15,973 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:01:15,973 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:01:15,973 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:01:15,974 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:01:15,974 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:01:15,974 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:01:15,974 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:01:15,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:01:15,975 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:01:15,975 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:01:15,975 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:01:15,976 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:01:15,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:01:15,976 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:01:15,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:01:15,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:01:15,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:01:15,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:01:15,978 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:01:15,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-29 01:01:15,978 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:01:15,979 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 05263e1a00e36e758633b8fa4d2ee72b914ab3e1 [2020-07-29 01:01:16,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:01:16,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:01:16,292 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:01:16,294 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:01:16,294 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:01:16,295 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test1-3.i [2020-07-29 01:01:16,367 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55c082ca0/bcf68a6e905d4e56b8abfb3013d750e1/FLAGd34351390 [2020-07-29 01:01:16,914 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:01:16,915 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test1-3.i [2020-07-29 01:01:16,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55c082ca0/bcf68a6e905d4e56b8abfb3013d750e1/FLAGd34351390 [2020-07-29 01:01:17,195 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55c082ca0/bcf68a6e905d4e56b8abfb3013d750e1 [2020-07-29 01:01:17,201 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:01:17,204 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:01:17,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:01:17,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:01:17,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:01:17,212 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:01:17" (1/1) ... [2020-07-29 01:01:17,215 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e68435d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:01:17, skipping insertion in model container [2020-07-29 01:01:17,215 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:01:17" (1/1) ... [2020-07-29 01:01:17,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:01:17,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:01:17,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:01:17,890 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) [2020-07-29 01:01:17,890 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5768137c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:01:17, skipping insertion in model container [2020-07-29 01:01:17,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:01:17,891 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2020-07-29 01:01:17,895 INFO L168 Benchmark]: Toolchain (without parser) took 690.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:01:17,895 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:01:17,896 INFO L168 Benchmark]: CACSL2BoogieTranslator took 684.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:01:17,898 INFO L336 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 684.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: 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... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:01:19,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:01:19,713 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:01:19,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:01:19,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:01:19,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:01:19,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:01:19,748 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:01:19,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:01:19,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:01:19,754 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:01:19,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:01:19,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:01:19,759 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:01:19,761 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:01:19,762 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:01:19,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:01:19,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:01:19,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:01:19,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:01:19,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:01:19,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:01:19,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:01:19,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:01:19,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:01:19,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:01:19,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:01:19,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:01:19,785 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:01:19,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:01:19,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:01:19,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:01:19,789 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:01:19,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:01:19,795 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:01:19,796 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:01:19,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:01:19,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:01:19,797 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:01:19,798 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:01:19,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:01:19,800 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2020-07-29 01:01:19,823 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:01:19,823 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:01:19,825 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:01:19,825 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:01:19,825 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:01:19,826 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:01:19,826 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 01:01:19,826 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:01:19,827 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:01:19,827 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 01:01:19,828 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:01:19,828 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-07-29 01:01:19,829 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-07-29 01:01:19,829 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-07-29 01:01:19,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-29 01:01:19,830 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-07-29 01:01:19,830 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-29 01:01:19,830 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-29 01:01:19,830 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 01:01:19,831 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:01:19,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:01:19,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:01:19,832 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-29 01:01:19,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-29 01:01:19,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:01:19,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:01:19,833 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-29 01:01:19,833 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-29 01:01:19,833 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-29 01:01:19,833 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:01:19,834 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-29 01:01:19,834 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 05263e1a00e36e758633b8fa4d2ee72b914ab3e1 [2020-07-29 01:01:20,197 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:01:20,213 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:01:20,217 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:01:20,219 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:01:20,222 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:01:20,223 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test1-3.i [2020-07-29 01:01:20,278 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea1347d98/2d27c3c0d64448138ed6eab65d21ec7e/FLAG476419de2 [2020-07-29 01:01:20,835 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:01:20,836 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test1-3.i [2020-07-29 01:01:20,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea1347d98/2d27c3c0d64448138ed6eab65d21ec7e/FLAG476419de2 [2020-07-29 01:01:21,100 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea1347d98/2d27c3c0d64448138ed6eab65d21ec7e [2020-07-29 01:01:21,103 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:01:21,105 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-07-29 01:01:21,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:01:21,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:01:21,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:01:21,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:01:21" (1/1) ... [2020-07-29 01:01:21,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b2b8652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:01:21, skipping insertion in model container [2020-07-29 01:01:21,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:01:21" (1/1) ... [2020-07-29 01:01:21,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:01:21,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:01:21,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:01:21,685 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2020-07-29 01:01:21,703 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:01:21,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:01:21,787 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:01:21,856 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:01:21,974 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:01:21,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:01:21 WrapperNode [2020-07-29 01:01:21,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:01:21,977 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:01:21,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:01:21,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:01:21,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:01:21" (1/1) ... [2020-07-29 01:01:21,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:01:21" (1/1) ... [2020-07-29 01:01:22,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:01:21" (1/1) ... [2020-07-29 01:01:22,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:01:21" (1/1) ... [2020-07-29 01:01:22,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:01:21" (1/1) ... [2020-07-29 01:01:22,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:01:21" (1/1) ... [2020-07-29 01:01:22,083 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:01:21" (1/1) ... [2020-07-29 01:01:22,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:01:22,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:01:22,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:01:22,095 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:01:22,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:01:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-29 01:01:22,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-29 01:01:22,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:01:22,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2020-07-29 01:01:22,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2020-07-29 01:01:22,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-29 01:01:22,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-29 01:01:22,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-29 01:01:22,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-29 01:01:22,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-29 01:01:22,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2020-07-29 01:01:22,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2020-07-29 01:01:22,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2020-07-29 01:01:22,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2020-07-29 01:01:22,170 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2020-07-29 01:01:22,170 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2020-07-29 01:01:22,170 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2020-07-29 01:01:22,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2020-07-29 01:01:22,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2020-07-29 01:01:22,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2020-07-29 01:01:22,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2020-07-29 01:01:22,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2020-07-29 01:01:22,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2020-07-29 01:01:22,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2020-07-29 01:01:22,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2020-07-29 01:01:22,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2020-07-29 01:01:22,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2020-07-29 01:01:22,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2020-07-29 01:01:22,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2020-07-29 01:01:22,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2020-07-29 01:01:22,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2020-07-29 01:01:22,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2020-07-29 01:01:22,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2020-07-29 01:01:22,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2020-07-29 01:01:22,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2020-07-29 01:01:22,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2020-07-29 01:01:22,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2020-07-29 01:01:22,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2020-07-29 01:01:22,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2020-07-29 01:01:22,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2020-07-29 01:01:22,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2020-07-29 01:01:22,177 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2020-07-29 01:01:22,177 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2020-07-29 01:01:22,178 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2020-07-29 01:01:22,178 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-29 01:01:22,178 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2020-07-29 01:01:22,178 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-07-29 01:01:22,178 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2020-07-29 01:01:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-29 01:01:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-29 01:01:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-29 01:01:22,179 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-29 01:01:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-29 01:01:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-29 01:01:22,180 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-29 01:01:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-29 01:01:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-29 01:01:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-29 01:01:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-29 01:01:22,181 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-29 01:01:22,182 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-29 01:01:22,182 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-29 01:01:22,182 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-29 01:01:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-29 01:01:22,183 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-29 01:01:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-29 01:01:22,184 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-29 01:01:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-29 01:01:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-29 01:01:22,185 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-29 01:01:22,186 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-29 01:01:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-29 01:01:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-29 01:01:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-29 01:01:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-29 01:01:22,187 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-29 01:01:22,188 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-29 01:01:22,188 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-29 01:01:22,188 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-29 01:01:22,188 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-29 01:01:22,188 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-29 01:01:22,189 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-29 01:01:22,189 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-29 01:01:22,189 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-29 01:01:22,189 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-29 01:01:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-29 01:01:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-29 01:01:22,190 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-29 01:01:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-29 01:01:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-29 01:01:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-29 01:01:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-29 01:01:22,191 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-29 01:01:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-29 01:01:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-29 01:01:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-29 01:01:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-29 01:01:22,192 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-29 01:01:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-29 01:01:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-29 01:01:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-29 01:01:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-29 01:01:22,193 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-29 01:01:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-29 01:01:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-29 01:01:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-29 01:01:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-29 01:01:22,194 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-29 01:01:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-29 01:01:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-29 01:01:22,195 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-29 01:01:22,196 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-29 01:01:22,196 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-29 01:01:22,196 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-29 01:01:22,197 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-29 01:01:22,197 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-29 01:01:22,197 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-29 01:01:22,198 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-29 01:01:22,198 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-29 01:01:22,198 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-29 01:01:22,198 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-29 01:01:22,199 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-29 01:01:22,199 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-29 01:01:22,199 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-29 01:01:22,199 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-29 01:01:22,200 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-29 01:01:22,201 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-29 01:01:22,204 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-29 01:01:22,204 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-29 01:01:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-29 01:01:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-29 01:01:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-29 01:01:22,206 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-29 01:01:22,206 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-29 01:01:22,206 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-29 01:01:22,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-29 01:01:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-29 01:01:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-29 01:01:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-29 01:01:22,215 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-29 01:01:22,215 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-29 01:01:22,215 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-29 01:01:22,216 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-29 01:01:22,216 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-29 01:01:22,216 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-29 01:01:22,216 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-29 01:01:22,216 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-29 01:01:22,217 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-29 01:01:22,217 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-29 01:01:22,217 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-29 01:01:22,217 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-29 01:01:22,218 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-29 01:01:22,218 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-29 01:01:22,218 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-29 01:01:22,218 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-29 01:01:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2020-07-29 01:01:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-29 01:01:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2020-07-29 01:01:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2020-07-29 01:01:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2020-07-29 01:01:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2020-07-29 01:01:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2020-07-29 01:01:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-29 01:01:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2020-07-29 01:01:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-07-29 01:01:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2020-07-29 01:01:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-29 01:01:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2020-07-29 01:01:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2020-07-29 01:01:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2020-07-29 01:01:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-29 01:01:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2020-07-29 01:01:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2020-07-29 01:01:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2020-07-29 01:01:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2020-07-29 01:01:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2020-07-29 01:01:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2020-07-29 01:01:22,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:01:22,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2020-07-29 01:01:22,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2020-07-29 01:01:22,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2020-07-29 01:01:22,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2020-07-29 01:01:22,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2020-07-29 01:01:22,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-29 01:01:22,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-29 01:01:22,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2020-07-29 01:01:22,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2020-07-29 01:01:22,226 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2020-07-29 01:01:22,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2020-07-29 01:01:22,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2020-07-29 01:01:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2020-07-29 01:01:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2020-07-29 01:01:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2020-07-29 01:01:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2020-07-29 01:01:22,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2020-07-29 01:01:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2020-07-29 01:01:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2020-07-29 01:01:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2020-07-29 01:01:22,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2020-07-29 01:01:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2020-07-29 01:01:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure f [2020-07-29 01:01:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure g [2020-07-29 01:01:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2020-07-29 01:01:22,229 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-29 01:01:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-29 01:01:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:01:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-29 01:01:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:01:22,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2020-07-29 01:01:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2020-07-29 01:01:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2020-07-29 01:01:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2020-07-29 01:01:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2020-07-29 01:01:22,947 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-29 01:01:23,393 WARN L775 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2020-07-29 01:01:23,844 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:01:23,844 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-29 01:01:23,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:01:23 BoogieIcfgContainer [2020-07-29 01:01:23,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:01:23,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-29 01:01:23,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-29 01:01:23,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-29 01:01:23,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.07 01:01:21" (1/3) ... [2020-07-29 01:01:23,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d5313e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:01:23, skipping insertion in model container [2020-07-29 01:01:23,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:01:21" (2/3) ... [2020-07-29 01:01:23,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d5313e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.07 01:01:23, skipping insertion in model container [2020-07-29 01:01:23,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:01:23" (3/3) ... [2020-07-29 01:01:23,857 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test1-3.i [2020-07-29 01:01:23,869 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-29 01:01:23,878 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 74 error locations. [2020-07-29 01:01:23,892 INFO L251 AbstractCegarLoop]: Starting to check reachability of 74 error locations. [2020-07-29 01:01:23,913 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-29 01:01:23,913 INFO L376 AbstractCegarLoop]: Hoare is false [2020-07-29 01:01:23,913 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-29 01:01:23,913 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:01:23,913 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:01:23,913 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-29 01:01:23,914 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:01:23,914 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-29 01:01:23,931 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states. [2020-07-29 01:01:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-29 01:01:23,942 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:01:23,943 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:01:23,944 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:01:23,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:01:23,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1839111754, now seen corresponding path program 1 times [2020-07-29 01:01:23,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:01:23,964 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825487465] [2020-07-29 01:01:23,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-29 01:01:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:24,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:01:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:24,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:01:24,211 INFO L263 TraceCheckUtils]: 0: Hoare triple {98#true} call ULTIMATE.init(); {98#true} is VALID [2020-07-29 01:01:24,212 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {98#true} is VALID [2020-07-29 01:01:24,212 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-29 01:01:24,213 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {98#true} {98#true} #442#return; {98#true} is VALID [2020-07-29 01:01:24,213 INFO L263 TraceCheckUtils]: 4: Hoare triple {98#true} call main(); {98#true} is VALID [2020-07-29 01:01:24,214 INFO L263 TraceCheckUtils]: 5: Hoare triple {98#true} call entry_point(); {98#true} is VALID [2020-07-29 01:01:24,214 INFO L263 TraceCheckUtils]: 6: Hoare triple {98#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {98#true} is VALID [2020-07-29 01:01:24,214 INFO L280 TraceCheckUtils]: 7: Hoare triple {98#true} ~size := #in~size; {98#true} is VALID [2020-07-29 01:01:24,221 INFO L280 TraceCheckUtils]: 8: Hoare triple {98#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset; {127#(= (_ bv0 32) |ldv_malloc_#res.offset|)} is VALID [2020-07-29 01:01:24,224 INFO L280 TraceCheckUtils]: 9: Hoare triple {127#(= (_ bv0 32) |ldv_malloc_#res.offset|)} assume true; {127#(= (_ bv0 32) |ldv_malloc_#res.offset|)} is VALID [2020-07-29 01:01:24,226 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {127#(= (_ bv0 32) |ldv_malloc_#res.offset|)} {98#true} #432#return; {134#(= (_ bv0 32) |entry_point_#t~ret38.offset|)} is VALID [2020-07-29 01:01:24,227 INFO L280 TraceCheckUtils]: 11: Hoare triple {134#(= (_ bv0 32) |entry_point_#t~ret38.offset|)} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {138#(= (_ bv0 32) entry_point_~p~0.offset)} is VALID [2020-07-29 01:01:24,228 INFO L280 TraceCheckUtils]: 12: Hoare triple {138#(= (_ bv0 32) entry_point_~p~0.offset)} assume !(0bv32 == ~p~0.offset); {99#false} is VALID [2020-07-29 01:01:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:01:24,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:01:24,318 INFO L280 TraceCheckUtils]: 12: Hoare triple {138#(= (_ bv0 32) entry_point_~p~0.offset)} assume !(0bv32 == ~p~0.offset); {99#false} is VALID [2020-07-29 01:01:24,319 INFO L280 TraceCheckUtils]: 11: Hoare triple {134#(= (_ bv0 32) |entry_point_#t~ret38.offset|)} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {138#(= (_ bv0 32) entry_point_~p~0.offset)} is VALID [2020-07-29 01:01:24,321 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {127#(= (_ bv0 32) |ldv_malloc_#res.offset|)} {98#true} #432#return; {134#(= (_ bv0 32) |entry_point_#t~ret38.offset|)} is VALID [2020-07-29 01:01:24,322 INFO L280 TraceCheckUtils]: 9: Hoare triple {127#(= (_ bv0 32) |ldv_malloc_#res.offset|)} assume true; {127#(= (_ bv0 32) |ldv_malloc_#res.offset|)} is VALID [2020-07-29 01:01:24,323 INFO L280 TraceCheckUtils]: 8: Hoare triple {98#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset; {127#(= (_ bv0 32) |ldv_malloc_#res.offset|)} is VALID [2020-07-29 01:01:24,323 INFO L280 TraceCheckUtils]: 7: Hoare triple {98#true} ~size := #in~size; {98#true} is VALID [2020-07-29 01:01:24,323 INFO L263 TraceCheckUtils]: 6: Hoare triple {98#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {98#true} is VALID [2020-07-29 01:01:24,324 INFO L263 TraceCheckUtils]: 5: Hoare triple {98#true} call entry_point(); {98#true} is VALID [2020-07-29 01:01:24,324 INFO L263 TraceCheckUtils]: 4: Hoare triple {98#true} call main(); {98#true} is VALID [2020-07-29 01:01:24,325 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {98#true} {98#true} #442#return; {98#true} is VALID [2020-07-29 01:01:24,325 INFO L280 TraceCheckUtils]: 2: Hoare triple {98#true} assume true; {98#true} is VALID [2020-07-29 01:01:24,325 INFO L280 TraceCheckUtils]: 1: Hoare triple {98#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {98#true} is VALID [2020-07-29 01:01:24,325 INFO L263 TraceCheckUtils]: 0: Hoare triple {98#true} call ULTIMATE.init(); {98#true} is VALID [2020-07-29 01:01:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:01:24,328 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825487465] [2020-07-29 01:01:24,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:01:24,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-07-29 01:01:24,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134635545] [2020-07-29 01:01:24,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-29 01:01:24,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:01:24,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:01:24,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:24,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:01:24,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:01:24,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:01:24,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:01:24,391 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 5 states. [2020-07-29 01:01:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:24,518 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-07-29 01:01:24,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:01:24,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-29 01:01:24,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:01:24,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:01:24,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-07-29 01:01:24,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:01:24,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-07-29 01:01:24,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2020-07-29 01:01:24,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:24,619 INFO L225 Difference]: With dead ends: 24 [2020-07-29 01:01:24,619 INFO L226 Difference]: Without dead ends: 21 [2020-07-29 01:01:24,622 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:01:24,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-29 01:01:24,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-29 01:01:24,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:01:24,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-29 01:01:24,664 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-29 01:01:24,664 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-29 01:01:24,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:24,676 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-29 01:01:24,677 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-29 01:01:24,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:24,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:24,678 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-29 01:01:24,678 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-29 01:01:24,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:24,683 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-29 01:01:24,683 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-29 01:01:24,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:24,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:24,684 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:01:24,684 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:01:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-29 01:01:24,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2020-07-29 01:01:24,688 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 13 [2020-07-29 01:01:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:01:24,689 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2020-07-29 01:01:24,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:01:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-29 01:01:24,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-29 01:01:24,690 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:01:24,691 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:01:24,905 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-29 01:01:24,907 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:01:24,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:01:24,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1177889137, now seen corresponding path program 1 times [2020-07-29 01:01:24,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:01:24,912 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761924130] [2020-07-29 01:01:24,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-29 01:01:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:25,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:01:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:25,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:01:25,208 INFO L263 TraceCheckUtils]: 0: Hoare triple {267#true} call ULTIMATE.init(); {267#true} is VALID [2020-07-29 01:01:25,209 INFO L280 TraceCheckUtils]: 1: Hoare triple {267#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {275#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:01:25,209 INFO L280 TraceCheckUtils]: 2: Hoare triple {275#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume true; {275#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:01:25,210 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {275#(bvult (_ bv0 32) |#StackHeapBarrier|)} {267#true} #442#return; {275#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:01:25,211 INFO L263 TraceCheckUtils]: 4: Hoare triple {275#(bvult (_ bv0 32) |#StackHeapBarrier|)} call main(); {275#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:01:25,211 INFO L263 TraceCheckUtils]: 5: Hoare triple {275#(bvult (_ bv0 32) |#StackHeapBarrier|)} call entry_point(); {275#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:01:25,212 INFO L263 TraceCheckUtils]: 6: Hoare triple {275#(bvult (_ bv0 32) |#StackHeapBarrier|)} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {275#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:01:25,213 INFO L280 TraceCheckUtils]: 7: Hoare triple {275#(bvult (_ bv0 32) |#StackHeapBarrier|)} ~size := #in~size; {275#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2020-07-29 01:01:25,214 INFO L280 TraceCheckUtils]: 8: Hoare triple {275#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset; {297#(and (not (= |ldv_malloc_#res.base| (_ bv0 32))) (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|))} is VALID [2020-07-29 01:01:25,215 INFO L280 TraceCheckUtils]: 9: Hoare triple {297#(and (not (= |ldv_malloc_#res.base| (_ bv0 32))) (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|))} assume true; {297#(and (not (= |ldv_malloc_#res.base| (_ bv0 32))) (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|))} is VALID [2020-07-29 01:01:25,216 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {297#(and (not (= |ldv_malloc_#res.base| (_ bv0 32))) (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|))} {275#(bvult (_ bv0 32) |#StackHeapBarrier|)} #432#return; {304#(and (bvult |entry_point_#t~ret38.base| |#StackHeapBarrier|) (not (= |entry_point_#t~ret38.base| (_ bv0 32))))} is VALID [2020-07-29 01:01:25,217 INFO L280 TraceCheckUtils]: 11: Hoare triple {304#(and (bvult |entry_point_#t~ret38.base| |#StackHeapBarrier|) (not (= |entry_point_#t~ret38.base| (_ bv0 32))))} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {308#(and (bvult entry_point_~p~0.base |#StackHeapBarrier|) (not (= entry_point_~p~0.base (_ bv0 32))))} is VALID [2020-07-29 01:01:25,218 INFO L280 TraceCheckUtils]: 12: Hoare triple {308#(and (bvult entry_point_~p~0.base |#StackHeapBarrier|) (not (= entry_point_~p~0.base (_ bv0 32))))} assume 0bv32 == ~p~0.offset; {308#(and (bvult entry_point_~p~0.base |#StackHeapBarrier|) (not (= entry_point_~p~0.base (_ bv0 32))))} is VALID [2020-07-29 01:01:25,218 INFO L280 TraceCheckUtils]: 13: Hoare triple {308#(and (bvult entry_point_~p~0.base |#StackHeapBarrier|) (not (= entry_point_~p~0.base (_ bv0 32))))} assume !~bvult32(~p~0.base, #StackHeapBarrier); {268#false} is VALID [2020-07-29 01:01:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:01:25,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:01:25,441 INFO L280 TraceCheckUtils]: 13: Hoare triple {315#(bvult entry_point_~p~0.base |#StackHeapBarrier|)} assume !~bvult32(~p~0.base, #StackHeapBarrier); {268#false} is VALID [2020-07-29 01:01:25,442 INFO L280 TraceCheckUtils]: 12: Hoare triple {315#(bvult entry_point_~p~0.base |#StackHeapBarrier|)} assume 0bv32 == ~p~0.offset; {315#(bvult entry_point_~p~0.base |#StackHeapBarrier|)} is VALID [2020-07-29 01:01:25,443 INFO L280 TraceCheckUtils]: 11: Hoare triple {322#(bvult |entry_point_#t~ret38.base| |#StackHeapBarrier|)} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {315#(bvult entry_point_~p~0.base |#StackHeapBarrier|)} is VALID [2020-07-29 01:01:25,444 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {329#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} {267#true} #432#return; {322#(bvult |entry_point_#t~ret38.base| |#StackHeapBarrier|)} is VALID [2020-07-29 01:01:25,445 INFO L280 TraceCheckUtils]: 9: Hoare triple {329#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} assume true; {329#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} is VALID [2020-07-29 01:01:25,445 INFO L280 TraceCheckUtils]: 8: Hoare triple {267#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset; {329#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} is VALID [2020-07-29 01:01:25,446 INFO L280 TraceCheckUtils]: 7: Hoare triple {267#true} ~size := #in~size; {267#true} is VALID [2020-07-29 01:01:25,446 INFO L263 TraceCheckUtils]: 6: Hoare triple {267#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {267#true} is VALID [2020-07-29 01:01:25,446 INFO L263 TraceCheckUtils]: 5: Hoare triple {267#true} call entry_point(); {267#true} is VALID [2020-07-29 01:01:25,447 INFO L263 TraceCheckUtils]: 4: Hoare triple {267#true} call main(); {267#true} is VALID [2020-07-29 01:01:25,447 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {267#true} {267#true} #442#return; {267#true} is VALID [2020-07-29 01:01:25,447 INFO L280 TraceCheckUtils]: 2: Hoare triple {267#true} assume true; {267#true} is VALID [2020-07-29 01:01:25,447 INFO L280 TraceCheckUtils]: 1: Hoare triple {267#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {267#true} is VALID [2020-07-29 01:01:25,448 INFO L263 TraceCheckUtils]: 0: Hoare triple {267#true} call ULTIMATE.init(); {267#true} is VALID [2020-07-29 01:01:25,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:01:25,448 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761924130] [2020-07-29 01:01:25,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:01:25,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2020-07-29 01:01:25,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792114290] [2020-07-29 01:01:25,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-07-29 01:01:25,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:01:25,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:01:25,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:25,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-29 01:01:25,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:01:25,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:01:25,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:01:25,492 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 9 states. [2020-07-29 01:01:25,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:25,862 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-29 01:01:25,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:01:25,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-07-29 01:01:25,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:01:25,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:01:25,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2020-07-29 01:01:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:01:25,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 31 transitions. [2020-07-29 01:01:25,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 31 transitions. [2020-07-29 01:01:25,915 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:25,917 INFO L225 Difference]: With dead ends: 28 [2020-07-29 01:01:25,918 INFO L226 Difference]: Without dead ends: 28 [2020-07-29 01:01:25,918 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:01:25,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-29 01:01:25,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 20. [2020-07-29 01:01:25,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:01:25,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 20 states. [2020-07-29 01:01:25,922 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 20 states. [2020-07-29 01:01:25,922 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 20 states. [2020-07-29 01:01:25,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:25,925 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-29 01:01:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-29 01:01:25,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:25,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:25,925 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 28 states. [2020-07-29 01:01:25,926 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 28 states. [2020-07-29 01:01:25,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:25,929 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-29 01:01:25,929 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-29 01:01:25,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:25,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:25,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:01:25,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:01:25,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 01:01:25,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2020-07-29 01:01:25,931 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 14 [2020-07-29 01:01:25,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:01:25,932 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2020-07-29 01:01:25,932 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-29 01:01:25,932 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-07-29 01:01:25,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-29 01:01:25,933 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:01:25,933 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:01:26,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-29 01:01:26,146 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:01:26,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:01:26,147 INFO L82 PathProgramCache]: Analyzing trace with hash 2140142808, now seen corresponding path program 1 times [2020-07-29 01:01:26,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:01:26,149 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906687748] [2020-07-29 01:01:26,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-29 01:01:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:26,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:01:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:26,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:01:26,346 INFO L384 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 [2020-07-29 01:01:26,346 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:01:26,350 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:01:26,351 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:01:26,351 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-29 01:01:26,355 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:01:26,355 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_126|]. (= |#valid| (store |v_#valid_126| |ldv_malloc_#res.base| (_ bv1 1))) [2020-07-29 01:01:26,356 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) [2020-07-29 01:01:26,395 INFO L263 TraceCheckUtils]: 0: Hoare triple {463#true} call ULTIMATE.init(); {463#true} is VALID [2020-07-29 01:01:26,395 INFO L280 TraceCheckUtils]: 1: Hoare triple {463#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {463#true} is VALID [2020-07-29 01:01:26,395 INFO L280 TraceCheckUtils]: 2: Hoare triple {463#true} assume true; {463#true} is VALID [2020-07-29 01:01:26,396 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {463#true} {463#true} #442#return; {463#true} is VALID [2020-07-29 01:01:26,396 INFO L263 TraceCheckUtils]: 4: Hoare triple {463#true} call main(); {463#true} is VALID [2020-07-29 01:01:26,396 INFO L263 TraceCheckUtils]: 5: Hoare triple {463#true} call entry_point(); {463#true} is VALID [2020-07-29 01:01:26,396 INFO L263 TraceCheckUtils]: 6: Hoare triple {463#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {463#true} is VALID [2020-07-29 01:01:26,397 INFO L280 TraceCheckUtils]: 7: Hoare triple {463#true} ~size := #in~size; {463#true} is VALID [2020-07-29 01:01:26,399 INFO L280 TraceCheckUtils]: 8: Hoare triple {463#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset; {492#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:01:26,399 INFO L280 TraceCheckUtils]: 9: Hoare triple {492#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} assume true; {492#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:01:26,401 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {492#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} {463#true} #432#return; {499#(= (bvadd (select |#valid| |entry_point_#t~ret38.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:01:26,401 INFO L280 TraceCheckUtils]: 11: Hoare triple {499#(= (bvadd (select |#valid| |entry_point_#t~ret38.base|) (_ bv1 1)) (_ bv0 1))} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {503#(= (bvadd (select |#valid| entry_point_~p~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:01:26,402 INFO L280 TraceCheckUtils]: 12: Hoare triple {503#(= (bvadd (select |#valid| entry_point_~p~0.base) (_ bv1 1)) (_ bv0 1))} assume 0bv32 == ~p~0.offset; {503#(= (bvadd (select |#valid| entry_point_~p~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:01:26,403 INFO L280 TraceCheckUtils]: 13: Hoare triple {503#(= (bvadd (select |#valid| entry_point_~p~0.base) (_ bv1 1)) (_ bv0 1))} assume ~bvult32(~p~0.base, #StackHeapBarrier); {503#(= (bvadd (select |#valid| entry_point_~p~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:01:26,404 INFO L280 TraceCheckUtils]: 14: Hoare triple {503#(= (bvadd (select |#valid| entry_point_~p~0.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~p~0.base || 1bv1 == #valid[~p~0.base]); {464#false} is VALID [2020-07-29 01:01:26,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:01:26,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:01:26,489 INFO L280 TraceCheckUtils]: 14: Hoare triple {503#(= (bvadd (select |#valid| entry_point_~p~0.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~p~0.base || 1bv1 == #valid[~p~0.base]); {464#false} is VALID [2020-07-29 01:01:26,490 INFO L280 TraceCheckUtils]: 13: Hoare triple {503#(= (bvadd (select |#valid| entry_point_~p~0.base) (_ bv1 1)) (_ bv0 1))} assume ~bvult32(~p~0.base, #StackHeapBarrier); {503#(= (bvadd (select |#valid| entry_point_~p~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:01:26,490 INFO L280 TraceCheckUtils]: 12: Hoare triple {503#(= (bvadd (select |#valid| entry_point_~p~0.base) (_ bv1 1)) (_ bv0 1))} assume 0bv32 == ~p~0.offset; {503#(= (bvadd (select |#valid| entry_point_~p~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:01:26,491 INFO L280 TraceCheckUtils]: 11: Hoare triple {499#(= (bvadd (select |#valid| |entry_point_#t~ret38.base|) (_ bv1 1)) (_ bv0 1))} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {503#(= (bvadd (select |#valid| entry_point_~p~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:01:26,492 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {492#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} {463#true} #432#return; {499#(= (bvadd (select |#valid| |entry_point_#t~ret38.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:01:26,494 INFO L280 TraceCheckUtils]: 9: Hoare triple {492#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} assume true; {492#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:01:26,496 INFO L280 TraceCheckUtils]: 8: Hoare triple {463#true} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset; {492#(= (bvadd (select |#valid| |ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2020-07-29 01:01:26,496 INFO L280 TraceCheckUtils]: 7: Hoare triple {463#true} ~size := #in~size; {463#true} is VALID [2020-07-29 01:01:26,496 INFO L263 TraceCheckUtils]: 6: Hoare triple {463#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {463#true} is VALID [2020-07-29 01:01:26,496 INFO L263 TraceCheckUtils]: 5: Hoare triple {463#true} call entry_point(); {463#true} is VALID [2020-07-29 01:01:26,497 INFO L263 TraceCheckUtils]: 4: Hoare triple {463#true} call main(); {463#true} is VALID [2020-07-29 01:01:26,497 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {463#true} {463#true} #442#return; {463#true} is VALID [2020-07-29 01:01:26,497 INFO L280 TraceCheckUtils]: 2: Hoare triple {463#true} assume true; {463#true} is VALID [2020-07-29 01:01:26,497 INFO L280 TraceCheckUtils]: 1: Hoare triple {463#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {463#true} is VALID [2020-07-29 01:01:26,498 INFO L263 TraceCheckUtils]: 0: Hoare triple {463#true} call ULTIMATE.init(); {463#true} is VALID [2020-07-29 01:01:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:01:26,498 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906687748] [2020-07-29 01:01:26,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:01:26,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-07-29 01:01:26,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977562552] [2020-07-29 01:01:26,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-29 01:01:26,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:01:26,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:01:26,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:26,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:01:26,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:01:26,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:01:26,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:01:26,520 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 5 states. [2020-07-29 01:01:26,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:26,643 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-29 01:01:26,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:01:26,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-29 01:01:26,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:01:26,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:01:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-29 01:01:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:01:26,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-29 01:01:26,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2020-07-29 01:01:26,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:26,702 INFO L225 Difference]: With dead ends: 26 [2020-07-29 01:01:26,703 INFO L226 Difference]: Without dead ends: 26 [2020-07-29 01:01:26,703 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:01:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-29 01:01:26,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-29 01:01:26,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:01:26,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-29 01:01:26,706 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-29 01:01:26,706 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-29 01:01:26,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:26,709 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-29 01:01:26,709 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-29 01:01:26,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:26,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:26,710 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-29 01:01:26,710 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-29 01:01:26,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:26,712 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2020-07-29 01:01:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-29 01:01:26,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:26,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:26,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:01:26,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:01:26,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-29 01:01:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2020-07-29 01:01:26,715 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 15 [2020-07-29 01:01:26,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:01:26,715 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2020-07-29 01:01:26,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:01:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2020-07-29 01:01:26,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-29 01:01:26,716 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:01:26,716 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:01:26,922 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-29 01:01:26,925 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:01:26,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:01:26,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1267320807, now seen corresponding path program 1 times [2020-07-29 01:01:26,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:01:26,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2010643047] [2020-07-29 01:01:26,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-29 01:01:27,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:27,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:01:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:27,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:01:27,090 INFO L263 TraceCheckUtils]: 0: Hoare triple {661#true} call ULTIMATE.init(); {661#true} is VALID [2020-07-29 01:01:27,091 INFO L280 TraceCheckUtils]: 1: Hoare triple {661#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {661#true} is VALID [2020-07-29 01:01:27,091 INFO L280 TraceCheckUtils]: 2: Hoare triple {661#true} assume true; {661#true} is VALID [2020-07-29 01:01:27,091 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {661#true} {661#true} #442#return; {661#true} is VALID [2020-07-29 01:01:27,092 INFO L263 TraceCheckUtils]: 4: Hoare triple {661#true} call main(); {661#true} is VALID [2020-07-29 01:01:27,092 INFO L263 TraceCheckUtils]: 5: Hoare triple {661#true} call entry_point(); {661#true} is VALID [2020-07-29 01:01:27,092 INFO L263 TraceCheckUtils]: 6: Hoare triple {661#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {661#true} is VALID [2020-07-29 01:01:27,092 INFO L280 TraceCheckUtils]: 7: Hoare triple {661#true} ~size := #in~size; {661#true} is VALID [2020-07-29 01:01:27,093 INFO L280 TraceCheckUtils]: 8: Hoare triple {661#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {690#(= |ldv_malloc_#res.base| (_ bv0 32))} is VALID [2020-07-29 01:01:27,094 INFO L280 TraceCheckUtils]: 9: Hoare triple {690#(= |ldv_malloc_#res.base| (_ bv0 32))} assume true; {690#(= |ldv_malloc_#res.base| (_ bv0 32))} is VALID [2020-07-29 01:01:27,095 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {690#(= |ldv_malloc_#res.base| (_ bv0 32))} {661#true} #432#return; {697#(= |entry_point_#t~ret38.base| (_ bv0 32))} is VALID [2020-07-29 01:01:27,096 INFO L280 TraceCheckUtils]: 11: Hoare triple {697#(= |entry_point_#t~ret38.base| (_ bv0 32))} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {701#(= entry_point_~p~0.base (_ bv0 32))} is VALID [2020-07-29 01:01:27,096 INFO L280 TraceCheckUtils]: 12: Hoare triple {701#(= entry_point_~p~0.base (_ bv0 32))} assume 0bv32 == ~p~0.offset; {701#(= entry_point_~p~0.base (_ bv0 32))} is VALID [2020-07-29 01:01:27,099 INFO L280 TraceCheckUtils]: 13: Hoare triple {701#(= entry_point_~p~0.base (_ bv0 32))} assume ~bvult32(~p~0.base, #StackHeapBarrier); {701#(= entry_point_~p~0.base (_ bv0 32))} is VALID [2020-07-29 01:01:27,103 INFO L280 TraceCheckUtils]: 14: Hoare triple {701#(= entry_point_~p~0.base (_ bv0 32))} assume !(0bv32 == ~p~0.base || 1bv1 == #valid[~p~0.base]); {662#false} is VALID [2020-07-29 01:01:27,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:01:27,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:01:27,153 INFO L280 TraceCheckUtils]: 14: Hoare triple {701#(= entry_point_~p~0.base (_ bv0 32))} assume !(0bv32 == ~p~0.base || 1bv1 == #valid[~p~0.base]); {662#false} is VALID [2020-07-29 01:01:27,154 INFO L280 TraceCheckUtils]: 13: Hoare triple {701#(= entry_point_~p~0.base (_ bv0 32))} assume ~bvult32(~p~0.base, #StackHeapBarrier); {701#(= entry_point_~p~0.base (_ bv0 32))} is VALID [2020-07-29 01:01:27,154 INFO L280 TraceCheckUtils]: 12: Hoare triple {701#(= entry_point_~p~0.base (_ bv0 32))} assume 0bv32 == ~p~0.offset; {701#(= entry_point_~p~0.base (_ bv0 32))} is VALID [2020-07-29 01:01:27,155 INFO L280 TraceCheckUtils]: 11: Hoare triple {697#(= |entry_point_#t~ret38.base| (_ bv0 32))} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {701#(= entry_point_~p~0.base (_ bv0 32))} is VALID [2020-07-29 01:01:27,156 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {690#(= |ldv_malloc_#res.base| (_ bv0 32))} {661#true} #432#return; {697#(= |entry_point_#t~ret38.base| (_ bv0 32))} is VALID [2020-07-29 01:01:27,157 INFO L280 TraceCheckUtils]: 9: Hoare triple {690#(= |ldv_malloc_#res.base| (_ bv0 32))} assume true; {690#(= |ldv_malloc_#res.base| (_ bv0 32))} is VALID [2020-07-29 01:01:27,158 INFO L280 TraceCheckUtils]: 8: Hoare triple {661#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {690#(= |ldv_malloc_#res.base| (_ bv0 32))} is VALID [2020-07-29 01:01:27,158 INFO L280 TraceCheckUtils]: 7: Hoare triple {661#true} ~size := #in~size; {661#true} is VALID [2020-07-29 01:01:27,158 INFO L263 TraceCheckUtils]: 6: Hoare triple {661#true} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {661#true} is VALID [2020-07-29 01:01:27,158 INFO L263 TraceCheckUtils]: 5: Hoare triple {661#true} call entry_point(); {661#true} is VALID [2020-07-29 01:01:27,159 INFO L263 TraceCheckUtils]: 4: Hoare triple {661#true} call main(); {661#true} is VALID [2020-07-29 01:01:27,159 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {661#true} {661#true} #442#return; {661#true} is VALID [2020-07-29 01:01:27,159 INFO L280 TraceCheckUtils]: 2: Hoare triple {661#true} assume true; {661#true} is VALID [2020-07-29 01:01:27,160 INFO L280 TraceCheckUtils]: 1: Hoare triple {661#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {661#true} is VALID [2020-07-29 01:01:27,160 INFO L263 TraceCheckUtils]: 0: Hoare triple {661#true} call ULTIMATE.init(); {661#true} is VALID [2020-07-29 01:01:27,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:01:27,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2010643047] [2020-07-29 01:01:27,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:01:27,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-07-29 01:01:27,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746548130] [2020-07-29 01:01:27,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-29 01:01:27,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:01:27,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:01:27,185 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:27,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-29 01:01:27,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:01:27,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:01:27,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:01:27,186 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 5 states. [2020-07-29 01:01:27,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:27,286 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-29 01:01:27,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:01:27,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-29 01:01:27,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:01:27,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:01:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2020-07-29 01:01:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:01:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2020-07-29 01:01:27,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2020-07-29 01:01:27,330 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:27,332 INFO L225 Difference]: With dead ends: 27 [2020-07-29 01:01:27,332 INFO L226 Difference]: Without dead ends: 27 [2020-07-29 01:01:27,333 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:01:27,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-29 01:01:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2020-07-29 01:01:27,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:01:27,336 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 19 states. [2020-07-29 01:01:27,336 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 19 states. [2020-07-29 01:01:27,336 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 19 states. [2020-07-29 01:01:27,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:27,338 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-29 01:01:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-29 01:01:27,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:27,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:27,339 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 27 states. [2020-07-29 01:01:27,339 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 27 states. [2020-07-29 01:01:27,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:01:27,342 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-29 01:01:27,342 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-29 01:01:27,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:01:27,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:01:27,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:01:27,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:01:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:01:27,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2020-07-29 01:01:27,344 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2020-07-29 01:01:27,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:01:27,344 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2020-07-29 01:01:27,344 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-29 01:01:27,345 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2020-07-29 01:01:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-29 01:01:27,345 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:01:27,345 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:01:27,555 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-29 01:01:27,557 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:01:27,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:01:27,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1794725483, now seen corresponding path program 1 times [2020-07-29 01:01:27,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:01:27,559 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333588683] [2020-07-29 01:01:27,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-07-29 01:01:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:27,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-29 01:01:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:01:27,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:01:29,864 INFO L263 TraceCheckUtils]: 0: Hoare triple {855#true} call ULTIMATE.init(); {855#true} is VALID [2020-07-29 01:01:29,865 INFO L280 TraceCheckUtils]: 1: Hoare triple {855#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {855#true} is VALID [2020-07-29 01:01:29,865 INFO L280 TraceCheckUtils]: 2: Hoare triple {855#true} assume true; {855#true} is VALID [2020-07-29 01:01:29,866 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {855#true} {855#true} #442#return; {855#true} is VALID [2020-07-29 01:01:29,867 INFO L263 TraceCheckUtils]: 4: Hoare triple {855#true} call main(); {872#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:01:29,883 INFO L263 TraceCheckUtils]: 5: Hoare triple {872#(= |#valid| |old(#valid)|)} call entry_point(); {872#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:01:29,885 INFO L263 TraceCheckUtils]: 6: Hoare triple {872#(= |#valid| |old(#valid)|)} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {872#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:01:29,886 INFO L280 TraceCheckUtils]: 7: Hoare triple {872#(= |#valid| |old(#valid)|)} ~size := #in~size; {872#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:01:29,887 INFO L280 TraceCheckUtils]: 8: Hoare triple {872#(= |#valid| |old(#valid)|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset; {885#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1))))} is VALID [2020-07-29 01:01:29,888 INFO L280 TraceCheckUtils]: 9: Hoare triple {885#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1))))} assume true; {885#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1))))} is VALID [2020-07-29 01:01:29,890 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {885#(and (= (select |old(#valid)| |ldv_malloc_#res.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1))))} {872#(= |#valid| |old(#valid)|)} #432#return; {892#(and (= (select |old(#valid)| |entry_point_#t~ret38.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |entry_point_#t~ret38.base| (_ bv1 1))))} is VALID [2020-07-29 01:01:29,891 INFO L280 TraceCheckUtils]: 11: Hoare triple {892#(and (= (select |old(#valid)| |entry_point_#t~ret38.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |entry_point_#t~ret38.base| (_ bv1 1))))} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {896#(and (= (_ bv0 1) (select |old(#valid)| entry_point_~p~0.base)) (= |#valid| (store |old(#valid)| entry_point_~p~0.base (_ bv1 1))))} is VALID [2020-07-29 01:01:29,893 INFO L280 TraceCheckUtils]: 12: Hoare triple {896#(and (= (_ bv0 1) (select |old(#valid)| entry_point_~p~0.base)) (= |#valid| (store |old(#valid)| entry_point_~p~0.base (_ bv1 1))))} assume 0bv32 == ~p~0.offset; {896#(and (= (_ bv0 1) (select |old(#valid)| entry_point_~p~0.base)) (= |#valid| (store |old(#valid)| entry_point_~p~0.base (_ bv1 1))))} is VALID [2020-07-29 01:01:29,894 INFO L280 TraceCheckUtils]: 13: Hoare triple {896#(and (= (_ bv0 1) (select |old(#valid)| entry_point_~p~0.base)) (= |#valid| (store |old(#valid)| entry_point_~p~0.base (_ bv1 1))))} assume ~bvult32(~p~0.base, #StackHeapBarrier); {896#(and (= (_ bv0 1) (select |old(#valid)| entry_point_~p~0.base)) (= |#valid| (store |old(#valid)| entry_point_~p~0.base (_ bv1 1))))} is VALID [2020-07-29 01:01:29,900 INFO L280 TraceCheckUtils]: 14: Hoare triple {896#(and (= (_ bv0 1) (select |old(#valid)| entry_point_~p~0.base)) (= |#valid| (store |old(#valid)| entry_point_~p~0.base (_ bv1 1))))} assume 0bv32 == ~p~0.base || 1bv1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); {906#(exists ((entry_point_~p~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| entry_point_~p~0.base)) (= |#valid| (store |old(#valid)| entry_point_~p~0.base (_ bv0 1)))))} is VALID [2020-07-29 01:01:29,901 INFO L280 TraceCheckUtils]: 15: Hoare triple {906#(exists ((entry_point_~p~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| entry_point_~p~0.base)) (= |#valid| (store |old(#valid)| entry_point_~p~0.base (_ bv0 1)))))} assume true; {906#(exists ((entry_point_~p~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| entry_point_~p~0.base)) (= |#valid| (store |old(#valid)| entry_point_~p~0.base (_ bv0 1)))))} is VALID [2020-07-29 01:01:29,902 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {906#(exists ((entry_point_~p~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| entry_point_~p~0.base)) (= |#valid| (store |old(#valid)| entry_point_~p~0.base (_ bv0 1)))))} {872#(= |#valid| |old(#valid)|)} #406#return; {906#(exists ((entry_point_~p~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| entry_point_~p~0.base)) (= |#valid| (store |old(#valid)| entry_point_~p~0.base (_ bv0 1)))))} is VALID [2020-07-29 01:01:29,903 INFO L280 TraceCheckUtils]: 17: Hoare triple {906#(exists ((entry_point_~p~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| entry_point_~p~0.base)) (= |#valid| (store |old(#valid)| entry_point_~p~0.base (_ bv0 1)))))} assume !(#valid == old(#valid)); {856#false} is VALID [2020-07-29 01:01:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:01:29,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:01:39,045 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_entry_point_#t~ret38.base_28| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_entry_point_~p~0.base_12) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_3| (store |c_old(#valid)| v_entry_point_~p~0.base_12 (_ bv0 1)))))) (not (= (select |c_#valid| |v_entry_point_#t~ret38.base_28|) (_ bv0 1))) (= (store |c_#valid| |v_entry_point_#t~ret38.base_28| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|))) is different from false [2020-07-29 01:01:39,154 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_#t~ret38.base_28| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|))) (not (= (store |c_old(#valid)| |v_entry_point_#t~ret38.base_28| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_#t~ret38.base_28|)))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_4| v_prenex_2) (_ bv0 1)) (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_4| v_prenex_2 (_ bv0 1)))))))))) is different from false [2020-07-29 01:01:39,159 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_#t~ret38.base_28| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|))) (not (= (store |c_old(#valid)| |v_entry_point_#t~ret38.base_28| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_#t~ret38.base_28|)))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_4| v_prenex_2) (_ bv0 1)) (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_4| v_prenex_2 (_ bv0 1)))))))))) is different from true [2020-07-29 01:01:41,396 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ldv_malloc_#res.base_26| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_#t~ret38.base_28| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|))) (not (= (store |c_old(#valid)| |v_entry_point_#t~ret38.base_28| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_#t~ret38.base_28|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_26|))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |c_#valid| |v_ldv_malloc_#res.base_26| (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_4| v_prenex_2) (_ bv0 1)) (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_4| v_prenex_2 (_ bv0 1)))))))))) is different from true [2020-07-29 01:01:41,485 INFO L280 TraceCheckUtils]: 17: Hoare triple {872#(= |#valid| |old(#valid)|)} assume !(#valid == old(#valid)); {856#false} is VALID [2020-07-29 01:01:41,490 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {923#(forall ((|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (and (= (select |old(#valid)| v_entry_point_~p~0.base_12) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_3| (store |old(#valid)| v_entry_point_~p~0.base_12 (_ bv0 1)))))) (= |#valid| |v_old(#valid)_BEFORE_CALL_3|)))} {919#(forall ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (or (not (= (select |#valid| v_entry_point_~p~0.base_12) (_ bv0 1))) (= |old(#valid)| (store |#valid| v_entry_point_~p~0.base_12 (_ bv0 1)))))} #406#return; {872#(= |#valid| |old(#valid)|)} is UNKNOWN [2020-07-29 01:01:41,491 INFO L280 TraceCheckUtils]: 15: Hoare triple {923#(forall ((|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (and (= (select |old(#valid)| v_entry_point_~p~0.base_12) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_3| (store |old(#valid)| v_entry_point_~p~0.base_12 (_ bv0 1)))))) (= |#valid| |v_old(#valid)_BEFORE_CALL_3|)))} assume true; {923#(forall ((|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (and (= (select |old(#valid)| v_entry_point_~p~0.base_12) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_3| (store |old(#valid)| v_entry_point_~p~0.base_12 (_ bv0 1)))))) (= |#valid| |v_old(#valid)_BEFORE_CALL_3|)))} is VALID [2020-07-29 01:01:41,493 INFO L280 TraceCheckUtils]: 14: Hoare triple {930#(forall ((|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (and (= (select |old(#valid)| v_entry_point_~p~0.base_12) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_3| (store |old(#valid)| v_entry_point_~p~0.base_12 (_ bv0 1)))))) (= (store |#valid| entry_point_~p~0.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)))} assume 0bv32 == ~p~0.base || 1bv1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); {923#(forall ((|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (and (= (select |old(#valid)| v_entry_point_~p~0.base_12) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_3| (store |old(#valid)| v_entry_point_~p~0.base_12 (_ bv0 1)))))) (= |#valid| |v_old(#valid)_BEFORE_CALL_3|)))} is VALID [2020-07-29 01:01:41,493 INFO L280 TraceCheckUtils]: 13: Hoare triple {930#(forall ((|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (and (= (select |old(#valid)| v_entry_point_~p~0.base_12) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_3| (store |old(#valid)| v_entry_point_~p~0.base_12 (_ bv0 1)))))) (= (store |#valid| entry_point_~p~0.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)))} assume ~bvult32(~p~0.base, #StackHeapBarrier); {930#(forall ((|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (and (= (select |old(#valid)| v_entry_point_~p~0.base_12) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_3| (store |old(#valid)| v_entry_point_~p~0.base_12 (_ bv0 1)))))) (= (store |#valid| entry_point_~p~0.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)))} is VALID [2020-07-29 01:01:41,494 INFO L280 TraceCheckUtils]: 12: Hoare triple {930#(forall ((|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (and (= (select |old(#valid)| v_entry_point_~p~0.base_12) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_3| (store |old(#valid)| v_entry_point_~p~0.base_12 (_ bv0 1)))))) (= (store |#valid| entry_point_~p~0.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)))} assume 0bv32 == ~p~0.offset; {930#(forall ((|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (and (= (select |old(#valid)| v_entry_point_~p~0.base_12) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_3| (store |old(#valid)| v_entry_point_~p~0.base_12 (_ bv0 1)))))) (= (store |#valid| entry_point_~p~0.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)))} is VALID [2020-07-29 01:01:41,495 INFO L280 TraceCheckUtils]: 11: Hoare triple {940#(forall ((|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (and (= (select |old(#valid)| v_entry_point_~p~0.base_12) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_3| (store |old(#valid)| v_entry_point_~p~0.base_12 (_ bv0 1)))))) (= (store |#valid| |entry_point_#t~ret38.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)))} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {930#(forall ((|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (and (= (select |old(#valid)| v_entry_point_~p~0.base_12) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_3| (store |old(#valid)| v_entry_point_~p~0.base_12 (_ bv0 1)))))) (= (store |#valid| entry_point_~p~0.base (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)))} is VALID [2020-07-29 01:01:41,505 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {948#(forall ((|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_#t~ret38.base_28| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|))) (not (= (store |old(#valid)| |v_entry_point_#t~ret38.base_28| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)) (= (_ bv0 1) (select |old(#valid)| |v_entry_point_#t~ret38.base_28|)))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |#valid| |ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_4| v_prenex_2) (_ bv0 1)) (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_4| v_prenex_2 (_ bv0 1))))))))))} {944#(forall ((|v_entry_point_#t~ret38.base_28| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (and (= (select |old(#valid)| v_entry_point_~p~0.base_12) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_3| (store |old(#valid)| v_entry_point_~p~0.base_12 (_ bv0 1)))))) (not (= (select |#valid| |v_entry_point_#t~ret38.base_28|) (_ bv0 1))) (= (store |#valid| |v_entry_point_#t~ret38.base_28| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)))} #432#return; {940#(forall ((|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (and (= (select |old(#valid)| v_entry_point_~p~0.base_12) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_3| (store |old(#valid)| v_entry_point_~p~0.base_12 (_ bv0 1)))))) (= (store |#valid| |entry_point_#t~ret38.base| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)))} is UNKNOWN [2020-07-29 01:01:41,506 INFO L280 TraceCheckUtils]: 9: Hoare triple {948#(forall ((|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_#t~ret38.base_28| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|))) (not (= (store |old(#valid)| |v_entry_point_#t~ret38.base_28| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)) (= (_ bv0 1) (select |old(#valid)| |v_entry_point_#t~ret38.base_28|)))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |#valid| |ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_4| v_prenex_2) (_ bv0 1)) (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_4| v_prenex_2 (_ bv0 1))))))))))} assume true; {948#(forall ((|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_#t~ret38.base_28| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|))) (not (= (store |old(#valid)| |v_entry_point_#t~ret38.base_28| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)) (= (_ bv0 1) (select |old(#valid)| |v_entry_point_#t~ret38.base_28|)))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |#valid| |ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_4| v_prenex_2) (_ bv0 1)) (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_4| v_prenex_2 (_ bv0 1))))))))))} is VALID [2020-07-29 01:01:41,522 INFO L280 TraceCheckUtils]: 8: Hoare triple {955#(forall ((|v_ldv_malloc_#res.base_26| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_#t~ret38.base_28| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|))) (not (= (store |old(#valid)| |v_entry_point_#t~ret38.base_28| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)) (= (_ bv0 1) (select |old(#valid)| |v_entry_point_#t~ret38.base_28|)))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_26|))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |#valid| |v_ldv_malloc_#res.base_26| (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_4| v_prenex_2) (_ bv0 1)) (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_4| v_prenex_2 (_ bv0 1))))))))))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset; {948#(forall ((|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_#t~ret38.base_28| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|))) (not (= (store |old(#valid)| |v_entry_point_#t~ret38.base_28| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)) (= (_ bv0 1) (select |old(#valid)| |v_entry_point_#t~ret38.base_28|)))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |#valid| |ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_4| v_prenex_2) (_ bv0 1)) (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_4| v_prenex_2 (_ bv0 1))))))))))} is UNKNOWN [2020-07-29 01:01:41,523 INFO L280 TraceCheckUtils]: 7: Hoare triple {955#(forall ((|v_ldv_malloc_#res.base_26| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_#t~ret38.base_28| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|))) (not (= (store |old(#valid)| |v_entry_point_#t~ret38.base_28| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)) (= (_ bv0 1) (select |old(#valid)| |v_entry_point_#t~ret38.base_28|)))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_26|))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |#valid| |v_ldv_malloc_#res.base_26| (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_4| v_prenex_2) (_ bv0 1)) (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_4| v_prenex_2 (_ bv0 1))))))))))} ~size := #in~size; {955#(forall ((|v_ldv_malloc_#res.base_26| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_#t~ret38.base_28| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|))) (not (= (store |old(#valid)| |v_entry_point_#t~ret38.base_28| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)) (= (_ bv0 1) (select |old(#valid)| |v_entry_point_#t~ret38.base_28|)))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_26|))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |#valid| |v_ldv_malloc_#res.base_26| (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_4| v_prenex_2) (_ bv0 1)) (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_4| v_prenex_2 (_ bv0 1))))))))))} is VALID [2020-07-29 01:01:41,531 INFO L263 TraceCheckUtils]: 6: Hoare triple {944#(forall ((|v_entry_point_#t~ret38.base_28| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (and (= (select |old(#valid)| v_entry_point_~p~0.base_12) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_3| (store |old(#valid)| v_entry_point_~p~0.base_12 (_ bv0 1)))))) (not (= (select |#valid| |v_entry_point_#t~ret38.base_28|) (_ bv0 1))) (= (store |#valid| |v_entry_point_#t~ret38.base_28| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)))} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {955#(forall ((|v_ldv_malloc_#res.base_26| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_#t~ret38.base_28| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|))) (not (= (store |old(#valid)| |v_entry_point_#t~ret38.base_28| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)) (= (_ bv0 1) (select |old(#valid)| |v_entry_point_#t~ret38.base_28|)))) (not (= (_ bv0 1) (select |#valid| |v_ldv_malloc_#res.base_26|))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |#valid| |v_ldv_malloc_#res.base_26| (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_4| v_prenex_2) (_ bv0 1)) (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_4| v_prenex_2 (_ bv0 1))))))))))} is UNKNOWN [2020-07-29 01:01:41,534 INFO L263 TraceCheckUtils]: 5: Hoare triple {919#(forall ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (or (not (= (select |#valid| v_entry_point_~p~0.base_12) (_ bv0 1))) (= |old(#valid)| (store |#valid| v_entry_point_~p~0.base_12 (_ bv0 1)))))} call entry_point(); {944#(forall ((|v_entry_point_#t~ret38.base_28| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (and (= (select |old(#valid)| v_entry_point_~p~0.base_12) (_ bv0 1)) (not (= |v_old(#valid)_BEFORE_CALL_3| (store |old(#valid)| v_entry_point_~p~0.base_12 (_ bv0 1)))))) (not (= (select |#valid| |v_entry_point_#t~ret38.base_28|) (_ bv0 1))) (= (store |#valid| |v_entry_point_#t~ret38.base_28| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)))} is VALID [2020-07-29 01:01:41,535 INFO L263 TraceCheckUtils]: 4: Hoare triple {855#true} call main(); {919#(forall ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (or (not (= (select |#valid| v_entry_point_~p~0.base_12) (_ bv0 1))) (= |old(#valid)| (store |#valid| v_entry_point_~p~0.base_12 (_ bv0 1)))))} is VALID [2020-07-29 01:01:41,536 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {855#true} {855#true} #442#return; {855#true} is VALID [2020-07-29 01:01:41,536 INFO L280 TraceCheckUtils]: 2: Hoare triple {855#true} assume true; {855#true} is VALID [2020-07-29 01:01:41,536 INFO L280 TraceCheckUtils]: 1: Hoare triple {855#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {855#true} is VALID [2020-07-29 01:01:41,537 INFO L263 TraceCheckUtils]: 0: Hoare triple {855#true} call ULTIMATE.init(); {855#true} is VALID [2020-07-29 01:01:41,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:01:41,541 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333588683] [2020-07-29 01:01:41,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:01:41,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 9] imperfect sequences [] total 13 [2020-07-29 01:01:41,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181550524] [2020-07-29 01:01:41,542 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-07-29 01:01:41,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:01:41,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-29 01:01:41,682 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 21 inductive. 0 not inductive. 11 times theorem prover too weak to decide inductivity. [2020-07-29 01:01:41,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-29 01:01:41,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:01:41,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-29 01:01:41,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=63, Unknown=28, NotChecked=60, Total=182 [2020-07-29 01:01:41,683 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 14 states. [2020-07-29 01:02:18,436 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_ldv_malloc_#res.base_26| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_#t~ret38.base_28| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|))) (not (= (store |c_old(#valid)| |v_entry_point_#t~ret38.base_28| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_#t~ret38.base_28|)))) (not (= (_ bv0 1) (select |c_#valid| |v_ldv_malloc_#res.base_26|))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |c_#valid| |v_ldv_malloc_#res.base_26| (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_4| v_prenex_2) (_ bv0 1)) (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_4| v_prenex_2 (_ bv0 1))))))))))) is different from false [2020-07-29 01:02:18,593 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_old(#valid)_BEFORE_CALL_4| (Array (_ BitVec 32) (_ BitVec 1)))) (or (exists ((|v_entry_point_#t~ret38.base_28| (_ BitVec 32)) (|v_old(#valid)_BEFORE_CALL_3| (Array (_ BitVec 32) (_ BitVec 1)))) (and (forall ((v_entry_point_~p~0.base_12 (_ BitVec 32))) (or (not (= (select |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12) (_ bv0 1))) (= (store |v_old(#valid)_BEFORE_CALL_4| v_entry_point_~p~0.base_12 (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|))) (not (= (store |c_old(#valid)| |v_entry_point_#t~ret38.base_28| (_ bv0 1)) |v_old(#valid)_BEFORE_CALL_3|)) (= (_ bv0 1) (select |c_old(#valid)| |v_entry_point_#t~ret38.base_28|)))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 1)))) (or (= v_prenex_1 (store |c_#valid| |c_ldv_malloc_#res.base| (_ bv0 1))) (exists ((v_prenex_2 (_ BitVec 32))) (and (= (select |v_old(#valid)_BEFORE_CALL_4| v_prenex_2) (_ bv0 1)) (not (= v_prenex_1 (store |v_old(#valid)_BEFORE_CALL_4| v_prenex_2 (_ bv0 1)))))))))) (= (select |c_old(#valid)| |c_ldv_malloc_#res.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |c_ldv_malloc_#res.base| (_ bv1 1)))) is different from false [2020-07-29 01:02:19,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:02:19,516 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2020-07-29 01:02:19,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:02:19,517 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2020-07-29 01:02:19,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:02:19,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:02:19,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2020-07-29 01:02:19,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-29 01:02:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 28 transitions. [2020-07-29 01:02:19,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 28 transitions. [2020-07-29 01:02:19,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 23 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2020-07-29 01:02:19,626 INFO L225 Difference]: With dead ends: 28 [2020-07-29 01:02:19,627 INFO L226 Difference]: Without dead ends: 19 [2020-07-29 01:02:19,627 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=42, Invalid=77, Unknown=33, NotChecked=120, Total=272 [2020-07-29 01:02:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-29 01:02:19,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-29 01:02:19,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:02:19,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-29 01:02:19,631 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-29 01:02:19,631 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-29 01:02:19,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:02:19,633 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2020-07-29 01:02:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2020-07-29 01:02:19,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:02:19,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:02:19,635 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-29 01:02:19,635 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-29 01:02:19,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:02:19,640 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2020-07-29 01:02:19,641 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2020-07-29 01:02:19,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:02:19,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:02:19,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:02:19,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:02:19,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:02:19,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2020-07-29 01:02:19,645 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 18 [2020-07-29 01:02:19,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:02:19,645 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2020-07-29 01:02:19,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-29 01:02:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2020-07-29 01:02:19,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-29 01:02:19,647 INFO L414 BasicCegarLoop]: Found error trace [2020-07-29 01:02:19,647 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:02:19,847 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-29 01:02:19,849 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2020-07-29 01:02:19,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:02:19,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1991238988, now seen corresponding path program 1 times [2020-07-29 01:02:19,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-29 01:02:19,851 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826365760] [2020-07-29 01:02:19,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-07-29 01:02:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:02:19,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-29 01:02:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:02:19,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:02:19,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-29 01:02:19,989 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2020-07-29 01:02:19,990 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:02:20,004 INFO L624 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2020-07-29 01:02:20,005 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-29 01:02:20,006 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2020-07-29 01:02:20,011 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-29 01:02:20,011 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#valid_174|, |~#ldv_global_msg_list~0.base|]. (and (= |#valid| (store (store |v_#valid_174| (_ bv0 32) (_ bv0 1)) |~#ldv_global_msg_list~0.base| (_ bv1 1))) (not (= (_ bv0 32) |~#ldv_global_msg_list~0.base|))) [2020-07-29 01:02:20,011 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|~#ldv_global_msg_list~0.base|]. (and (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= (select |#valid| |~#ldv_global_msg_list~0.base|) (_ bv1 1))) [2020-07-29 01:02:20,167 INFO L263 TraceCheckUtils]: 0: Hoare triple {1069#true} call ULTIMATE.init(); {1069#true} is VALID [2020-07-29 01:02:20,170 INFO L280 TraceCheckUtils]: 1: Hoare triple {1069#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {1077#(and (= (_ bv0 1) (select |#valid| (_ bv0 32))) (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (bvadd (select |#valid| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))))} is VALID [2020-07-29 01:02:20,171 INFO L280 TraceCheckUtils]: 2: Hoare triple {1077#(and (= (_ bv0 1) (select |#valid| (_ bv0 32))) (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (bvadd (select |#valid| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))))} assume true; {1077#(and (= (_ bv0 1) (select |#valid| (_ bv0 32))) (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (bvadd (select |#valid| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))))} is VALID [2020-07-29 01:02:20,171 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1077#(and (= (_ bv0 1) (select |#valid| (_ bv0 32))) (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (bvadd (select |#valid| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))))} {1069#true} #442#return; {1077#(and (= (_ bv0 1) (select |#valid| (_ bv0 32))) (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (bvadd (select |#valid| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))))} is VALID [2020-07-29 01:02:20,172 INFO L263 TraceCheckUtils]: 4: Hoare triple {1077#(and (= (_ bv0 1) (select |#valid| (_ bv0 32))) (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (bvadd (select |#valid| |~#ldv_global_msg_list~0.base|) (_ bv1 1)) (_ bv0 1))))} call main(); {1087#(and (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (_ bv1 1) (select |old(#valid)| |~#ldv_global_msg_list~0.base|))) (= (select |old(#valid)| (_ bv0 32)) (_ bv0 1)) (= |#valid| |old(#valid)|))} is VALID [2020-07-29 01:02:20,173 INFO L263 TraceCheckUtils]: 5: Hoare triple {1087#(and (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (_ bv1 1) (select |old(#valid)| |~#ldv_global_msg_list~0.base|))) (= (select |old(#valid)| (_ bv0 32)) (_ bv0 1)) (= |#valid| |old(#valid)|))} call entry_point(); {1091#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:02:20,174 INFO L263 TraceCheckUtils]: 6: Hoare triple {1091#(= |#valid| |old(#valid)|)} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {1091#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:02:20,175 INFO L280 TraceCheckUtils]: 7: Hoare triple {1091#(= |#valid| |old(#valid)|)} ~size := #in~size; {1091#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:02:20,183 INFO L280 TraceCheckUtils]: 8: Hoare triple {1091#(= |#valid| |old(#valid)|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {1101#(and (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2020-07-29 01:02:20,184 INFO L280 TraceCheckUtils]: 9: Hoare triple {1101#(and (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {1101#(and (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2020-07-29 01:02:20,185 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1101#(and (= |#valid| |old(#valid)|) (= |ldv_malloc_#res.base| (_ bv0 32)))} {1091#(= |#valid| |old(#valid)|)} #432#return; {1108#(and (= |#valid| |old(#valid)|) (= |entry_point_#t~ret38.base| (_ bv0 32)))} is VALID [2020-07-29 01:02:20,185 INFO L280 TraceCheckUtils]: 11: Hoare triple {1108#(and (= |#valid| |old(#valid)|) (= |entry_point_#t~ret38.base| (_ bv0 32)))} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {1112#(and (= |#valid| |old(#valid)|) (= entry_point_~p~0.base (_ bv0 32)))} is VALID [2020-07-29 01:02:20,188 INFO L280 TraceCheckUtils]: 12: Hoare triple {1112#(and (= |#valid| |old(#valid)|) (= entry_point_~p~0.base (_ bv0 32)))} assume 0bv32 == ~p~0.offset; {1112#(and (= |#valid| |old(#valid)|) (= entry_point_~p~0.base (_ bv0 32)))} is VALID [2020-07-29 01:02:20,189 INFO L280 TraceCheckUtils]: 13: Hoare triple {1112#(and (= |#valid| |old(#valid)|) (= entry_point_~p~0.base (_ bv0 32)))} assume ~bvult32(~p~0.base, #StackHeapBarrier); {1112#(and (= |#valid| |old(#valid)|) (= entry_point_~p~0.base (_ bv0 32)))} is VALID [2020-07-29 01:02:20,192 INFO L280 TraceCheckUtils]: 14: Hoare triple {1112#(and (= |#valid| |old(#valid)|) (= entry_point_~p~0.base (_ bv0 32)))} assume 0bv32 == ~p~0.base || 1bv1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); {1122#(= |#valid| (store |old(#valid)| (_ bv0 32) (_ bv0 1)))} is VALID [2020-07-29 01:02:20,194 INFO L280 TraceCheckUtils]: 15: Hoare triple {1122#(= |#valid| (store |old(#valid)| (_ bv0 32) (_ bv0 1)))} assume true; {1122#(= |#valid| (store |old(#valid)| (_ bv0 32) (_ bv0 1)))} is VALID [2020-07-29 01:02:20,195 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1122#(= |#valid| (store |old(#valid)| (_ bv0 32) (_ bv0 1)))} {1087#(and (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (_ bv1 1) (select |old(#valid)| |~#ldv_global_msg_list~0.base|))) (= (select |old(#valid)| (_ bv0 32)) (_ bv0 1)) (= |#valid| |old(#valid)|))} #406#return; {1087#(and (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (_ bv1 1) (select |old(#valid)| |~#ldv_global_msg_list~0.base|))) (= (select |old(#valid)| (_ bv0 32)) (_ bv0 1)) (= |#valid| |old(#valid)|))} is VALID [2020-07-29 01:02:20,196 INFO L280 TraceCheckUtils]: 17: Hoare triple {1087#(and (exists ((|~#ldv_global_msg_list~0.base| (_ BitVec 32))) (= (_ bv1 1) (select |old(#valid)| |~#ldv_global_msg_list~0.base|))) (= (select |old(#valid)| (_ bv0 32)) (_ bv0 1)) (= |#valid| |old(#valid)|))} assume !(#valid == old(#valid)); {1070#false} is VALID [2020-07-29 01:02:20,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:02:20,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-29 01:02:20,394 INFO L384 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 20 treesize of output 9 [2020-07-29 01:02:20,394 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-29 01:02:20,397 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-29 01:02:20,397 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-29 01:02:20,397 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:9 [2020-07-29 01:02:20,500 INFO L280 TraceCheckUtils]: 17: Hoare triple {1091#(= |#valid| |old(#valid)|)} assume !(#valid == old(#valid)); {1070#false} is VALID [2020-07-29 01:02:20,503 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1122#(= |#valid| (store |old(#valid)| (_ bv0 32) (_ bv0 1)))} {1135#(= |old(#valid)| (store |#valid| (_ bv0 32) (_ bv0 1)))} #406#return; {1091#(= |#valid| |old(#valid)|)} is VALID [2020-07-29 01:02:20,503 INFO L280 TraceCheckUtils]: 15: Hoare triple {1122#(= |#valid| (store |old(#valid)| (_ bv0 32) (_ bv0 1)))} assume true; {1122#(= |#valid| (store |old(#valid)| (_ bv0 32) (_ bv0 1)))} is VALID [2020-07-29 01:02:20,504 INFO L280 TraceCheckUtils]: 14: Hoare triple {1145#(= (store |old(#valid)| (_ bv0 32) (_ bv0 1)) (store |#valid| entry_point_~p~0.base (_ bv0 1)))} assume 0bv32 == ~p~0.base || 1bv1 == #valid[~p~0.base];call ULTIMATE.dealloc(~p~0.base, ~p~0.offset); {1122#(= |#valid| (store |old(#valid)| (_ bv0 32) (_ bv0 1)))} is VALID [2020-07-29 01:02:20,504 INFO L280 TraceCheckUtils]: 13: Hoare triple {1145#(= (store |old(#valid)| (_ bv0 32) (_ bv0 1)) (store |#valid| entry_point_~p~0.base (_ bv0 1)))} assume ~bvult32(~p~0.base, #StackHeapBarrier); {1145#(= (store |old(#valid)| (_ bv0 32) (_ bv0 1)) (store |#valid| entry_point_~p~0.base (_ bv0 1)))} is VALID [2020-07-29 01:02:20,505 INFO L280 TraceCheckUtils]: 12: Hoare triple {1145#(= (store |old(#valid)| (_ bv0 32) (_ bv0 1)) (store |#valid| entry_point_~p~0.base (_ bv0 1)))} assume 0bv32 == ~p~0.offset; {1145#(= (store |old(#valid)| (_ bv0 32) (_ bv0 1)) (store |#valid| entry_point_~p~0.base (_ bv0 1)))} is VALID [2020-07-29 01:02:20,506 INFO L280 TraceCheckUtils]: 11: Hoare triple {1155#(= (store |old(#valid)| (_ bv0 32) (_ bv0 1)) (store |#valid| |entry_point_#t~ret38.base| (_ bv0 1)))} ~p~0.base, ~p~0.offset := #t~ret38.base, #t~ret38.offset;havoc #t~ret38.base, #t~ret38.offset; {1145#(= (store |old(#valid)| (_ bv0 32) (_ bv0 1)) (store |#valid| entry_point_~p~0.base (_ bv0 1)))} is VALID [2020-07-29 01:02:20,507 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {1163#(= (store |old(#valid)| (_ bv0 32) (_ bv0 1)) (store |#valid| |ldv_malloc_#res.base| (_ bv0 1)))} {1159#(= (store |old(#valid)| (_ bv0 32) (_ bv0 1)) (store |#valid| (_ bv0 32) (_ bv0 1)))} #432#return; {1155#(= (store |old(#valid)| (_ bv0 32) (_ bv0 1)) (store |#valid| |entry_point_#t~ret38.base| (_ bv0 1)))} is VALID [2020-07-29 01:02:20,507 INFO L280 TraceCheckUtils]: 9: Hoare triple {1163#(= (store |old(#valid)| (_ bv0 32) (_ bv0 1)) (store |#valid| |ldv_malloc_#res.base| (_ bv0 1)))} assume true; {1163#(= (store |old(#valid)| (_ bv0 32) (_ bv0 1)) (store |#valid| |ldv_malloc_#res.base| (_ bv0 1)))} is VALID [2020-07-29 01:02:20,508 INFO L280 TraceCheckUtils]: 8: Hoare triple {1159#(= (store |old(#valid)| (_ bv0 32) (_ bv0 1)) (store |#valid| (_ bv0 32) (_ bv0 1)))} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {1163#(= (store |old(#valid)| (_ bv0 32) (_ bv0 1)) (store |#valid| |ldv_malloc_#res.base| (_ bv0 1)))} is VALID [2020-07-29 01:02:20,509 INFO L280 TraceCheckUtils]: 7: Hoare triple {1159#(= (store |old(#valid)| (_ bv0 32) (_ bv0 1)) (store |#valid| (_ bv0 32) (_ bv0 1)))} ~size := #in~size; {1159#(= (store |old(#valid)| (_ bv0 32) (_ bv0 1)) (store |#valid| (_ bv0 32) (_ bv0 1)))} is VALID [2020-07-29 01:02:20,509 INFO L263 TraceCheckUtils]: 6: Hoare triple {1159#(= (store |old(#valid)| (_ bv0 32) (_ bv0 1)) (store |#valid| (_ bv0 32) (_ bv0 1)))} call #t~ret38.base, #t~ret38.offset := ldv_malloc(4bv32); {1159#(= (store |old(#valid)| (_ bv0 32) (_ bv0 1)) (store |#valid| (_ bv0 32) (_ bv0 1)))} is VALID [2020-07-29 01:02:20,510 INFO L263 TraceCheckUtils]: 5: Hoare triple {1135#(= |old(#valid)| (store |#valid| (_ bv0 32) (_ bv0 1)))} call entry_point(); {1159#(= (store |old(#valid)| (_ bv0 32) (_ bv0 1)) (store |#valid| (_ bv0 32) (_ bv0 1)))} is VALID [2020-07-29 01:02:20,511 INFO L263 TraceCheckUtils]: 4: Hoare triple {1176#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} call main(); {1135#(= |old(#valid)| (store |#valid| (_ bv0 32) (_ bv0 1)))} is VALID [2020-07-29 01:02:20,512 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1176#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} {1069#true} #442#return; {1176#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} is VALID [2020-07-29 01:02:20,512 INFO L280 TraceCheckUtils]: 2: Hoare triple {1176#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} assume true; {1176#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} is VALID [2020-07-29 01:02:20,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {1069#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4bv32);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~bvadd32(4bv32, ~#ldv_global_msg_list~0.offset), 4bv32); {1176#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} is VALID [2020-07-29 01:02:20,514 INFO L263 TraceCheckUtils]: 0: Hoare triple {1069#true} call ULTIMATE.init(); {1069#true} is VALID [2020-07-29 01:02:20,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:02:20,516 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826365760] [2020-07-29 01:02:20,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:02:20,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 9] imperfect sequences [] total 14 [2020-07-29 01:02:20,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709314761] [2020-07-29 01:02:20,517 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-07-29 01:02:20,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-29 01:02:20,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-29 01:02:20,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:02:20,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-29 01:02:20,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-29 01:02:20,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-29 01:02:20,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2020-07-29 01:02:20,576 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand 15 states. [2020-07-29 01:02:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:02:20,945 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2020-07-29 01:02:20,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:02:20,946 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2020-07-29 01:02:20,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-29 01:02:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:02:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2020-07-29 01:02:20,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:02:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2020-07-29 01:02:20,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 18 transitions. [2020-07-29 01:02:20,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:02:20,986 INFO L225 Difference]: With dead ends: 18 [2020-07-29 01:02:20,986 INFO L226 Difference]: Without dead ends: 0 [2020-07-29 01:02:20,987 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2020-07-29 01:02:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-29 01:02:20,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-29 01:02:20,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:02:20,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-29 01:02:20,988 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 01:02:20,988 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 01:02:20,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:02:20,988 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:02:20,989 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:02:20,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:02:20,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:02:20,989 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-29 01:02:20,989 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-29 01:02:20,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:02:20,989 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:02:20,990 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:02:20,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:02:20,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:02:20,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:02:20,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:02:20,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-29 01:02:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 01:02:20,990 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2020-07-29 01:02:20,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-29 01:02:20,991 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:02:20,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-29 01:02:20,991 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:02:20,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:02:21,191 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-07-29 01:02:21,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.07 01:02:21 BoogieIcfgContainer [2020-07-29 01:02:21,199 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-29 01:02:21,200 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:02:21,200 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:02:21,200 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:02:21,201 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:01:23" (3/4) ... [2020-07-29 01:02:21,204 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-29 01:02:21,211 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2020-07-29 01:02:21,212 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.setCurrentRoundingMode [2020-07-29 01:02:21,212 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2020-07-29 01:02:21,212 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2020-07-29 01:02:21,212 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2020-07-29 01:02:21,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2020-07-29 01:02:21,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2020-07-29 01:02:21,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2020-07-29 01:02:21,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2020-07-29 01:02:21,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2020-07-29 01:02:21,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2020-07-29 01:02:21,213 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2020-07-29 01:02:21,214 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2020-07-29 01:02:21,214 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2020-07-29 01:02:21,214 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2020-07-29 01:02:21,214 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2020-07-29 01:02:21,214 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2020-07-29 01:02:21,214 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2020-07-29 01:02:21,214 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2020-07-29 01:02:21,215 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2020-07-29 01:02:21,215 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2020-07-29 01:02:21,215 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2020-07-29 01:02:21,215 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2020-07-29 01:02:21,215 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2020-07-29 01:02:21,215 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2020-07-29 01:02:21,215 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2020-07-29 01:02:21,215 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2020-07-29 01:02:21,215 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2020-07-29 01:02:21,215 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2020-07-29 01:02:21,215 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2020-07-29 01:02:21,216 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2020-07-29 01:02:21,216 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2020-07-29 01:02:21,216 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2020-07-29 01:02:21,216 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2020-07-29 01:02:21,216 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2020-07-29 01:02:21,216 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2020-07-29 01:02:21,216 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2020-07-29 01:02:21,216 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2020-07-29 01:02:21,216 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2020-07-29 01:02:21,216 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2020-07-29 01:02:21,216 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2020-07-29 01:02:21,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2020-07-29 01:02:21,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2020-07-29 01:02:21,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2020-07-29 01:02:21,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2020-07-29 01:02:21,217 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2020-07-29 01:02:21,223 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2020-07-29 01:02:21,224 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2020-07-29 01:02:21,224 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-29 01:02:21,224 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-29 01:02:21,225 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-29 01:02:21,295 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:02:21,295 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:02:21,297 INFO L168 Benchmark]: Toolchain (without parser) took 60193.72 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 315.1 MB). Free memory was 952.2 MB in the beginning and 949.3 MB in the end (delta: 2.9 MB). Peak memory consumption was 318.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:02:21,298 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:02:21,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 871.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -125.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:02:21,299 INFO L168 Benchmark]: Boogie Preprocessor took 117.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:02:21,299 INFO L168 Benchmark]: RCFGBuilder took 1753.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 902.7 MB in the end (delta: 167.9 MB). Peak memory consumption was 167.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:02:21,299 INFO L168 Benchmark]: TraceAbstraction took 57349.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 191.9 MB). Free memory was 902.7 MB in the beginning and 958.5 MB in the end (delta: -55.8 MB). Peak memory consumption was 136.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:02:21,300 INFO L168 Benchmark]: Witness Printer took 95.72 ms. Allocated memory is still 1.3 GB. Free memory was 958.5 MB in the beginning and 949.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:02:21,302 INFO L336 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 871.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -125.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 117.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1753.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 902.7 MB in the end (delta: 167.9 MB). Peak memory consumption was 167.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 57349.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 191.9 MB). Free memory was 902.7 MB in the beginning and 958.5 MB in the end (delta: -55.8 MB). Peak memory consumption was 136.1 MB. Max. memory is 11.5 GB. * Witness Printer took 95.72 ms. Allocated memory is still 1.3 GB. Free memory was 958.5 MB in the beginning and 949.3 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 682]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 559]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 744]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 658]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 660]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 702]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 699]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 700]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 593]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 593]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 761]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 540]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 666]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 668]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 563]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 759]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 759]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 759]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 74 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 47 procedures, 335 locations, 74 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 57.2s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 39.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 100 SDtfs, 63 SDslu, 254 SDs, 0 SdLazy, 223 SolverSat, 43 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 18.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 138 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 174 ConstructedInterpolants, 20 QuantifiedInterpolants, 16905 SizeOfPredicates, 9 NumberOfNonLiveVariables, 391 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...