./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test16_1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test16_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3afced8f9a8fb9c36e6297fc454d6fa3dc7a1789295b6dfeeaf7e663bd888ba5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:51:01,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:51:01,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:51:01,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:51:01,927 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:51:01,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:51:01,931 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:51:01,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:51:01,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:51:01,938 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:51:01,938 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:51:01,940 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:51:01,940 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:51:01,941 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:51:01,942 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:51:01,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:51:01,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:51:01,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:51:01,948 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:51:01,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:51:01,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:51:01,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:51:01,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:51:01,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:51:01,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:51:01,961 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:51:01,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:51:01,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:51:01,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:51:01,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:51:01,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:51:01,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:51:01,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:51:01,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:51:01,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:51:01,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:51:01,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:51:01,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:51:01,970 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:51:01,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:51:01,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:51:01,972 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:51:01,988 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:51:01,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:51:01,988 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:51:01,988 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:51:01,988 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:51:01,989 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:51:01,989 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:51:01,989 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:51:01,989 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:51:01,989 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:51:01,989 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:51:01,989 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:51:01,989 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:51:01,989 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:51:01,990 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:51:01,990 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:51:01,990 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:51:01,990 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:51:01,990 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:51:01,990 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:51:01,990 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:51:01,990 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:51:01,990 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:51:01,990 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:51:01,990 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:51:01,990 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:51:01,991 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:51:01,991 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:51:01,991 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:51:01,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:51:01,991 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 -> 3afced8f9a8fb9c36e6297fc454d6fa3dc7a1789295b6dfeeaf7e663bd888ba5 [2022-02-20 23:51:02,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:51:02,242 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:51:02,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:51:02,247 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:51:02,247 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:51:02,248 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test16_1.i [2022-02-20 23:51:02,324 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b6f95c16/4198e119cce14e9ab9ebb775f5c518eb/FLAGab882a9af [2022-02-20 23:51:02,724 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:51:02,725 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test16_1.i [2022-02-20 23:51:02,737 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b6f95c16/4198e119cce14e9ab9ebb775f5c518eb/FLAGab882a9af [2022-02-20 23:51:02,749 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b6f95c16/4198e119cce14e9ab9ebb775f5c518eb [2022-02-20 23:51:02,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:51:02,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:51:02,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:02,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:51:02,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:51:02,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:02" (1/1) ... [2022-02-20 23:51:02,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56a556cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:02, skipping insertion in model container [2022-02-20 23:51:02,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:02" (1/1) ... [2022-02-20 23:51:02,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:51:02,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:51:03,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:03,187 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:51:03,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7f8adb7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:03, skipping insertion in model container [2022-02-20 23:51:03,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:03,188 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:51:03,191 INFO L158 Benchmark]: Toolchain (without parser) took 436.88ms. Allocated memory is still 111.1MB. Free memory was 76.9MB in the beginning and 81.4MB in the end (delta: -4.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:51:03,192 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory was 37.4MB in the beginning and 37.4MB in the end (delta: 39.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:51:03,192 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.46ms. Allocated memory is still 111.1MB. Free memory was 76.7MB in the beginning and 81.4MB in the end (delta: -4.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:51:03,193 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory was 37.4MB in the beginning and 37.4MB in the end (delta: 39.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.46ms. Allocated memory is still 111.1MB. Free memory was 76.7MB in the beginning and 81.4MB in the end (delta: -4.7MB). Peak memory consumption was 6.3MB. 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_test16_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3afced8f9a8fb9c36e6297fc454d6fa3dc7a1789295b6dfeeaf7e663bd888ba5 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:51:04,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:51:04,626 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:51:04,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:51:04,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:51:04,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:51:04,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:51:04,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:51:04,657 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:51:04,661 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:51:04,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:51:04,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:51:04,669 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:51:04,672 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:51:04,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:51:04,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:51:04,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:51:04,678 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:51:04,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:51:04,689 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:51:04,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:51:04,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:51:04,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:51:04,693 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:51:04,698 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:51:04,698 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:51:04,698 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:51:04,699 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:51:04,700 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:51:04,700 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:51:04,701 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:51:04,701 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:51:04,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:51:04,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:51:04,704 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:51:04,704 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:51:04,705 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:51:04,705 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:51:04,705 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:51:04,706 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:51:04,707 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:51:04,707 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:51:04,741 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:51:04,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:51:04,742 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:51:04,742 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:51:04,743 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:51:04,743 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:51:04,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:51:04,745 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:51:04,745 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:51:04,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:51:04,745 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:51:04,746 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:51:04,746 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:51:04,746 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:51:04,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:51:04,746 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:51:04,746 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:51:04,747 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:51:04,747 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:51:04,747 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:51:04,747 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:51:04,747 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:51:04,747 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:51:04,747 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:51:04,748 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:51:04,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:51:04,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:51:04,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:51:04,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:51:04,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:51:04,749 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:51:04,749 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:51:04,749 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:51:04,750 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 -> 3afced8f9a8fb9c36e6297fc454d6fa3dc7a1789295b6dfeeaf7e663bd888ba5 [2022-02-20 23:51:05,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:51:05,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:51:05,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:51:05,044 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:51:05,046 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:51:05,047 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test16_1.i [2022-02-20 23:51:05,097 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af5d29fed/2bfbebda6a774721bc50bcd8410b39c7/FLAGac73ab57c [2022-02-20 23:51:05,528 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:51:05,528 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test16_1.i [2022-02-20 23:51:05,542 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af5d29fed/2bfbebda6a774721bc50bcd8410b39c7/FLAGac73ab57c [2022-02-20 23:51:05,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af5d29fed/2bfbebda6a774721bc50bcd8410b39c7 [2022-02-20 23:51:05,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:51:05,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:51:05,562 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:05,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:51:05,564 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:51:05,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:05" (1/1) ... [2022-02-20 23:51:05,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6c66b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:05, skipping insertion in model container [2022-02-20 23:51:05,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:51:05" (1/1) ... [2022-02-20 23:51:05,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:51:05,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:51:05,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:05,999 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:51:06,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:51:06,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:06,072 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:51:06,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:51:06,157 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:51:06,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:06 WrapperNode [2022-02-20 23:51:06,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:51:06,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:51:06,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:51:06,160 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:51:06,166 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:51:06" (1/1) ... [2022-02-20 23:51:06,207 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:51:06" (1/1) ... [2022-02-20 23:51:06,227 INFO L137 Inliner]: procedures = 167, calls = 71, calls flagged for inlining = 23, calls inlined = 5, statements flattened = 30 [2022-02-20 23:51:06,227 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:51:06,228 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:51:06,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:51:06,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:51:06,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:06" (1/1) ... [2022-02-20 23:51:06,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:06" (1/1) ... [2022-02-20 23:51:06,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:06" (1/1) ... [2022-02-20 23:51:06,248 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:06" (1/1) ... [2022-02-20 23:51:06,253 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:06" (1/1) ... [2022-02-20 23:51:06,259 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:06" (1/1) ... [2022-02-20 23:51:06,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:06" (1/1) ... [2022-02-20 23:51:06,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:51:06,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:51:06,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:51:06,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:51:06,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:06" (1/1) ... [2022-02-20 23:51:06,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:51:06,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:51:06,301 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:51:06,322 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:51:06,340 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 23:51:06,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 23:51:06,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:51:06,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:51:06,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:51:06,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:51:06,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:51:06,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:51:06,464 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:51:06,465 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:51:06,596 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:51:06,601 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:51:06,601 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:51:06,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:51:06 BoogieIcfgContainer [2022-02-20 23:51:06,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:51:06,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:51:06,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:51:06,606 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:51:06,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:51:05" (1/3) ... [2022-02-20 23:51:06,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8bb1153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:51:06, skipping insertion in model container [2022-02-20 23:51:06,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:51:06" (2/3) ... [2022-02-20 23:51:06,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8bb1153 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:51:06, skipping insertion in model container [2022-02-20 23:51:06,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:51:06" (3/3) ... [2022-02-20 23:51:06,609 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test16_1.i [2022-02-20 23:51:06,612 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:51:06,612 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-20 23:51:06,653 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:51:06,659 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:51:06,660 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 23:51:06,675 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:51:06,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:51:06,680 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:06,680 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:06,681 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:51:06,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:06,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1492643359, now seen corresponding path program 1 times [2022-02-20 23:51:06,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:06,695 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922660221] [2022-02-20 23:51:06,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:06,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:06,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:06,698 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:51:06,699 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:51:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:06,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:51:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:06,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:06,943 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:51:06,944 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~nondet39#1, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_~condition~0#1, entry_point_~p~1#1.base, entry_point_~p~1#1.offset;entry_point_~condition~0#1 := entry_point_#t~nondet39#1;havoc entry_point_#t~nondet39#1;assume { :begin_inline_alloc_unsafe_16 } true;alloc_unsafe_16_#in~condition#1 := entry_point_~condition~0#1;havoc alloc_unsafe_16_#res#1.base, alloc_unsafe_16_#res#1.offset;havoc alloc_unsafe_16_#t~ret38#1.base, alloc_unsafe_16_#t~ret38#1.offset, alloc_unsafe_16_~condition#1, alloc_unsafe_16_~p~0#1.base, alloc_unsafe_16_~p~0#1.offset;alloc_unsafe_16_~condition#1 := alloc_unsafe_16_#in~condition#1; {25#true} is VALID [2022-02-20 23:51:06,944 INFO L272 TraceCheckUtils]: 2: Hoare triple {25#true} call alloc_unsafe_16_#t~ret38#1.base, alloc_unsafe_16_#t~ret38#1.offset := ldv_malloc(4bv32); {25#true} is VALID [2022-02-20 23:51:06,944 INFO L290 TraceCheckUtils]: 3: Hoare triple {25#true} ~size := #in~size; {25#true} is VALID [2022-02-20 23:51:06,945 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:51:06,946 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:51:06,947 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {42#(= |ldv_malloc_#res.offset| (_ bv0 32))} {25#true} #33#return; {49#(= |ULTIMATE.start_alloc_unsafe_16_#t~ret38#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:06,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {49#(= |ULTIMATE.start_alloc_unsafe_16_#t~ret38#1.offset| (_ bv0 32))} alloc_unsafe_16_~p~0#1.base, alloc_unsafe_16_~p~0#1.offset := alloc_unsafe_16_#t~ret38#1.base, alloc_unsafe_16_#t~ret38#1.offset;havoc alloc_unsafe_16_#t~ret38#1.base, alloc_unsafe_16_#t~ret38#1.offset;alloc_unsafe_16_#res#1.base, alloc_unsafe_16_#res#1.offset := alloc_unsafe_16_~p~0#1.base, alloc_unsafe_16_~p~0#1.offset; {53#(= |ULTIMATE.start_alloc_unsafe_16_#res#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:06,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {53#(= |ULTIMATE.start_alloc_unsafe_16_#res#1.offset| (_ bv0 32))} entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := alloc_unsafe_16_#res#1.base, alloc_unsafe_16_#res#1.offset;assume { :end_inline_alloc_unsafe_16 } true;entry_point_~p~1#1.base, entry_point_~p~1#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;assume { :begin_inline_free_16 } true;free_16_#in~p#1.base, free_16_#in~p#1.offset, free_16_#in~condition#1 := entry_point_~p~1#1.base, entry_point_~p~1#1.offset, entry_point_~condition~0#1;havoc free_16_~p#1.base, free_16_~p#1.offset, free_16_~condition#1;free_16_~p#1.base, free_16_~p#1.offset := free_16_#in~p#1.base, free_16_#in~p#1.offset;free_16_~condition#1 := free_16_#in~condition#1; {57#(= |ULTIMATE.start_free_16_~p#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:06,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {57#(= |ULTIMATE.start_free_16_~p#1.offset| (_ bv0 32))} assume 0bv32 != free_16_~condition#1; {57#(= |ULTIMATE.start_free_16_~p#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:51:06,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {57#(= |ULTIMATE.start_free_16_~p#1.offset| (_ bv0 32))} assume !(0bv32 == free_16_~p#1.offset); {26#false} is VALID [2022-02-20 23:51:06,953 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:51:06,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:06,954 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:06,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922660221] [2022-02-20 23:51:06,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922660221] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:06,956 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:06,956 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:51:06,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757015037] [2022-02-20 23:51:06,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:06,962 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:51:06,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:06,965 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:51:06,987 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:51:06,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:51:06,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:07,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:51:07,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:51:07,010 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:51:07,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:07,123 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 23:51:07,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:51:07,124 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:51:07,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:07,125 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:51:07,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-02-20 23:51:07,133 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:51:07,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-02-20 23:51:07,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2022-02-20 23:51:07,186 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:51:07,191 INFO L225 Difference]: With dead ends: 21 [2022-02-20 23:51:07,191 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 23:51:07,192 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:51:07,198 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:07,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 67 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:51:07,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 23:51:07,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 23:51:07,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:07,220 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:51:07,221 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:51:07,222 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:51:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:07,224 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-02-20 23:51:07,224 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-20 23:51:07,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:07,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:07,225 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:51:07,225 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:51:07,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:07,228 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-02-20 23:51:07,228 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-20 23:51:07,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:07,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:07,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:07,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:07,229 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:51:07,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-02-20 23:51:07,231 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 11 [2022-02-20 23:51:07,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:07,231 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-02-20 23:51:07,232 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:51:07,232 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-20 23:51:07,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:51:07,232 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:07,232 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:07,247 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:51:07,439 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:51:07,440 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:51:07,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:07,440 INFO L85 PathProgramCache]: Analyzing trace with hash -972696078, now seen corresponding path program 1 times [2022-02-20 23:51:07,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:07,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917321261] [2022-02-20 23:51:07,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:07,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:07,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:07,443 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:51:07,444 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:51:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:07,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:51:07,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:07,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:07,700 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:51:07,701 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~nondet39#1, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_~condition~0#1, entry_point_~p~1#1.base, entry_point_~p~1#1.offset;entry_point_~condition~0#1 := entry_point_#t~nondet39#1;havoc entry_point_#t~nondet39#1;assume { :begin_inline_alloc_unsafe_16 } true;alloc_unsafe_16_#in~condition#1 := entry_point_~condition~0#1;havoc alloc_unsafe_16_#res#1.base, alloc_unsafe_16_#res#1.offset;havoc alloc_unsafe_16_#t~ret38#1.base, alloc_unsafe_16_#t~ret38#1.offset, alloc_unsafe_16_~condition#1, alloc_unsafe_16_~p~0#1.base, alloc_unsafe_16_~p~0#1.offset;alloc_unsafe_16_~condition#1 := alloc_unsafe_16_#in~condition#1; {148#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:51:07,702 INFO L272 TraceCheckUtils]: 2: Hoare triple {148#(bvult (_ bv0 32) |#StackHeapBarrier|)} call alloc_unsafe_16_#t~ret38#1.base, alloc_unsafe_16_#t~ret38#1.offset := ldv_malloc(4bv32); {148#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:51:07,702 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:51:07,703 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:51:07,703 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:51:07,704 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 (bvult |ULTIMATE.start_alloc_unsafe_16_#t~ret38#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_unsafe_16_#t~ret38#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:51:07,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {168#(and (bvult |ULTIMATE.start_alloc_unsafe_16_#t~ret38#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_alloc_unsafe_16_#t~ret38#1.base| (_ bv0 32))))} alloc_unsafe_16_~p~0#1.base, alloc_unsafe_16_~p~0#1.offset := alloc_unsafe_16_#t~ret38#1.base, alloc_unsafe_16_#t~ret38#1.offset;havoc alloc_unsafe_16_#t~ret38#1.base, alloc_unsafe_16_#t~ret38#1.offset;alloc_unsafe_16_#res#1.base, alloc_unsafe_16_#res#1.offset := alloc_unsafe_16_~p~0#1.base, alloc_unsafe_16_~p~0#1.offset; {172#(and (bvult |ULTIMATE.start_alloc_unsafe_16_#res#1.base| |#StackHeapBarrier|) (not (= (_ bv0 32) |ULTIMATE.start_alloc_unsafe_16_#res#1.base|)))} is VALID [2022-02-20 23:51:07,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {172#(and (bvult |ULTIMATE.start_alloc_unsafe_16_#res#1.base| |#StackHeapBarrier|) (not (= (_ bv0 32) |ULTIMATE.start_alloc_unsafe_16_#res#1.base|)))} entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := alloc_unsafe_16_#res#1.base, alloc_unsafe_16_#res#1.offset;assume { :end_inline_alloc_unsafe_16 } true;entry_point_~p~1#1.base, entry_point_~p~1#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;assume { :begin_inline_free_16 } true;free_16_#in~p#1.base, free_16_#in~p#1.offset, free_16_#in~condition#1 := entry_point_~p~1#1.base, entry_point_~p~1#1.offset, entry_point_~condition~0#1;havoc free_16_~p#1.base, free_16_~p#1.offset, free_16_~condition#1;free_16_~p#1.base, free_16_~p#1.offset := free_16_#in~p#1.base, free_16_#in~p#1.offset;free_16_~condition#1 := free_16_#in~condition#1; {176#(and (bvult |ULTIMATE.start_free_16_~p#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:51:07,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {176#(and (bvult |ULTIMATE.start_free_16_~p#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32))))} assume 0bv32 != free_16_~condition#1; {176#(and (bvult |ULTIMATE.start_free_16_~p#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:51:07,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {176#(and (bvult |ULTIMATE.start_free_16_~p#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32))))} assume 0bv32 == free_16_~p#1.offset; {176#(and (bvult |ULTIMATE.start_free_16_~p#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:51:07,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {176#(and (bvult |ULTIMATE.start_free_16_~p#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32))))} assume !~bvult32(free_16_~p#1.base, #StackHeapBarrier); {144#false} is VALID [2022-02-20 23:51:07,708 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:51:07,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:07,709 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:07,709 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917321261] [2022-02-20 23:51:07,710 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917321261] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:07,710 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:07,710 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:51:07,710 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122567244] [2022-02-20 23:51:07,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:07,711 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:51:07,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:07,712 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:51:07,725 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:51:07,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:51:07,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:07,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:51:07,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:51:07,729 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:51:07,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:07,938 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-02-20 23:51:07,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:51:07,938 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:51:07,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:07,938 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:51:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-02-20 23:51:07,944 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:51:07,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-02-20 23:51:07,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-02-20 23:51:07,979 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:51:07,982 INFO L225 Difference]: With dead ends: 32 [2022-02-20 23:51:07,984 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 23:51:07,984 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:51:07,985 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 34 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:07,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 52 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:51:07,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 23:51:07,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2022-02-20 23:51:07,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:07,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 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:51:07,993 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 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:51:07,994 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 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:51:07,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:07,997 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-02-20 23:51:07,997 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-02-20 23:51:07,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:07,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:07,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 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:51:07,999 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 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:51:08,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:08,005 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-02-20 23:51:08,006 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-02-20 23:51:08,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:08,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:08,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:08,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:08,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 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:51:08,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-02-20 23:51:08,009 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 12 [2022-02-20 23:51:08,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:08,009 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-02-20 23:51:08,010 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:51:08,010 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-02-20 23:51:08,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:51:08,010 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:08,010 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:08,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 23:51:08,216 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:51:08,217 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:51:08,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:08,218 INFO L85 PathProgramCache]: Analyzing trace with hash 770114257, now seen corresponding path program 1 times [2022-02-20 23:51:08,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:08,218 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425579934] [2022-02-20 23:51:08,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:08,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:08,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:08,220 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:51:08,221 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:51:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:08,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:51:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:51:08,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:51:08,384 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); {314#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:51:08,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#(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~nondet39#1, entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset, entry_point_~condition~0#1, entry_point_~p~1#1.base, entry_point_~p~1#1.offset;entry_point_~condition~0#1 := entry_point_#t~nondet39#1;havoc entry_point_#t~nondet39#1;assume { :begin_inline_alloc_unsafe_16 } true;alloc_unsafe_16_#in~condition#1 := entry_point_~condition~0#1;havoc alloc_unsafe_16_#res#1.base, alloc_unsafe_16_#res#1.offset;havoc alloc_unsafe_16_#t~ret38#1.base, alloc_unsafe_16_#t~ret38#1.offset, alloc_unsafe_16_~condition#1, alloc_unsafe_16_~p~0#1.base, alloc_unsafe_16_~p~0#1.offset;alloc_unsafe_16_~condition#1 := alloc_unsafe_16_#in~condition#1; {314#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:51:08,385 INFO L272 TraceCheckUtils]: 2: Hoare triple {314#(bvult (_ bv0 32) |#StackHeapBarrier|)} call alloc_unsafe_16_#t~ret38#1.base, alloc_unsafe_16_#t~ret38#1.offset := ldv_malloc(4bv32); {314#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:51:08,386 INFO L290 TraceCheckUtils]: 3: Hoare triple {314#(bvult (_ bv0 32) |#StackHeapBarrier|)} ~size := #in~size; {314#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:51:08,386 INFO L290 TraceCheckUtils]: 4: Hoare triple {314#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {327#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:08,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {327#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:08,387 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {327#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ldv_malloc_#res.base| (_ bv0 32)))} {314#(bvult (_ bv0 32) |#StackHeapBarrier|)} #33#return; {334#(and (= |ULTIMATE.start_alloc_unsafe_16_#t~ret38#1.base| (_ bv0 32)) (bvult (_ bv0 32) |#StackHeapBarrier|))} is VALID [2022-02-20 23:51:08,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {334#(and (= |ULTIMATE.start_alloc_unsafe_16_#t~ret38#1.base| (_ bv0 32)) (bvult (_ bv0 32) |#StackHeapBarrier|))} alloc_unsafe_16_~p~0#1.base, alloc_unsafe_16_~p~0#1.offset := alloc_unsafe_16_#t~ret38#1.base, alloc_unsafe_16_#t~ret38#1.offset;havoc alloc_unsafe_16_#t~ret38#1.base, alloc_unsafe_16_#t~ret38#1.offset;alloc_unsafe_16_#res#1.base, alloc_unsafe_16_#res#1.offset := alloc_unsafe_16_~p~0#1.base, alloc_unsafe_16_~p~0#1.offset; {338#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= (_ bv0 32) |ULTIMATE.start_alloc_unsafe_16_#res#1.base|))} is VALID [2022-02-20 23:51:08,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {338#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= (_ bv0 32) |ULTIMATE.start_alloc_unsafe_16_#res#1.base|))} entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset := alloc_unsafe_16_#res#1.base, alloc_unsafe_16_#res#1.offset;assume { :end_inline_alloc_unsafe_16 } true;entry_point_~p~1#1.base, entry_point_~p~1#1.offset := entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;havoc entry_point_#t~ret40#1.base, entry_point_#t~ret40#1.offset;assume { :begin_inline_free_16 } true;free_16_#in~p#1.base, free_16_#in~p#1.offset, free_16_#in~condition#1 := entry_point_~p~1#1.base, entry_point_~p~1#1.offset, entry_point_~condition~0#1;havoc free_16_~p#1.base, free_16_~p#1.offset, free_16_~condition#1;free_16_~p#1.base, free_16_~p#1.offset := free_16_#in~p#1.base, free_16_#in~p#1.offset;free_16_~condition#1 := free_16_#in~condition#1; {342#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:08,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {342#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32)))} assume 0bv32 != free_16_~condition#1; {342#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:08,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {342#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32)))} assume 0bv32 == free_16_~p#1.offset; {342#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:51:08,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {342#(and (bvult (_ bv0 32) |#StackHeapBarrier|) (= |ULTIMATE.start_free_16_~p#1.base| (_ bv0 32)))} assume !~bvult32(free_16_~p#1.base, #StackHeapBarrier); {310#false} is VALID [2022-02-20 23:51:08,390 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:51:08,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:51:08,390 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:51:08,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425579934] [2022-02-20 23:51:08,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425579934] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:51:08,391 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:51:08,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:51:08,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265438272] [2022-02-20 23:51:08,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:51:08,391 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:51:08,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:51:08,391 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:51:08,402 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:51:08,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:51:08,402 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:51:08,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:51:08,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:51:08,403 INFO L87 Difference]: Start difference. First operand 26 states and 28 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:51:08,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:08,570 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-02-20 23:51:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:51:08,570 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:51:08,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:51:08,570 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:51:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-02-20 23:51:08,571 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:51:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 33 transitions. [2022-02-20 23:51:08,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 33 transitions. [2022-02-20 23:51:08,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:51:08,620 INFO L225 Difference]: With dead ends: 30 [2022-02-20 23:51:08,620 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 23:51:08,621 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:51:08,626 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 30 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:51:08,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 87 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:51:08,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 23:51:08,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2022-02-20 23:51:08,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:51:08,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 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:51:08,634 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 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:51:08,635 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 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:51:08,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:08,638 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-02-20 23:51:08,638 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-02-20 23:51:08,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:08,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:08,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 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 30 states. [2022-02-20 23:51:08,639 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 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 30 states. [2022-02-20 23:51:08,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:51:08,644 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-02-20 23:51:08,644 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-02-20 23:51:08,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:51:08,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:51:08,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:51:08,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:51:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 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:51:08,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-02-20 23:51:08,647 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 12 [2022-02-20 23:51:08,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:51:08,648 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-02-20 23:51:08,648 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:51:08,648 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-02-20 23:51:08,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:51:08,649 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:51:08,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:51:08,656 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:51:08,856 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:51:08,856 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:51:08,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:51:08,857 INFO L85 PathProgramCache]: Analyzing trace with hash -88561022, now seen corresponding path program 1 times [2022-02-20 23:51:08,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:51:08,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032524508] [2022-02-20 23:51:08,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:51:08,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:51:08,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:51:08,868 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:51:08,870 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:51:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:51:08,899 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:51:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:51:08,947 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 23:51:08,947 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:51:08,947 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2022-02-20 23:51:08,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE (2 of 4 remaining) [2022-02-20 23:51:08,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (1 of 4 remaining) [2022-02-20 23:51:08,949 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (0 of 4 remaining) [2022-02-20 23:51:08,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:51:09,149 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:51:09,152 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 23:51:09,154 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:51:09,161 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret38 := ldv_malloc(4bv32); [2022-02-20 23:51:09,162 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getProgramExecutionAsString(UnprovableResult.java:132) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getLongDescription(UnprovableResult.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 23:51:09,164 INFO L158 Benchmark]: Toolchain (without parser) took 3605.64ms. Allocated memory was 48.2MB in the beginning and 71.3MB in the end (delta: 23.1MB). Free memory was 24.0MB in the beginning and 29.4MB in the end (delta: -5.4MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2022-02-20 23:51:09,164 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 48.2MB. Free memory was 30.7MB in the beginning and 30.7MB in the end (delta: 37.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:51:09,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 597.51ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 23.8MB in the beginning and 34.9MB in the end (delta: -11.1MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2022-02-20 23:51:09,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.49ms. Allocated memory is still 58.7MB. Free memory was 34.7MB in the beginning and 32.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:51:09,168 INFO L158 Benchmark]: Boogie Preprocessor took 45.57ms. Allocated memory is still 58.7MB. Free memory was 32.4MB in the beginning and 31.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:51:09,168 INFO L158 Benchmark]: RCFGBuilder took 329.21ms. Allocated memory is still 58.7MB. Free memory was 31.0MB in the beginning and 34.8MB in the end (delta: -3.8MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2022-02-20 23:51:09,169 INFO L158 Benchmark]: TraceAbstraction took 2559.19ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 34.3MB in the beginning and 29.4MB in the end (delta: 4.9MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2022-02-20 23:51:09,170 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.18ms. Allocated memory is still 48.2MB. Free memory was 30.7MB in the beginning and 30.7MB in the end (delta: 37.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 597.51ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 23.8MB in the beginning and 34.9MB in the end (delta: -11.1MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.49ms. Allocated memory is still 58.7MB. Free memory was 34.7MB in the beginning and 32.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.57ms. Allocated memory is still 58.7MB. Free memory was 32.4MB in the beginning and 31.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 329.21ms. Allocated memory is still 58.7MB. Free memory was 31.0MB in the beginning and 34.8MB in the end (delta: -3.8MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2559.19ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 34.3MB in the beginning and 29.4MB in the end (delta: 4.9MB). Peak memory consumption was 17.7MB. 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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 23:51:09,202 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: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator