./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test5.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test5.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 696e33c675918fc8350b482c3d25537e8a3aa795a76532943c9c159afade7e86 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:52:51,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:52:51,618 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:52:51,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:52:51,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:52:51,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:52:51,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:52:51,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:52:51,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:52:51,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:52:51,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:52:51,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:52:51,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:52:51,665 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:52:51,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:52:51,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:52:51,669 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:52:51,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:52:51,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:52:51,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:52:51,676 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:52:51,676 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:52:51,677 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:52:51,678 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:52:51,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:52:51,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:52:51,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:52:51,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:52:51,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:52:51,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:52:51,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:52:51,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:52:51,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:52:51,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:52:51,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:52:51,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:52:51,689 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:52:51,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:52:51,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:52:51,690 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:52:51,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:52:51,691 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:52:51,713 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:52:51,714 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:52:51,714 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:52:51,714 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:52:51,715 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:52:51,715 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:52:51,716 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:52:51,716 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:52:51,716 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:52:51,716 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:52:51,717 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:52:51,717 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:52:51,717 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:52:51,717 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:52:51,717 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:52:51,718 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:52:51,718 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:52:51,718 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:52:51,718 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:52:51,718 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:52:51,718 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:52:51,719 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:52:51,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:52:51,719 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:52:51,719 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:52:51,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:52:51,720 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:52:51,720 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:52:51,720 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:52:51,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:52:51,721 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 696e33c675918fc8350b482c3d25537e8a3aa795a76532943c9c159afade7e86 [2022-02-20 23:52:51,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:52:51,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:52:51,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:52:51,935 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:52:51,936 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:52:51,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test5.i [2022-02-20 23:52:51,998 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9984ddca/415183f969db46e787bc0f44bdc0ad02/FLAGf09e84b37 [2022-02-20 23:52:52,444 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:52:52,444 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test5.i [2022-02-20 23:52:52,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9984ddca/415183f969db46e787bc0f44bdc0ad02/FLAGf09e84b37 [2022-02-20 23:52:52,975 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9984ddca/415183f969db46e787bc0f44bdc0ad02 [2022-02-20 23:52:52,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:52:52,978 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:52:52,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:52:52,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:52:52,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:52:52,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:52:52" (1/1) ... [2022-02-20 23:52:52,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b149074 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:52, skipping insertion in model container [2022-02-20 23:52:52,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:52:52" (1/1) ... [2022-02-20 23:52:52,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:52:53,035 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:52:53,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:52:53,264 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-02-20 23:52:53,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5a84675f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:53, skipping insertion in model container [2022-02-20 23:52:53,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:52:53,265 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:52:53,266 INFO L158 Benchmark]: Toolchain (without parser) took 287.99ms. Allocated memory is still 104.9MB. Free memory was 74.3MB in the beginning and 72.8MB in the end (delta: 1.4MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2022-02-20 23:52:53,266 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 61.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:52:53,267 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.44ms. Allocated memory is still 104.9MB. Free memory was 74.0MB in the beginning and 72.8MB in the end (delta: 1.2MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2022-02-20 23:52:53,268 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 61.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.44ms. Allocated memory is still 104.9MB. Free memory was 74.0MB in the beginning and 72.8MB in the end (delta: 1.2MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test5.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 696e33c675918fc8350b482c3d25537e8a3aa795a76532943c9c159afade7e86 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:52:54,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:52:54,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:52:54,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:52:54,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:52:54,957 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:52:54,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:52:54,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:52:54,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:52:54,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:52:54,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:52:54,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:52:54,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:52:54,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:52:54,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:52:54,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:52:54,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:52:54,978 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:52:54,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:52:54,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:52:54,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:52:54,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:52:54,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:52:54,989 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:52:54,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:52:54,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:52:54,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:52:54,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:52:54,995 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:52:54,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:52:54,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:52:54,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:52:54,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:52:54,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:52:55,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:52:55,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:52:55,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:52:55,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:52:55,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:52:55,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:52:55,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:52:55,006 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:52:55,041 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:52:55,042 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:52:55,042 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:52:55,042 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:52:55,043 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:52:55,043 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:52:55,044 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:52:55,044 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:52:55,044 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:52:55,045 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:52:55,045 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:52:55,045 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:52:55,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:52:55,046 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:52:55,046 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:52:55,046 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:52:55,046 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:52:55,046 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:52:55,046 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:52:55,046 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:52:55,047 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:52:55,047 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:52:55,047 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:52:55,047 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:52:55,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:52:55,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:52:55,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:52:55,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:52:55,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:52:55,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:52:55,048 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:52:55,048 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:52:55,048 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:52:55,048 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 696e33c675918fc8350b482c3d25537e8a3aa795a76532943c9c159afade7e86 [2022-02-20 23:52:55,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:52:55,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:52:55,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:52:55,314 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:52:55,315 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:52:55,315 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test5.i [2022-02-20 23:52:55,357 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c968efddf/78f0833ffaf2498f91222eb469f0b28e/FLAG25473ecfb [2022-02-20 23:52:55,742 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:52:55,743 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test5.i [2022-02-20 23:52:55,757 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c968efddf/78f0833ffaf2498f91222eb469f0b28e/FLAG25473ecfb [2022-02-20 23:52:56,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c968efddf/78f0833ffaf2498f91222eb469f0b28e [2022-02-20 23:52:56,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:52:56,089 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:52:56,090 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:52:56,090 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:52:56,093 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:52:56,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:52:56" (1/1) ... [2022-02-20 23:52:56,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57bb5e05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:56, skipping insertion in model container [2022-02-20 23:52:56,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:52:56" (1/1) ... [2022-02-20 23:52:56,099 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:52:56,137 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:52:56,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:52:56,464 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:52:56,475 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:52:56,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:52:56,537 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:52:56,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:52:56,625 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:52:56,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:56 WrapperNode [2022-02-20 23:52:56,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:52:56,626 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:52:56,626 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:52:56,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:52:56,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:56" (1/1) ... [2022-02-20 23:52:56,643 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:56" (1/1) ... [2022-02-20 23:52:56,657 INFO L137 Inliner]: procedures = 167, calls = 71, calls flagged for inlining = 23, calls inlined = 5, statements flattened = 26 [2022-02-20 23:52:56,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:52:56,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:52:56,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:52:56,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:52:56,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:56" (1/1) ... [2022-02-20 23:52:56,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:56" (1/1) ... [2022-02-20 23:52:56,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:56" (1/1) ... [2022-02-20 23:52:56,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:56" (1/1) ... [2022-02-20 23:52:56,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:56" (1/1) ... [2022-02-20 23:52:56,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:56" (1/1) ... [2022-02-20 23:52:56,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:56" (1/1) ... [2022-02-20 23:52:56,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:52:56,673 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:52:56,674 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:52:56,674 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:52:56,674 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:56" (1/1) ... [2022-02-20 23:52:56,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:52:56,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:52:56,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:52:56,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:52:56,742 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 23:52:56,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 23:52:56,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:52:56,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:52:56,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:52:56,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:52:56,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:52:56,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:52:56,855 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:52:56,856 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:52:57,000 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:52:57,004 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:52:57,004 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:52:57,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:52:57 BoogieIcfgContainer [2022-02-20 23:52:57,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:52:57,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:52:57,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:52:57,008 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:52:57,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:52:56" (1/3) ... [2022-02-20 23:52:57,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2256f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:52:57, skipping insertion in model container [2022-02-20 23:52:57,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:52:56" (2/3) ... [2022-02-20 23:52:57,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2256f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:52:57, skipping insertion in model container [2022-02-20 23:52:57,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:52:57" (3/3) ... [2022-02-20 23:52:57,010 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test5.i [2022-02-20 23:52:57,023 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:52:57,023 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-20 23:52:57,074 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:52:57,078 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:52:57,083 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 23:52:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:57,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:52:57,099 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:57,099 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:57,100 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:52:57,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:57,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1492643359, now seen corresponding path program 1 times [2022-02-20 23:52:57,111 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:57,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1811479276] [2022-02-20 23:52:57,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:57,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:57,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:57,115 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:52:57,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:52:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:57,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:52:57,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:57,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:57,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {25#true} is VALID [2022-02-20 23:52:57,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset, entry_point_~p~1#1.base, entry_point_~p~1#1.offset;assume { :begin_inline_h5 } true;havoc h5_#res#1.base, h5_#res#1.offset;havoc h5_#t~ret38#1.base, h5_#t~ret38#1.offset, h5_~p~0#1.base, h5_~p~0#1.offset; {25#true} is VALID [2022-02-20 23:52:57,385 INFO L272 TraceCheckUtils]: 2: Hoare triple {25#true} call h5_#t~ret38#1.base, h5_#t~ret38#1.offset := ldv_malloc(4bv32); {25#true} is VALID [2022-02-20 23:52:57,385 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#true} ~size := #in~size; {25#true} is VALID [2022-02-20 23:52:57,386 INFO L290 TraceCheckUtils]: 4: Hoare triple {25#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;havoc #t~malloc12.base, #t~malloc12.offset; {42#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:57,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#(= |ldv_malloc_#res.offset| (_ bv0 32))} assume true; {42#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:57,389 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {42#(= |ldv_malloc_#res.offset| (_ bv0 32))} {25#true} #33#return; {49#(= |ULTIMATE.start_h5_#t~ret38#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:57,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {49#(= |ULTIMATE.start_h5_#t~ret38#1.offset| (_ bv0 32))} h5_~p~0#1.base, h5_~p~0#1.offset := h5_#t~ret38#1.base, h5_#t~ret38#1.offset;havoc h5_#t~ret38#1.base, h5_#t~ret38#1.offset;h5_#res#1.base, h5_#res#1.offset := h5_~p~0#1.base, h5_~p~0#1.offset; {53#(= |ULTIMATE.start_h5_#res#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:57,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {53#(= |ULTIMATE.start_h5_#res#1.offset| (_ bv0 32))} entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset := h5_#res#1.base, h5_#res#1.offset;assume { :end_inline_h5 } true;entry_point_~p~1#1.base, entry_point_~p~1#1.offset := entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;havoc entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;assume { :begin_inline_g5 } true;g5_#in~p#1.base, g5_#in~p#1.offset := entry_point_~p~1#1.base, entry_point_~p~1#1.offset;havoc g5_~p#1.base, g5_~p#1.offset;g5_~p#1.base, g5_~p#1.offset := g5_#in~p#1.base, g5_#in~p#1.offset; {57#(= |ULTIMATE.start_g5_~p#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:57,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {57#(= |ULTIMATE.start_g5_~p#1.offset| (_ bv0 32))} assume g5_~p#1.base != 0bv32 || g5_~p#1.offset != 0bv32; {57#(= |ULTIMATE.start_g5_~p#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:52:57,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {57#(= |ULTIMATE.start_g5_~p#1.offset| (_ bv0 32))} assume !(0bv32 == g5_~p#1.offset); {26#false} is VALID [2022-02-20 23:52:57,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:52:57,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:57,394 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:57,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1811479276] [2022-02-20 23:52:57,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1811479276] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:57,399 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:57,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:52:57,401 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144349149] [2022-02-20 23:52:57,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:57,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:52:57,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:57,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:57,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:57,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:52:57,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:57,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:52:57,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:52:57,437 INFO L87 Difference]: Start difference. First operand has 22 states, 15 states have (on average 1.4) internal successors, (21), 19 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:57,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:57,540 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 23:52:57,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:52:57,541 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:52:57,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:57,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:57,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-02-20 23:52:57,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-02-20 23:52:57,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2022-02-20 23:52:57,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:57,579 INFO L225 Difference]: With dead ends: 21 [2022-02-20 23:52:57,580 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 23:52:57,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:52:57,587 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:57,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 61 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:52:57,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 23:52:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 23:52:57,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:57,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:57,609 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:57,609 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:57,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:57,611 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-02-20 23:52:57,611 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-20 23:52:57,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:57,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:57,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-02-20 23:52:57,612 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-02-20 23:52:57,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:57,614 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-02-20 23:52:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-20 23:52:57,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:57,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:57,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:57,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:57,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-02-20 23:52:57,617 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 11 [2022-02-20 23:52:57,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:57,617 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-02-20 23:52:57,617 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-20 23:52:57,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:52:57,618 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:57,618 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:57,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:52:57,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:52:57,825 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:52:57,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:57,826 INFO L85 PathProgramCache]: Analyzing trace with hash -972696078, now seen corresponding path program 1 times [2022-02-20 23:52:57,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:57,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340019968] [2022-02-20 23:52:57,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:57,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:57,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:57,828 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:52:57,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:52:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:57,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:52:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:57,881 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:58,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {143#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {148#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:52:58,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset, entry_point_~p~1#1.base, entry_point_~p~1#1.offset;assume { :begin_inline_h5 } true;havoc h5_#res#1.base, h5_#res#1.offset;havoc h5_#t~ret38#1.base, h5_#t~ret38#1.offset, h5_~p~0#1.base, h5_~p~0#1.offset; {148#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:52:58,055 INFO L272 TraceCheckUtils]: 2: Hoare triple {148#(bvult (_ bv0 32) |#StackHeapBarrier|)} call h5_#t~ret38#1.base, h5_#t~ret38#1.offset := ldv_malloc(4bv32); {148#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:52:58,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {148#(bvult (_ bv0 32) |#StackHeapBarrier|)} ~size := #in~size; {148#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:52:58,056 INFO L290 TraceCheckUtils]: 4: Hoare triple {148#(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;havoc #t~malloc12.base, #t~malloc12.offset; {161#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} is VALID [2022-02-20 23:52:58,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} assume true; {161#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} is VALID [2022-02-20 23:52:58,058 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {161#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} {148#(bvult (_ bv0 32) |#StackHeapBarrier|)} #33#return; {168#(and (not (= |ULTIMATE.start_h5_#t~ret38#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_h5_#t~ret38#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:58,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {168#(and (not (= |ULTIMATE.start_h5_#t~ret38#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_h5_#t~ret38#1.base| |#StackHeapBarrier|))} h5_~p~0#1.base, h5_~p~0#1.offset := h5_#t~ret38#1.base, h5_#t~ret38#1.offset;havoc h5_#t~ret38#1.base, h5_#t~ret38#1.offset;h5_#res#1.base, h5_#res#1.offset := h5_~p~0#1.base, h5_~p~0#1.offset; {172#(and (not (= |ULTIMATE.start_h5_#res#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_h5_#res#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:52:58,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {172#(and (not (= |ULTIMATE.start_h5_#res#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_h5_#res#1.base| |#StackHeapBarrier|))} entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset := h5_#res#1.base, h5_#res#1.offset;assume { :end_inline_h5 } true;entry_point_~p~1#1.base, entry_point_~p~1#1.offset := entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;havoc entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;assume { :begin_inline_g5 } true;g5_#in~p#1.base, g5_#in~p#1.offset := entry_point_~p~1#1.base, entry_point_~p~1#1.offset;havoc g5_~p#1.base, g5_~p#1.offset;g5_~p#1.base, g5_~p#1.offset := g5_#in~p#1.base, g5_#in~p#1.offset; {176#(and (bvult |ULTIMATE.start_g5_~p#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_g5_~p#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:52:58,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {176#(and (bvult |ULTIMATE.start_g5_~p#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_g5_~p#1.base| (_ bv0 32))))} assume g5_~p#1.base != 0bv32 || g5_~p#1.offset != 0bv32; {176#(and (bvult |ULTIMATE.start_g5_~p#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_g5_~p#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:52:58,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {176#(and (bvult |ULTIMATE.start_g5_~p#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_g5_~p#1.base| (_ bv0 32))))} assume 0bv32 == g5_~p#1.offset; {176#(and (bvult |ULTIMATE.start_g5_~p#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_g5_~p#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:52:58,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {176#(and (bvult |ULTIMATE.start_g5_~p#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_g5_~p#1.base| (_ bv0 32))))} assume !~bvult32(g5_~p#1.base, #StackHeapBarrier); {144#false} is VALID [2022-02-20 23:52:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:52:58,061 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:58,062 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:58,062 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340019968] [2022-02-20 23:52:58,062 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340019968] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:58,062 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:58,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:52:58,062 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945614731] [2022-02-20 23:52:58,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:58,064 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:52:58,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:58,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:58,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:58,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:52:58,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:58,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:52:58,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:52:58,078 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:58,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:58,272 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-02-20 23:52:58,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:52:58,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:52:58,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:58,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:58,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-02-20 23:52:58,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:58,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-02-20 23:52:58,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-02-20 23:52:58,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:58,311 INFO L225 Difference]: With dead ends: 32 [2022-02-20 23:52:58,311 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 23:52:58,312 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:52:58,312 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 32 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:58,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 56 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:52:58,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 23:52:58,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2022-02-20 23:52:58,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:58,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:52:58,316 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:52:58,316 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:52:58,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:58,317 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-02-20 23:52:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-02-20 23:52:58,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:58,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:58,318 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 32 states. [2022-02-20 23:52:58,318 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 32 states. [2022-02-20 23:52:58,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:58,320 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-02-20 23:52:58,320 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-02-20 23:52:58,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:58,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:58,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:58,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:52:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-02-20 23:52:58,322 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 12 [2022-02-20 23:52:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:58,322 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-02-20 23:52:58,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:58,322 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 23:52:58,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:52:58,323 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:58,323 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:58,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:52:58,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:52:58,530 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:52:58,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:58,531 INFO L85 PathProgramCache]: Analyzing trace with hash 770114257, now seen corresponding path program 1 times [2022-02-20 23:52:58,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:58,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327657995] [2022-02-20 23:52:58,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:58,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:58,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:58,533 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:52:58,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:52:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:58,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:52:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:58,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:58,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {309#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {309#true} is VALID [2022-02-20 23:52:58,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset, entry_point_~p~1#1.base, entry_point_~p~1#1.offset;assume { :begin_inline_h5 } true;havoc h5_#res#1.base, h5_#res#1.offset;havoc h5_#t~ret38#1.base, h5_#t~ret38#1.offset, h5_~p~0#1.base, h5_~p~0#1.offset; {309#true} is VALID [2022-02-20 23:52:58,690 INFO L272 TraceCheckUtils]: 2: Hoare triple {309#true} call h5_#t~ret38#1.base, h5_#t~ret38#1.offset := ldv_malloc(4bv32); {309#true} is VALID [2022-02-20 23:52:58,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {309#true} ~size := #in~size; {309#true} is VALID [2022-02-20 23:52:58,690 INFO L290 TraceCheckUtils]: 4: Hoare triple {309#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {326#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:58,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {326#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {326#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:52:58,692 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {326#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {309#true} #33#return; {333#(and (= |ULTIMATE.start_h5_#t~ret38#1.base| (_ bv0 32)) (= |ULTIMATE.start_h5_#t~ret38#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:58,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {333#(and (= |ULTIMATE.start_h5_#t~ret38#1.base| (_ bv0 32)) (= |ULTIMATE.start_h5_#t~ret38#1.offset| (_ bv0 32)))} h5_~p~0#1.base, h5_~p~0#1.offset := h5_#t~ret38#1.base, h5_#t~ret38#1.offset;havoc h5_#t~ret38#1.base, h5_#t~ret38#1.offset;h5_#res#1.base, h5_#res#1.offset := h5_~p~0#1.base, h5_~p~0#1.offset; {337#(and (= |ULTIMATE.start_h5_#res#1.base| (_ bv0 32)) (= |ULTIMATE.start_h5_#res#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:58,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#(and (= |ULTIMATE.start_h5_#res#1.base| (_ bv0 32)) (= |ULTIMATE.start_h5_#res#1.offset| (_ bv0 32)))} entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset := h5_#res#1.base, h5_#res#1.offset;assume { :end_inline_h5 } true;entry_point_~p~1#1.base, entry_point_~p~1#1.offset := entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;havoc entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;assume { :begin_inline_g5 } true;g5_#in~p#1.base, g5_#in~p#1.offset := entry_point_~p~1#1.base, entry_point_~p~1#1.offset;havoc g5_~p#1.base, g5_~p#1.offset;g5_~p#1.base, g5_~p#1.offset := g5_#in~p#1.base, g5_#in~p#1.offset; {341#(and (= |ULTIMATE.start_g5_~p#1.base| (_ bv0 32)) (= |ULTIMATE.start_g5_~p#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:52:58,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {341#(and (= |ULTIMATE.start_g5_~p#1.base| (_ bv0 32)) (= |ULTIMATE.start_g5_~p#1.offset| (_ bv0 32)))} assume g5_~p#1.base != 0bv32 || g5_~p#1.offset != 0bv32; {310#false} is VALID [2022-02-20 23:52:58,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {310#false} assume 0bv32 == g5_~p#1.offset; {310#false} is VALID [2022-02-20 23:52:58,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {310#false} assume !~bvult32(g5_~p#1.base, #StackHeapBarrier); {310#false} is VALID [2022-02-20 23:52:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:52:58,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:58,694 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:58,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327657995] [2022-02-20 23:52:58,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327657995] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:58,694 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:58,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:52:58,695 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962507985] [2022-02-20 23:52:58,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:58,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:52:58,695 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:58,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:58,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:58,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:52:58,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:58,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:52:58,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:52:58,712 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:58,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:58,823 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2022-02-20 23:52:58,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:52:58,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-02-20 23:52:58,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-02-20 23:52:58,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:58,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-02-20 23:52:58,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-02-20 23:52:58,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:58,848 INFO L225 Difference]: With dead ends: 27 [2022-02-20 23:52:58,848 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 23:52:58,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:52:58,849 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 9 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:58,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 85 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:52:58,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 23:52:58,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-02-20 23:52:58,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:58,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:52:58,852 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:52:58,852 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:52:58,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:58,853 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2022-02-20 23:52:58,853 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2022-02-20 23:52:58,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:58,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:58,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 27 states. [2022-02-20 23:52:58,854 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 27 states. [2022-02-20 23:52:58,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:58,855 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2022-02-20 23:52:58,855 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2022-02-20 23:52:58,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:58,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:58,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:58,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:58,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:52:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-02-20 23:52:58,857 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 12 [2022-02-20 23:52:58,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:58,857 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-02-20 23:52:58,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:58,857 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-02-20 23:52:58,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:52:58,858 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:58,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:58,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:52:59,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:52:59,065 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:52:59,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:59,065 INFO L85 PathProgramCache]: Analyzing trace with hash -88807295, now seen corresponding path program 1 times [2022-02-20 23:52:59,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:59,066 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59759929] [2022-02-20 23:52:59,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:59,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:59,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:59,067 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:52:59,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:52:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:59,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:52:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:59,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:59,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:52:59,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {456#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {456#true} is VALID [2022-02-20 23:52:59,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset, entry_point_~p~1#1.base, entry_point_~p~1#1.offset;assume { :begin_inline_h5 } true;havoc h5_#res#1.base, h5_#res#1.offset;havoc h5_#t~ret38#1.base, h5_#t~ret38#1.offset, h5_~p~0#1.base, h5_~p~0#1.offset; {456#true} is VALID [2022-02-20 23:52:59,199 INFO L272 TraceCheckUtils]: 2: Hoare triple {456#true} call h5_#t~ret38#1.base, h5_#t~ret38#1.offset := ldv_malloc(4bv32); {456#true} is VALID [2022-02-20 23:52:59,199 INFO L290 TraceCheckUtils]: 3: Hoare triple {456#true} ~size := #in~size; {456#true} is VALID [2022-02-20 23:52:59,200 INFO L290 TraceCheckUtils]: 4: Hoare triple {456#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;havoc #t~malloc12.base, #t~malloc12.offset; {473#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:52:59,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {473#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {473#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:52:59,201 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {473#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {456#true} #33#return; {480#(= (select |#valid| |ULTIMATE.start_h5_#t~ret38#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:59,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {480#(= (select |#valid| |ULTIMATE.start_h5_#t~ret38#1.base|) (_ bv1 1))} h5_~p~0#1.base, h5_~p~0#1.offset := h5_#t~ret38#1.base, h5_#t~ret38#1.offset;havoc h5_#t~ret38#1.base, h5_#t~ret38#1.offset;h5_#res#1.base, h5_#res#1.offset := h5_~p~0#1.base, h5_~p~0#1.offset; {484#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_h5_#res#1.base|))} is VALID [2022-02-20 23:52:59,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {484#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_h5_#res#1.base|))} entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset := h5_#res#1.base, h5_#res#1.offset;assume { :end_inline_h5 } true;entry_point_~p~1#1.base, entry_point_~p~1#1.offset := entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;havoc entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;assume { :begin_inline_g5 } true;g5_#in~p#1.base, g5_#in~p#1.offset := entry_point_~p~1#1.base, entry_point_~p~1#1.offset;havoc g5_~p#1.base, g5_~p#1.offset;g5_~p#1.base, g5_~p#1.offset := g5_#in~p#1.base, g5_#in~p#1.offset; {488#(= (select |#valid| |ULTIMATE.start_g5_~p#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:59,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {488#(= (select |#valid| |ULTIMATE.start_g5_~p#1.base|) (_ bv1 1))} assume g5_~p#1.base != 0bv32 || g5_~p#1.offset != 0bv32; {488#(= (select |#valid| |ULTIMATE.start_g5_~p#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:59,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {488#(= (select |#valid| |ULTIMATE.start_g5_~p#1.base|) (_ bv1 1))} assume 0bv32 == g5_~p#1.offset; {488#(= (select |#valid| |ULTIMATE.start_g5_~p#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:59,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {488#(= (select |#valid| |ULTIMATE.start_g5_~p#1.base|) (_ bv1 1))} assume ~bvult32(g5_~p#1.base, #StackHeapBarrier); {488#(= (select |#valid| |ULTIMATE.start_g5_~p#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:52:59,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {488#(= (select |#valid| |ULTIMATE.start_g5_~p#1.base|) (_ bv1 1))} assume !(0bv32 == g5_~p#1.base || 1bv1 == #valid[g5_~p#1.base]); {457#false} is VALID [2022-02-20 23:52:59,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:52:59,204 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:59,204 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:59,205 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59759929] [2022-02-20 23:52:59,205 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [59759929] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:59,205 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:59,205 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:52:59,205 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507110095] [2022-02-20 23:52:59,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:59,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:52:59,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:59,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:59,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:59,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:52:59,216 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:59,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:52:59,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:52:59,216 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:59,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:59,320 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-02-20 23:52:59,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:52:59,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:52:59,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:59,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:59,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-02-20 23:52:59,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:59,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-02-20 23:52:59,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2022-02-20 23:52:59,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:59,343 INFO L225 Difference]: With dead ends: 22 [2022-02-20 23:52:59,343 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 23:52:59,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:52:59,344 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 4 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:59,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 42 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:52:59,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 23:52:59,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 23:52:59,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:59,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:52:59,346 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:52:59,346 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:52:59,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:59,347 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-02-20 23:52:59,347 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-02-20 23:52:59,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:59,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:59,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 22 states. [2022-02-20 23:52:59,348 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 22 states. [2022-02-20 23:52:59,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:59,349 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-02-20 23:52:59,349 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-02-20 23:52:59,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:59,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:59,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:59,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:59,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:52:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-02-20 23:52:59,350 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 13 [2022-02-20 23:52:59,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:59,351 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-02-20 23:52:59,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:59,351 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-02-20 23:52:59,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:52:59,351 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:59,351 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:59,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-20 23:52:59,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:52:59,558 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:52:59,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:59,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1896015485, now seen corresponding path program 1 times [2022-02-20 23:52:59,559 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:59,559 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947403738] [2022-02-20 23:52:59,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:59,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:59,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:59,565 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:52:59,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:52:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:59,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:52:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:52:59,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:52:59,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {590#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {590#true} is VALID [2022-02-20 23:52:59,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {590#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset, entry_point_~p~1#1.base, entry_point_~p~1#1.offset;assume { :begin_inline_h5 } true;havoc h5_#res#1.base, h5_#res#1.offset;havoc h5_#t~ret38#1.base, h5_#t~ret38#1.offset, h5_~p~0#1.base, h5_~p~0#1.offset; {598#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:59,660 INFO L272 TraceCheckUtils]: 2: Hoare triple {598#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call h5_#t~ret38#1.base, h5_#t~ret38#1.offset := ldv_malloc(4bv32); {602#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:52:59,660 INFO L290 TraceCheckUtils]: 3: Hoare triple {602#(= |old(#valid)| |#valid|)} ~size := #in~size; {602#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:52:59,661 INFO L290 TraceCheckUtils]: 4: Hoare triple {602#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {602#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:52:59,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {602#(= |old(#valid)| |#valid|)} assume true; {602#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:52:59,662 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {602#(= |old(#valid)| |#valid|)} {598#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #33#return; {598#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:59,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {598#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} h5_~p~0#1.base, h5_~p~0#1.offset := h5_#t~ret38#1.base, h5_#t~ret38#1.offset;havoc h5_#t~ret38#1.base, h5_#t~ret38#1.offset;h5_#res#1.base, h5_#res#1.offset := h5_~p~0#1.base, h5_~p~0#1.offset; {598#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:59,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {598#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset := h5_#res#1.base, h5_#res#1.offset;assume { :end_inline_h5 } true;entry_point_~p~1#1.base, entry_point_~p~1#1.offset := entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;havoc entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;assume { :begin_inline_g5 } true;g5_#in~p#1.base, g5_#in~p#1.offset := entry_point_~p~1#1.base, entry_point_~p~1#1.offset;havoc g5_~p#1.base, g5_~p#1.offset;g5_~p#1.base, g5_~p#1.offset := g5_#in~p#1.base, g5_#in~p#1.offset; {598#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:59,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {598#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(g5_~p#1.base != 0bv32 || g5_~p#1.offset != 0bv32); {598#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:59,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {598#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_g5 } true; {598#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:59,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {598#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_entry_point } true; {598#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:52:59,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {598#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {591#false} is VALID [2022-02-20 23:52:59,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:52:59,666 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:52:59,666 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:52:59,666 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947403738] [2022-02-20 23:52:59,666 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947403738] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:52:59,666 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:52:59,666 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:52:59,667 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718982088] [2022-02-20 23:52:59,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:52:59,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:52:59,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:52:59,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:59,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:59,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:52:59,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:52:59,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:52:59,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:52:59,679 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:59,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:59,728 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2022-02-20 23:52:59,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:52:59,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:52:59,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:52:59,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:59,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-02-20 23:52:59,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:59,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-02-20 23:52:59,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 25 transitions. [2022-02-20 23:52:59,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:52:59,748 INFO L225 Difference]: With dead ends: 25 [2022-02-20 23:52:59,748 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 23:52:59,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:52:59,749 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:52:59,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:52:59,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 23:52:59,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-02-20 23:52:59,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:52:59,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:59,751 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:59,751 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:59,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:59,751 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2022-02-20 23:52:59,752 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2022-02-20 23:52:59,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:59,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:59,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-02-20 23:52:59,752 INFO L87 Difference]: Start difference. First operand has 17 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-02-20 23:52:59,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:52:59,753 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2022-02-20 23:52:59,753 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2022-02-20 23:52:59,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:52:59,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:52:59,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:52:59,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:52:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.0) internal successors, (14), 14 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:59,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2022-02-20 23:52:59,754 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 13 [2022-02-20 23:52:59,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:52:59,754 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2022-02-20 23:52:59,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:52:59,754 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2022-02-20 23:52:59,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:52:59,755 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:52:59,755 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:52:59,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-02-20 23:52:59,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:52:59,961 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:52:59,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:52:59,962 INFO L85 PathProgramCache]: Analyzing trace with hash 41783673, now seen corresponding path program 1 times [2022-02-20 23:52:59,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:52:59,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821426651] [2022-02-20 23:52:59,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:52:59,962 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:52:59,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:52:59,976 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:52:59,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:53:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:00,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:53:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:00,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:53:00,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {708#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := 1bv32, 0bv32;call #Ultimate.allocInit(8bv32, 1bv32);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); {708#true} is VALID [2022-02-20 23:53:00,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {708#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset, entry_point_~p~1#1.base, entry_point_~p~1#1.offset;assume { :begin_inline_h5 } true;havoc h5_#res#1.base, h5_#res#1.offset;havoc h5_#t~ret38#1.base, h5_#t~ret38#1.offset, h5_~p~0#1.base, h5_~p~0#1.offset; {716#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:53:00,202 INFO L272 TraceCheckUtils]: 2: Hoare triple {716#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call h5_#t~ret38#1.base, h5_#t~ret38#1.offset := ldv_malloc(4bv32); {720#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:53:00,202 INFO L290 TraceCheckUtils]: 3: Hoare triple {720#(= |old(#valid)| |#valid|)} ~size := #in~size; {720#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:53:00,203 INFO L290 TraceCheckUtils]: 4: Hoare triple {720#(= |old(#valid)| |#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;havoc #t~malloc12.base, #t~malloc12.offset; {727#(and (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_11) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} is VALID [2022-02-20 23:53:00,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {727#(and (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_11) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} assume true; {727#(and (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_11) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} is VALID [2022-02-20 23:53:00,206 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {727#(and (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_11) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} {716#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #33#return; {734#(and (exists ((v_ArrVal_11 (_ BitVec 1))) (= |#valid| (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_h5_#t~ret38#1.base| v_ArrVal_11))) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_h5_#t~ret38#1.base|))))} is VALID [2022-02-20 23:53:00,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {734#(and (exists ((v_ArrVal_11 (_ BitVec 1))) (= |#valid| (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_h5_#t~ret38#1.base| v_ArrVal_11))) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_h5_#t~ret38#1.base|))))} h5_~p~0#1.base, h5_~p~0#1.offset := h5_#t~ret38#1.base, h5_#t~ret38#1.offset;havoc h5_#t~ret38#1.base, h5_#t~ret38#1.offset;h5_#res#1.base, h5_#res#1.offset := h5_~p~0#1.base, h5_~p~0#1.offset; {738#(and (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_h5_#res#1.base| v_ArrVal_11) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_h5_#res#1.base|))))} is VALID [2022-02-20 23:53:00,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {738#(and (exists ((v_ArrVal_11 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_h5_#res#1.base| v_ArrVal_11) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_h5_#res#1.base|))))} entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset := h5_#res#1.base, h5_#res#1.offset;assume { :end_inline_h5 } true;entry_point_~p~1#1.base, entry_point_~p~1#1.offset := entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;havoc entry_point_#t~ret39#1.base, entry_point_#t~ret39#1.offset;assume { :begin_inline_g5 } true;g5_#in~p#1.base, g5_#in~p#1.offset := entry_point_~p~1#1.base, entry_point_~p~1#1.offset;havoc g5_~p#1.base, g5_~p#1.offset;g5_~p#1.base, g5_~p#1.offset := g5_#in~p#1.base, g5_#in~p#1.offset; {742#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base|))) (exists ((v_ArrVal_11 (_ BitVec 1))) (= |#valid| (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base| v_ArrVal_11))))} is VALID [2022-02-20 23:53:00,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {742#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base|))) (exists ((v_ArrVal_11 (_ BitVec 1))) (= |#valid| (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base| v_ArrVal_11))))} assume g5_~p#1.base != 0bv32 || g5_~p#1.offset != 0bv32; {742#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base|))) (exists ((v_ArrVal_11 (_ BitVec 1))) (= |#valid| (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base| v_ArrVal_11))))} is VALID [2022-02-20 23:53:00,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {742#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base|))) (exists ((v_ArrVal_11 (_ BitVec 1))) (= |#valid| (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base| v_ArrVal_11))))} assume 0bv32 == g5_~p#1.offset; {742#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base|))) (exists ((v_ArrVal_11 (_ BitVec 1))) (= |#valid| (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base| v_ArrVal_11))))} is VALID [2022-02-20 23:53:00,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {742#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base|))) (exists ((v_ArrVal_11 (_ BitVec 1))) (= |#valid| (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base| v_ArrVal_11))))} assume ~bvult32(g5_~p#1.base, #StackHeapBarrier); {742#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base|))) (exists ((v_ArrVal_11 (_ BitVec 1))) (= |#valid| (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base| v_ArrVal_11))))} is VALID [2022-02-20 23:53:00,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {742#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base|))) (exists ((v_ArrVal_11 (_ BitVec 1))) (= |#valid| (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base| v_ArrVal_11))))} assume 0bv32 == g5_~p#1.base || 1bv1 == #valid[g5_~p#1.base];call ULTIMATE.dealloc(g5_~p#1.base, g5_~p#1.offset); {755#(exists ((|ULTIMATE.start_g5_~p#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base|))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base| (_ bv0 1)) |#valid|)))} is VALID [2022-02-20 23:53:00,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {755#(exists ((|ULTIMATE.start_g5_~p#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base|))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base| (_ bv0 1)) |#valid|)))} assume { :end_inline_g5 } true; {755#(exists ((|ULTIMATE.start_g5_~p#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base|))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base| (_ bv0 1)) |#valid|)))} is VALID [2022-02-20 23:53:00,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {755#(exists ((|ULTIMATE.start_g5_~p#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base|))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base| (_ bv0 1)) |#valid|)))} assume { :end_inline_entry_point } true; {755#(exists ((|ULTIMATE.start_g5_~p#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base|))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base| (_ bv0 1)) |#valid|)))} is VALID [2022-02-20 23:53:00,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {755#(exists ((|ULTIMATE.start_g5_~p#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base|))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_g5_~p#1.base| (_ bv0 1)) |#valid|)))} assume !(#valid == main_old_#valid#1); {709#false} is VALID [2022-02-20 23:53:00,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:00,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:53:00,212 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:53:00,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821426651] [2022-02-20 23:53:00,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1821426651] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:00,212 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:00,212 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:53:00,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527389581] [2022-02-20 23:53:00,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:00,213 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:53:00,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:00,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:00,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:00,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:53:00,229 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:53:00,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:53:00,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:53:00,230 INFO L87 Difference]: Start difference. First operand 17 states and 16 transitions. Second operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:00,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:00,265 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2022-02-20 23:53:00,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:53:00,266 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 23:53:00,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:00,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:00,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2022-02-20 23:53:00,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:00,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2022-02-20 23:53:00,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 16 transitions. [2022-02-20 23:53:00,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:00,284 INFO L225 Difference]: With dead ends: 16 [2022-02-20 23:53:00,284 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 23:53:00,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:53:00,285 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:00,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 33 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 22 Unchecked, 0.0s Time] [2022-02-20 23:53:00,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 23:53:00,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 23:53:00,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:00,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:00,285 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:00,285 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:00,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:00,285 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:53:00,285 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:53:00,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:00,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:00,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 23:53:00,286 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 23:53:00,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:00,286 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:53:00,286 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:53:00,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:00,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:00,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:00,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 23:53:00,286 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2022-02-20 23:53:00,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:00,286 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 23:53:00,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:00,287 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:53:00,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:00,288 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE (3 of 4 remaining) [2022-02-20 23:53:00,289 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (2 of 4 remaining) [2022-02-20 23:53:00,289 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (1 of 4 remaining) [2022-02-20 23:53:00,289 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2022-02-20 23:53:00,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-02-20 23:53:00,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:53:00,498 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 23:53:00,499 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:53:00,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:53:00 BoogieIcfgContainer [2022-02-20 23:53:00,501 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:53:00,501 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:53:00,501 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:53:00,501 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:53:00,502 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:52:57" (3/4) ... [2022-02-20 23:53:00,504 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 23:53:00,507 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-02-20 23:53:00,510 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 23:53:00,510 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 23:53:00,510 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 23:53:00,546 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:53:00,546 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:53:00,547 INFO L158 Benchmark]: Toolchain (without parser) took 4457.70ms. Allocated memory was 52.4MB in the beginning and 96.5MB in the end (delta: 44.0MB). Free memory was 28.3MB in the beginning and 71.4MB in the end (delta: -43.1MB). Peak memory consumption was 943.4kB. Max. memory is 16.1GB. [2022-02-20 23:53:00,547 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 52.4MB. Free memory was 33.9MB in the beginning and 33.8MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:53:00,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.57ms. Allocated memory was 52.4MB in the beginning and 73.4MB in the end (delta: 21.0MB). Free memory was 28.1MB in the beginning and 51.8MB in the end (delta: -23.7MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2022-02-20 23:53:00,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.87ms. Allocated memory is still 73.4MB. Free memory was 51.8MB in the beginning and 49.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:53:00,548 INFO L158 Benchmark]: Boogie Preprocessor took 15.38ms. Allocated memory is still 73.4MB. Free memory was 49.3MB in the beginning and 48.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:53:00,548 INFO L158 Benchmark]: RCFGBuilder took 331.97ms. Allocated memory is still 73.4MB. Free memory was 48.1MB in the beginning and 36.7MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:53:00,548 INFO L158 Benchmark]: TraceAbstraction took 3494.51ms. Allocated memory was 73.4MB in the beginning and 96.5MB in the end (delta: 23.1MB). Free memory was 36.4MB in the beginning and 73.6MB in the end (delta: -37.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:53:00,548 INFO L158 Benchmark]: Witness Printer took 44.81ms. Allocated memory is still 96.5MB. Free memory was 73.6MB in the beginning and 71.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:53:00,550 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 52.4MB. Free memory was 33.9MB in the beginning and 33.8MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 535.57ms. Allocated memory was 52.4MB in the beginning and 73.4MB in the end (delta: 21.0MB). Free memory was 28.1MB in the beginning and 51.8MB in the end (delta: -23.7MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.87ms. Allocated memory is still 73.4MB. Free memory was 51.8MB in the beginning and 49.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.38ms. Allocated memory is still 73.4MB. Free memory was 49.3MB in the beginning and 48.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 331.97ms. Allocated memory is still 73.4MB. Free memory was 48.1MB in the beginning and 36.7MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3494.51ms. Allocated memory was 73.4MB in the beginning and 96.5MB in the end (delta: 23.1MB). Free memory was 36.4MB in the beginning and 73.6MB in the end (delta: -37.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 44.81ms. Allocated memory is still 96.5MB. Free memory was 73.6MB in the beginning and 71.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 763]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 763]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 763]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 770]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 320 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 22 IncrementalHoareTripleChecker+Unchecked, 227 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 154 IncrementalHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 93 mSDtfsCounter, 154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=2, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 71 ConstructedInterpolants, 11 QuantifiedInterpolants, 373 SizeOfPredicates, 25 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 23:53:00,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE