./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test9.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_test9.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 d93866bdcd748cdf15837797eb67e5b49645998c33f9f4788420360893eea3e2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:53:34,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:53:34,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:53:34,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:53:34,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:53:34,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:53:34,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:53:34,177 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:53:34,179 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:53:34,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:53:34,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:53:34,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:53:34,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:53:34,190 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:53:34,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:53:34,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:53:34,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:53:34,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:53:34,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:53:34,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:53:34,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:53:34,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:53:34,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:53:34,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:53:34,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:53:34,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:53:34,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:53:34,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:53:34,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:53:34,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:53:34,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:53:34,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:53:34,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:53:34,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:53:34,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:53:34,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:53:34,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:53:34,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:53:34,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:53:34,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:53:34,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:53:34,226 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:53:34,256 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:53:34,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:53:34,257 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:53:34,257 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:53:34,258 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:53:34,258 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:53:34,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:53:34,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:53:34,259 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:53:34,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:53:34,260 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:53:34,260 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:53:34,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:53:34,261 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:53:34,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:53:34,261 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:53:34,261 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:53:34,261 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:53:34,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:53:34,262 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:53:34,262 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:53:34,262 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:53:34,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:53:34,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:53:34,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:53:34,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:53:34,263 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:53:34,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:53:34,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:53:34,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:53:34,265 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 -> d93866bdcd748cdf15837797eb67e5b49645998c33f9f4788420360893eea3e2 [2022-02-20 23:53:34,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:53:34,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:53:34,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:53:34,508 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:53:34,509 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:53:34,510 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test9.i [2022-02-20 23:53:34,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a3886fc/c913fbee59cd4f55960934bde8433311/FLAG94abbff3e [2022-02-20 23:53:34,984 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:53:34,984 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test9.i [2022-02-20 23:53:35,000 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a3886fc/c913fbee59cd4f55960934bde8433311/FLAG94abbff3e [2022-02-20 23:53:35,312 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04a3886fc/c913fbee59cd4f55960934bde8433311 [2022-02-20 23:53:35,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:53:35,316 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:53:35,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:53:35,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:53:35,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:53:35,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:53:35" (1/1) ... [2022-02-20 23:53:35,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ba83131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:35, skipping insertion in model container [2022-02-20 23:53:35,324 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:53:35" (1/1) ... [2022-02-20 23:53:35,330 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:53:35,366 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:53:35,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:53:35,731 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:53:35,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@e67e58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:35, skipping insertion in model container [2022-02-20 23:53:35,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:53:35,732 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:53:35,734 INFO L158 Benchmark]: Toolchain (without parser) took 417.65ms. Allocated memory is still 92.3MB. Free memory was 69.7MB in the beginning and 62.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:53:35,734 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 75.5MB. Free memory is still 55.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:53:35,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.42ms. Allocated memory is still 92.3MB. Free memory was 69.4MB in the beginning and 62.4MB in the end (delta: 7.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 23:53:35,740 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.20ms. Allocated memory is still 75.5MB. Free memory is still 55.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.42ms. Allocated memory is still 92.3MB. Free memory was 69.4MB in the beginning and 62.4MB in the end (delta: 7.0MB). 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_test9.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 d93866bdcd748cdf15837797eb67e5b49645998c33f9f4788420360893eea3e2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:53:37,418 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:53:37,419 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:53:37,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:53:37,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:53:37,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:53:37,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:53:37,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:53:37,462 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:53:37,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:53:37,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:53:37,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:53:37,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:53:37,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:53:37,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:53:37,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:53:37,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:53:37,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:53:37,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:53:37,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:53:37,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:53:37,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:53:37,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:53:37,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:53:37,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:53:37,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:53:37,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:53:37,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:53:37,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:53:37,509 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:53:37,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:53:37,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:53:37,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:53:37,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:53:37,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:53:37,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:53:37,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:53:37,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:53:37,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:53:37,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:53:37,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:53:37,520 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:53:37,547 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:53:37,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:53:37,551 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:53:37,551 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:53:37,552 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:53:37,552 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:53:37,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:53:37,554 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:53:37,554 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:53:37,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:53:37,555 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:53:37,556 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:53:37,556 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:53:37,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:53:37,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:53:37,556 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:53:37,557 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:53:37,557 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:53:37,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:53:37,557 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:53:37,558 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:53:37,558 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:53:37,558 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:53:37,558 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:53:37,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:53:37,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:53:37,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:53:37,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:53:37,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:53:37,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:53:37,560 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:53:37,560 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:53:37,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:53:37,561 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 -> d93866bdcd748cdf15837797eb67e5b49645998c33f9f4788420360893eea3e2 [2022-02-20 23:53:37,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:53:37,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:53:37,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:53:37,908 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:53:37,908 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:53:37,909 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test9.i [2022-02-20 23:53:37,967 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1543ff268/3ac5197cc2f34eb4954af482e501c0ae/FLAG5e68ec1e7 [2022-02-20 23:53:38,430 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:53:38,430 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test9.i [2022-02-20 23:53:38,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1543ff268/3ac5197cc2f34eb4954af482e501c0ae/FLAG5e68ec1e7 [2022-02-20 23:53:38,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1543ff268/3ac5197cc2f34eb4954af482e501c0ae [2022-02-20 23:53:38,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:53:38,765 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:53:38,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:53:38,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:53:38,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:53:38,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:53:38" (1/1) ... [2022-02-20 23:53:38,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f41263b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:38, skipping insertion in model container [2022-02-20 23:53:38,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:53:38" (1/1) ... [2022-02-20 23:53:38,779 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:53:38,826 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:53:39,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:53:39,241 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:53:39,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:53:39,302 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:53:39,316 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:53:39,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:53:39,424 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:53:39,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:39 WrapperNode [2022-02-20 23:53:39,425 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:53:39,426 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:53:39,426 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:53:39,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:53:39,432 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:53:39" (1/1) ... [2022-02-20 23:53:39,451 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:53:39" (1/1) ... [2022-02-20 23:53:39,468 INFO L137 Inliner]: procedures = 167, calls = 71, calls flagged for inlining = 23, calls inlined = 5, statements flattened = 30 [2022-02-20 23:53:39,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:53:39,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:53:39,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:53:39,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:53:39,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:39" (1/1) ... [2022-02-20 23:53:39,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:39" (1/1) ... [2022-02-20 23:53:39,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:39" (1/1) ... [2022-02-20 23:53:39,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:39" (1/1) ... [2022-02-20 23:53:39,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:39" (1/1) ... [2022-02-20 23:53:39,491 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:39" (1/1) ... [2022-02-20 23:53:39,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:39" (1/1) ... [2022-02-20 23:53:39,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:53:39,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:53:39,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:53:39,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:53:39,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:39" (1/1) ... [2022-02-20 23:53:39,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:53:39,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:53:39,541 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:53:39,566 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:53:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 23:53:39,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 23:53:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:53:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:53:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:53:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:53:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:53:39,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:53:39,683 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:53:39,685 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:53:39,873 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:53:39,879 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:53:39,880 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:53:39,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:53:39 BoogieIcfgContainer [2022-02-20 23:53:39,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:53:39,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:53:39,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:53:39,885 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:53:39,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:53:38" (1/3) ... [2022-02-20 23:53:39,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c739269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:53:39, skipping insertion in model container [2022-02-20 23:53:39,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:39" (2/3) ... [2022-02-20 23:53:39,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c739269 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:53:39, skipping insertion in model container [2022-02-20 23:53:39,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:53:39" (3/3) ... [2022-02-20 23:53:39,888 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test9.i [2022-02-20 23:53:39,893 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:53:39,893 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-02-20 23:53:39,940 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:53:39,948 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:53:39,948 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 23:53:39,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 17 states have (on average 1.411764705882353) internal successors, (24), 21 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:39,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:53:39,975 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:39,975 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:39,976 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:53:39,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:39,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2147112549, now seen corresponding path program 1 times [2022-02-20 23:53:39,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:53:39,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615352014] [2022-02-20 23:53:39,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:39,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:53:39,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:53:40,003 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:53:40,042 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:53:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:40,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:53:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:40,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:53:40,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#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);~a9~0.base, ~a9~0.offset := 0bv32, 0bv32; {27#true} is VALID [2022-02-20 23:53:40,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret39#1, entry_point_~ret~0#1;assume { :begin_inline_probe_9 } true;havoc probe_9_#res#1;havoc probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset; {27#true} is VALID [2022-02-20 23:53:40,263 INFO L272 TraceCheckUtils]: 2: Hoare triple {27#true} call probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset := ldv_malloc(4bv32); {27#true} is VALID [2022-02-20 23:53:40,263 INFO L290 TraceCheckUtils]: 3: Hoare triple {27#true} ~size := #in~size; {27#true} is VALID [2022-02-20 23:53:40,264 INFO L290 TraceCheckUtils]: 4: Hoare triple {27#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; {44#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:53:40,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {44#(= |ldv_malloc_#res.offset| (_ bv0 32))} assume true; {44#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:53:40,266 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {44#(= |ldv_malloc_#res.offset| (_ bv0 32))} {27#true} #40#return; {51#(= |ULTIMATE.start_probe_9_#t~ret38#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:53:40,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {51#(= |ULTIMATE.start_probe_9_#t~ret38#1.offset| (_ bv0 32))} ~a9~0.base, ~a9~0.offset := probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset;havoc probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset; {55#(= ~a9~0.offset (_ bv0 32))} is VALID [2022-02-20 23:53:40,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {55#(= ~a9~0.offset (_ bv0 32))} assume ~a9~0.base != 0bv32 || ~a9~0.offset != 0bv32;probe_9_#res#1 := 0bv32; {55#(= ~a9~0.offset (_ bv0 32))} is VALID [2022-02-20 23:53:40,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {55#(= ~a9~0.offset (_ bv0 32))} entry_point_#t~ret39#1 := probe_9_#res#1;assume { :end_inline_probe_9 } true;entry_point_~ret~0#1 := entry_point_#t~ret39#1;havoc entry_point_#t~ret39#1; {55#(= ~a9~0.offset (_ bv0 32))} is VALID [2022-02-20 23:53:40,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {55#(= ~a9~0.offset (_ bv0 32))} assume 0bv32 == entry_point_~ret~0#1;assume { :begin_inline_disconnect_9 } true; {55#(= ~a9~0.offset (_ bv0 32))} is VALID [2022-02-20 23:53:40,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {55#(= ~a9~0.offset (_ bv0 32))} assume !(0bv32 == ~a9~0.offset); {28#false} is VALID [2022-02-20 23:53:40,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:40,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:53:40,275 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:53:40,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615352014] [2022-02-20 23:53:40,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615352014] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:40,277 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:40,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:53:40,278 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485539737] [2022-02-20 23:53:40,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:40,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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:53:40,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:40,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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:53:40,306 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:53:40,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:53:40,307 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:53:40,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:53:40,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:53:40,336 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.411764705882353) internal successors, (24), 21 states have internal predecessors, (24), 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 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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:53:40,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:40,488 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-02-20 23:53:40,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:53:40,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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:53:40,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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:53:40,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-02-20 23:53:40,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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:53:40,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-02-20 23:53:40,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-02-20 23:53:40,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:40,543 INFO L225 Difference]: With dead ends: 23 [2022-02-20 23:53:40,543 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 23:53:40,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:53:40,547 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:40,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:53:40,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 23:53:40,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 23:53:40,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:40,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 18 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:53:40,571 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 18 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:53:40,571 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 18 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:53:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:40,574 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 23:53:40,574 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 23:53:40,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:40,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:40,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 18 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 21 states. [2022-02-20 23:53:40,575 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 18 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 21 states. [2022-02-20 23:53:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:40,578 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 23:53:40,578 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 23:53:40,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:40,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:40,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:40,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 18 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:53:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-02-20 23:53:40,582 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2022-02-20 23:53:40,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:40,582 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-20 23:53:40,582 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 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:53:40,583 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 23:53:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:53:40,583 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:40,583 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:40,598 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:53:40,792 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:53:40,793 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:53:40,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:40,793 INFO L85 PathProgramCache]: Analyzing trace with hash 2135979633, now seen corresponding path program 1 times [2022-02-20 23:53:40,794 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:53:40,794 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620029471] [2022-02-20 23:53:40,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:40,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:53:40,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:53:40,797 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:53:40,799 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:53:40,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:40,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:53:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:40,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:53:41,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {157#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);~a9~0.base, ~a9~0.offset := 0bv32, 0bv32; {162#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:53:41,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret39#1, entry_point_~ret~0#1;assume { :begin_inline_probe_9 } true;havoc probe_9_#res#1;havoc probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset; {162#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:53:41,028 INFO L272 TraceCheckUtils]: 2: Hoare triple {162#(bvult (_ bv0 32) |#StackHeapBarrier|)} call probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset := ldv_malloc(4bv32); {162#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:53:41,029 INFO L290 TraceCheckUtils]: 3: Hoare triple {162#(bvult (_ bv0 32) |#StackHeapBarrier|)} ~size := #in~size; {162#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:53:41,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {162#(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; {175#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} is VALID [2022-02-20 23:53:41,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {175#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} assume true; {175#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} is VALID [2022-02-20 23:53:41,031 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {175#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} {162#(bvult (_ bv0 32) |#StackHeapBarrier|)} #40#return; {182#(and (not (= |ULTIMATE.start_probe_9_#t~ret38#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_probe_9_#t~ret38#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:53:41,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {182#(and (not (= |ULTIMATE.start_probe_9_#t~ret38#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_probe_9_#t~ret38#1.base| |#StackHeapBarrier|))} ~a9~0.base, ~a9~0.offset := probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset;havoc probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset; {186#(and (not (= ~a9~0.base (_ bv0 32))) (bvult ~a9~0.base |#StackHeapBarrier|))} is VALID [2022-02-20 23:53:41,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {186#(and (not (= ~a9~0.base (_ bv0 32))) (bvult ~a9~0.base |#StackHeapBarrier|))} assume ~a9~0.base != 0bv32 || ~a9~0.offset != 0bv32;probe_9_#res#1 := 0bv32; {186#(and (not (= ~a9~0.base (_ bv0 32))) (bvult ~a9~0.base |#StackHeapBarrier|))} is VALID [2022-02-20 23:53:41,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {186#(and (not (= ~a9~0.base (_ bv0 32))) (bvult ~a9~0.base |#StackHeapBarrier|))} entry_point_#t~ret39#1 := probe_9_#res#1;assume { :end_inline_probe_9 } true;entry_point_~ret~0#1 := entry_point_#t~ret39#1;havoc entry_point_#t~ret39#1; {186#(and (not (= ~a9~0.base (_ bv0 32))) (bvult ~a9~0.base |#StackHeapBarrier|))} is VALID [2022-02-20 23:53:41,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {186#(and (not (= ~a9~0.base (_ bv0 32))) (bvult ~a9~0.base |#StackHeapBarrier|))} assume 0bv32 == entry_point_~ret~0#1;assume { :begin_inline_disconnect_9 } true; {186#(and (not (= ~a9~0.base (_ bv0 32))) (bvult ~a9~0.base |#StackHeapBarrier|))} is VALID [2022-02-20 23:53:41,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {186#(and (not (= ~a9~0.base (_ bv0 32))) (bvult ~a9~0.base |#StackHeapBarrier|))} assume 0bv32 == ~a9~0.offset; {186#(and (not (= ~a9~0.base (_ bv0 32))) (bvult ~a9~0.base |#StackHeapBarrier|))} is VALID [2022-02-20 23:53:41,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {186#(and (not (= ~a9~0.base (_ bv0 32))) (bvult ~a9~0.base |#StackHeapBarrier|))} assume !~bvult32(~a9~0.base, #StackHeapBarrier); {158#false} is VALID [2022-02-20 23:53:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:41,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:53:41,037 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:53:41,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620029471] [2022-02-20 23:53:41,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [620029471] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:41,037 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:41,038 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:53:41,038 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302914471] [2022-02-20 23:53:41,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:41,039 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:53:41,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:41,041 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:41,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:41,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:53:41,057 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:53:41,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:53:41,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:53:41,059 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:41,265 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-20 23:53:41,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:53:41,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:53:41,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:41,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 23:53:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-02-20 23:53:41,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-02-20 23:53:41,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:41,317 INFO L225 Difference]: With dead ends: 33 [2022-02-20 23:53:41,318 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 23:53:41,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:53:41,319 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 35 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:41,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 51 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:53:41,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 23:53:41,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-02-20 23:53:41,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:41,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 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:53:41,323 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 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:53:41,325 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 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:53:41,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:41,332 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-20 23:53:41,332 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-02-20 23:53:41,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:41,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:41,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 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 33 states. [2022-02-20 23:53:41,335 INFO L87 Difference]: Start difference. First operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 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 33 states. [2022-02-20 23:53:41,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:41,341 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-02-20 23:53:41,341 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-02-20 23:53:41,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:41,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:41,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:41,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:41,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 25 states have internal predecessors, (29), 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:53:41,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-02-20 23:53:41,346 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 13 [2022-02-20 23:53:41,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:41,347 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-02-20 23:53:41,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:41,348 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 23:53:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:53:41,348 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:41,348 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:41,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:53:41,557 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:53:41,558 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:53:41,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:41,559 INFO L85 PathProgramCache]: Analyzing trace with hash 328525170, now seen corresponding path program 1 times [2022-02-20 23:53:41,559 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:53:41,559 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916183317] [2022-02-20 23:53:41,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:41,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:53:41,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:53:41,561 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:53:41,563 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:53:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:41,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:53:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:41,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:53:41,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {329#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);~a9~0.base, ~a9~0.offset := 0bv32, 0bv32; {329#true} is VALID [2022-02-20 23:53:41,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {329#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret39#1, entry_point_~ret~0#1;assume { :begin_inline_probe_9 } true;havoc probe_9_#res#1;havoc probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset; {329#true} is VALID [2022-02-20 23:53:41,691 INFO L272 TraceCheckUtils]: 2: Hoare triple {329#true} call probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset := ldv_malloc(4bv32); {329#true} is VALID [2022-02-20 23:53:41,691 INFO L290 TraceCheckUtils]: 3: Hoare triple {329#true} ~size := #in~size; {329#true} is VALID [2022-02-20 23:53:41,692 INFO L290 TraceCheckUtils]: 4: Hoare triple {329#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {346#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:53:41,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {346#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {346#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:53:41,699 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {346#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {329#true} #40#return; {353#(and (= |ULTIMATE.start_probe_9_#t~ret38#1.base| (_ bv0 32)) (= |ULTIMATE.start_probe_9_#t~ret38#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:53:41,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {353#(and (= |ULTIMATE.start_probe_9_#t~ret38#1.base| (_ bv0 32)) (= |ULTIMATE.start_probe_9_#t~ret38#1.offset| (_ bv0 32)))} ~a9~0.base, ~a9~0.offset := probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset;havoc probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset; {357#(and (= ~a9~0.base (_ bv0 32)) (= ~a9~0.offset (_ bv0 32)))} is VALID [2022-02-20 23:53:41,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {357#(and (= ~a9~0.base (_ bv0 32)) (= ~a9~0.offset (_ bv0 32)))} assume ~a9~0.base != 0bv32 || ~a9~0.offset != 0bv32;probe_9_#res#1 := 0bv32; {330#false} is VALID [2022-02-20 23:53:41,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {330#false} entry_point_#t~ret39#1 := probe_9_#res#1;assume { :end_inline_probe_9 } true;entry_point_~ret~0#1 := entry_point_#t~ret39#1;havoc entry_point_#t~ret39#1; {330#false} is VALID [2022-02-20 23:53:41,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {330#false} assume 0bv32 == entry_point_~ret~0#1;assume { :begin_inline_disconnect_9 } true; {330#false} is VALID [2022-02-20 23:53:41,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {330#false} assume 0bv32 == ~a9~0.offset; {330#false} is VALID [2022-02-20 23:53:41,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {330#false} assume !~bvult32(~a9~0.base, #StackHeapBarrier); {330#false} is VALID [2022-02-20 23:53:41,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:41,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:53:41,704 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:53:41,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916183317] [2022-02-20 23:53:41,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916183317] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:41,704 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:41,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:53:41,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377187304] [2022-02-20 23:53:41,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:41,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:53:41,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:41,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:41,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:41,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:53:41,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:53:41,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:53:41,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:53:41,725 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:41,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:41,902 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-02-20 23:53:41,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:53:41,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:53:41,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:41,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 23:53:41,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:41,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 23:53:41,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-02-20 23:53:41,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:41,952 INFO L225 Difference]: With dead ends: 32 [2022-02-20 23:53:41,952 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 23:53:41,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:53:41,954 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:41,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 82 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:53:41,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 23:53:41,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-02-20 23:53:41,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:41,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 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:53:41,961 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 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:53:41,962 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 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:53:41,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:41,966 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-02-20 23:53:41,966 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-02-20 23:53:41,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:41,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:41,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 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:53:41,968 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 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:53:41,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:41,971 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-02-20 23:53:41,971 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-02-20 23:53:41,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:41,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:41,972 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:41,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:41,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 26 states have internal predecessors, (29), 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:53:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-02-20 23:53:41,978 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 13 [2022-02-20 23:53:41,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:41,979 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-02-20 23:53:41,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-20 23:53:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:53:41,980 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:41,981 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:41,994 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:53:42,190 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:53:42,190 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:53:42,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:42,191 INFO L85 PathProgramCache]: Analyzing trace with hash 330372212, now seen corresponding path program 1 times [2022-02-20 23:53:42,191 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:53:42,191 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403733389] [2022-02-20 23:53:42,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:42,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:53:42,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:53:42,193 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:53:42,195 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:53:42,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:42,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:53:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:42,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:53:42,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {502#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);~a9~0.base, ~a9~0.offset := 0bv32, 0bv32; {502#true} is VALID [2022-02-20 23:53:42,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {502#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret39#1, entry_point_~ret~0#1;assume { :begin_inline_probe_9 } true;havoc probe_9_#res#1;havoc probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset; {502#true} is VALID [2022-02-20 23:53:42,312 INFO L272 TraceCheckUtils]: 2: Hoare triple {502#true} call probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset := ldv_malloc(4bv32); {502#true} is VALID [2022-02-20 23:53:42,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {502#true} ~size := #in~size; {502#true} is VALID [2022-02-20 23:53:42,313 INFO L290 TraceCheckUtils]: 4: Hoare triple {502#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {502#true} is VALID [2022-02-20 23:53:42,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {502#true} assume true; {502#true} is VALID [2022-02-20 23:53:42,314 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {502#true} {502#true} #40#return; {502#true} is VALID [2022-02-20 23:53:42,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {502#true} ~a9~0.base, ~a9~0.offset := probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset;havoc probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset; {502#true} is VALID [2022-02-20 23:53:42,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {502#true} assume !(~a9~0.base != 0bv32 || ~a9~0.offset != 0bv32);probe_9_#res#1 := 3bv32; {531#(= |ULTIMATE.start_probe_9_#res#1| (_ bv3 32))} is VALID [2022-02-20 23:53:42,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {531#(= |ULTIMATE.start_probe_9_#res#1| (_ bv3 32))} entry_point_#t~ret39#1 := probe_9_#res#1;assume { :end_inline_probe_9 } true;entry_point_~ret~0#1 := entry_point_#t~ret39#1;havoc entry_point_#t~ret39#1; {535#(= (_ bv3 32) |ULTIMATE.start_entry_point_~ret~0#1|)} is VALID [2022-02-20 23:53:42,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {535#(= (_ bv3 32) |ULTIMATE.start_entry_point_~ret~0#1|)} assume 0bv32 == entry_point_~ret~0#1;assume { :begin_inline_disconnect_9 } true; {503#false} is VALID [2022-02-20 23:53:42,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {503#false} assume 0bv32 == ~a9~0.offset; {503#false} is VALID [2022-02-20 23:53:42,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {503#false} assume !~bvult32(~a9~0.base, #StackHeapBarrier); {503#false} is VALID [2022-02-20 23:53:42,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:42,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:53:42,322 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:53:42,322 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403733389] [2022-02-20 23:53:42,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403733389] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:42,322 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:42,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:53:42,323 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309221357] [2022-02-20 23:53:42,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:42,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:53:42,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:42,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:42,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:42,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:53:42,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:53:42,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:53:42,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:53:42,338 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:42,412 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-02-20 23:53:42,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:53:42,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 23:53:42,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:42,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:42,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-02-20 23:53:42,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:42,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-02-20 23:53:42,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-02-20 23:53:42,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:42,460 INFO L225 Difference]: With dead ends: 30 [2022-02-20 23:53:42,460 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 23:53:42,461 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:53:42,467 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:42,471 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 61 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:53:42,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 23:53:42,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2022-02-20 23:53:42,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:42,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:53:42,477 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:53:42,477 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:53:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:42,479 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-02-20 23:53:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-02-20 23:53:42,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:42,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:42,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 30 states. [2022-02-20 23:53:42,480 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Second operand 30 states. [2022-02-20 23:53:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:42,481 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-02-20 23:53:42,481 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-02-20 23:53:42,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:42,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:42,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:42,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:42,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:53:42,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-02-20 23:53:42,484 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 13 [2022-02-20 23:53:42,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:42,484 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-02-20 23:53:42,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 23:53:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:53:42,485 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:42,485 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:42,498 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:53:42,694 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:53:42,695 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:53:42,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:42,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1790859239, now seen corresponding path program 1 times [2022-02-20 23:53:42,695 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:53:42,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2007247023] [2022-02-20 23:53:42,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:42,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:53:42,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:53:42,697 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:53:42,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:53:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:42,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:53:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:42,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:53:42,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:53:42,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {662#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);~a9~0.base, ~a9~0.offset := 0bv32, 0bv32; {662#true} is VALID [2022-02-20 23:53:42,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {662#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret39#1, entry_point_~ret~0#1;assume { :begin_inline_probe_9 } true;havoc probe_9_#res#1;havoc probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset; {662#true} is VALID [2022-02-20 23:53:42,835 INFO L272 TraceCheckUtils]: 2: Hoare triple {662#true} call probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset := ldv_malloc(4bv32); {662#true} is VALID [2022-02-20 23:53:42,836 INFO L290 TraceCheckUtils]: 3: Hoare triple {662#true} ~size := #in~size; {662#true} is VALID [2022-02-20 23:53:42,838 INFO L290 TraceCheckUtils]: 4: Hoare triple {662#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; {679#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:53:42,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {679#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {679#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:53:42,840 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {679#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {662#true} #40#return; {686#(= (select |#valid| |ULTIMATE.start_probe_9_#t~ret38#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:53:42,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {686#(= (select |#valid| |ULTIMATE.start_probe_9_#t~ret38#1.base|) (_ bv1 1))} ~a9~0.base, ~a9~0.offset := probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset;havoc probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset; {690#(= (select |#valid| ~a9~0.base) (_ bv1 1))} is VALID [2022-02-20 23:53:42,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {690#(= (select |#valid| ~a9~0.base) (_ bv1 1))} assume ~a9~0.base != 0bv32 || ~a9~0.offset != 0bv32;probe_9_#res#1 := 0bv32; {690#(= (select |#valid| ~a9~0.base) (_ bv1 1))} is VALID [2022-02-20 23:53:42,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {690#(= (select |#valid| ~a9~0.base) (_ bv1 1))} entry_point_#t~ret39#1 := probe_9_#res#1;assume { :end_inline_probe_9 } true;entry_point_~ret~0#1 := entry_point_#t~ret39#1;havoc entry_point_#t~ret39#1; {690#(= (select |#valid| ~a9~0.base) (_ bv1 1))} is VALID [2022-02-20 23:53:42,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {690#(= (select |#valid| ~a9~0.base) (_ bv1 1))} assume 0bv32 == entry_point_~ret~0#1;assume { :begin_inline_disconnect_9 } true; {690#(= (select |#valid| ~a9~0.base) (_ bv1 1))} is VALID [2022-02-20 23:53:42,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {690#(= (select |#valid| ~a9~0.base) (_ bv1 1))} assume 0bv32 == ~a9~0.offset; {690#(= (select |#valid| ~a9~0.base) (_ bv1 1))} is VALID [2022-02-20 23:53:42,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {690#(= (select |#valid| ~a9~0.base) (_ bv1 1))} assume ~bvult32(~a9~0.base, #StackHeapBarrier); {690#(= (select |#valid| ~a9~0.base) (_ bv1 1))} is VALID [2022-02-20 23:53:42,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {690#(= (select |#valid| ~a9~0.base) (_ bv1 1))} assume !(0bv32 == ~a9~0.base || 1bv1 == #valid[~a9~0.base]); {663#false} is VALID [2022-02-20 23:53:42,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:42,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:53:42,843 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:53:42,843 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2007247023] [2022-02-20 23:53:42,844 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2007247023] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:42,844 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:42,844 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:53:42,844 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015288241] [2022-02-20 23:53:42,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:42,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2022-02-20 23:53:42,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:42,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:42,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:42,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:53:42,860 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:53:42,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:53:42,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:53:42,861 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:42,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:42,954 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 23:53:42,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:53:42,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2022-02-20 23:53:42,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:42,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:42,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 23:53:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:42,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 23:53:42,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-02-20 23:53:42,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:42,982 INFO L225 Difference]: With dead ends: 26 [2022-02-20 23:53:42,982 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 23:53:42,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:53:42,983 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:42,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 49 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:53:42,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 23:53:42,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-02-20 23:53:42,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:42,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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:53:42,986 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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:53:42,986 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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:53:42,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:42,987 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 23:53:42,987 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 23:53:42,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:42,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:42,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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 26 states. [2022-02-20 23:53:42,988 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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 26 states. [2022-02-20 23:53:42,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:42,989 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-02-20 23:53:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-02-20 23:53:42,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:42,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:42,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:42,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:42,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 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:53:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-02-20 23:53:42,991 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 14 [2022-02-20 23:53:42,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:42,991 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-02-20 23:53:42,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:42,991 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-02-20 23:53:42,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:53:42,992 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:42,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:43,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:53:43,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:53:43,200 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:53:43,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:43,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1791167080, now seen corresponding path program 1 times [2022-02-20 23:53:43,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:53:43,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357963480] [2022-02-20 23:53:43,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:43,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:53:43,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:53:43,202 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:53:43,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:53:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:43,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:53:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:43,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:53:43,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {811#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);~a9~0.base, ~a9~0.offset := 0bv32, 0bv32; {811#true} is VALID [2022-02-20 23:53:43,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {811#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret39#1, entry_point_~ret~0#1;assume { :begin_inline_probe_9 } true;havoc probe_9_#res#1;havoc probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset; {811#true} is VALID [2022-02-20 23:53:43,294 INFO L272 TraceCheckUtils]: 2: Hoare triple {811#true} call probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset := ldv_malloc(4bv32); {811#true} is VALID [2022-02-20 23:53:43,294 INFO L290 TraceCheckUtils]: 3: Hoare triple {811#true} ~size := #in~size; {811#true} is VALID [2022-02-20 23:53:43,294 INFO L290 TraceCheckUtils]: 4: Hoare triple {811#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; {811#true} is VALID [2022-02-20 23:53:43,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {811#true} assume true; {811#true} is VALID [2022-02-20 23:53:43,294 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {811#true} {811#true} #40#return; {811#true} is VALID [2022-02-20 23:53:43,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {811#true} ~a9~0.base, ~a9~0.offset := probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset;havoc probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset; {811#true} is VALID [2022-02-20 23:53:43,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {811#true} assume ~a9~0.base != 0bv32 || ~a9~0.offset != 0bv32;probe_9_#res#1 := 0bv32; {840#(= |ULTIMATE.start_probe_9_#res#1| (_ bv0 32))} is VALID [2022-02-20 23:53:43,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {840#(= |ULTIMATE.start_probe_9_#res#1| (_ bv0 32))} entry_point_#t~ret39#1 := probe_9_#res#1;assume { :end_inline_probe_9 } true;entry_point_~ret~0#1 := entry_point_#t~ret39#1;havoc entry_point_#t~ret39#1; {844#(= |ULTIMATE.start_entry_point_~ret~0#1| (_ bv0 32))} is VALID [2022-02-20 23:53:43,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {844#(= |ULTIMATE.start_entry_point_~ret~0#1| (_ bv0 32))} assume !(0bv32 == entry_point_~ret~0#1); {812#false} is VALID [2022-02-20 23:53:43,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {812#false} ~a9~0.base, ~a9~0.offset := 0bv32, 0bv32; {812#false} is VALID [2022-02-20 23:53:43,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {812#false} assume { :end_inline_entry_point } true; {812#false} is VALID [2022-02-20 23:53:43,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {812#false} assume !(#valid == main_old_#valid#1); {812#false} is VALID [2022-02-20 23:53:43,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:43,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:53:43,296 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:53:43,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357963480] [2022-02-20 23:53:43,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357963480] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:43,297 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:43,297 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:53:43,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007616977] [2022-02-20 23:53:43,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:43,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2022-02-20 23:53:43,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:43,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:43,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:43,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:53:43,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:53:43,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:53:43,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:53:43,309 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:43,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:43,357 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2022-02-20 23:53:43,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:53:43,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2022-02-20 23:53:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:43,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:43,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-02-20 23:53:43,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:43,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-02-20 23:53:43,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-02-20 23:53:43,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:43,395 INFO L225 Difference]: With dead ends: 29 [2022-02-20 23:53:43,395 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 23:53:43,395 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:53:43,396 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:43,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 47 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:53:43,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 23:53:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-02-20 23:53:43,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:43,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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:53:43,401 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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:53:43,402 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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:53:43,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:43,403 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2022-02-20 23:53:43,403 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2022-02-20 23:53:43,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:43,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:43,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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 29 states. [2022-02-20 23:53:43,405 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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 29 states. [2022-02-20 23:53:43,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:43,406 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2022-02-20 23:53:43,406 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2022-02-20 23:53:43,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:43,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:43,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:43,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:43,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 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:53:43,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-02-20 23:53:43,408 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 14 [2022-02-20 23:53:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:43,408 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-02-20 23:53:43,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:43,410 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-02-20 23:53:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:53:43,411 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:43,411 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:43,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:53:43,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:53:43,619 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:53:43,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:43,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1651911877, now seen corresponding path program 1 times [2022-02-20 23:53:43,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:53:43,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940433416] [2022-02-20 23:53:43,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:43,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:53:43,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:53:43,621 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:53:43,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:53:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:43,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:53:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:43,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:53:43,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {970#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);~a9~0.base, ~a9~0.offset := 0bv32, 0bv32; {970#true} is VALID [2022-02-20 23:53:43,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {970#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret39#1, entry_point_~ret~0#1;assume { :begin_inline_probe_9 } true;havoc probe_9_#res#1;havoc probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset; {978#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:53:43,720 INFO L272 TraceCheckUtils]: 2: Hoare triple {978#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset := ldv_malloc(4bv32); {982#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:53:43,721 INFO L290 TraceCheckUtils]: 3: Hoare triple {982#(= |old(#valid)| |#valid|)} ~size := #in~size; {982#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:53:43,721 INFO L290 TraceCheckUtils]: 4: Hoare triple {982#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {982#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:53:43,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {982#(= |old(#valid)| |#valid|)} assume true; {982#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:53:43,723 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {982#(= |old(#valid)| |#valid|)} {978#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #40#return; {978#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:53:43,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {978#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} ~a9~0.base, ~a9~0.offset := probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset;havoc probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset; {978#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:53:43,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {978#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(~a9~0.base != 0bv32 || ~a9~0.offset != 0bv32);probe_9_#res#1 := 3bv32; {978#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:53:43,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {978#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} entry_point_#t~ret39#1 := probe_9_#res#1;assume { :end_inline_probe_9 } true;entry_point_~ret~0#1 := entry_point_#t~ret39#1;havoc entry_point_#t~ret39#1; {978#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:53:43,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {978#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(0bv32 == entry_point_~ret~0#1); {978#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:53:43,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {978#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} ~a9~0.base, ~a9~0.offset := 0bv32, 0bv32; {978#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:53:43,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {978#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_entry_point } true; {978#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:53:43,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {978#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {971#false} is VALID [2022-02-20 23:53:43,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:43,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:53:43,727 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:53:43,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940433416] [2022-02-20 23:53:43,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940433416] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:43,727 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:43,727 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:53:43,727 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435609747] [2022-02-20 23:53:43,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:43,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2022-02-20 23:53:43,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:43,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:43,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:43,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:53:43,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:53:43,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:53:43,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:53:43,742 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:43,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:43,807 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2022-02-20 23:53:43,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:53:43,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 14 [2022-02-20 23:53:43,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:43,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-02-20 23:53:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-02-20 23:53:43,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-02-20 23:53:43,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:43,833 INFO L225 Difference]: With dead ends: 28 [2022-02-20 23:53:43,833 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 23:53:43,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:53:43,833 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:43,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:53:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 23:53:43,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 23:53:43,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:43,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 16 states have (on average 1.0) internal successors, (16), 16 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:43,835 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 16 states have (on average 1.0) internal successors, (16), 16 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:43,836 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 16 states have (on average 1.0) internal successors, (16), 16 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:43,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:43,836 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2022-02-20 23:53:43,836 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2022-02-20 23:53:43,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:43,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:43,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 16 states have (on average 1.0) internal successors, (16), 16 states have internal predecessors, (16), 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:53:43,837 INFO L87 Difference]: Start difference. First operand has 19 states, 16 states have (on average 1.0) internal successors, (16), 16 states have internal predecessors, (16), 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:53:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:43,838 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2022-02-20 23:53:43,838 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2022-02-20 23:53:43,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:43,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:43,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:43,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 16 states have (on average 1.0) internal successors, (16), 16 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2022-02-20 23:53:43,839 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 14 [2022-02-20 23:53:43,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:43,839 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2022-02-20 23:53:43,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:43,839 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2022-02-20 23:53:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:53:43,840 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:53:43,840 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:43,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:53:44,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:53:44,050 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 1 more)] === [2022-02-20 23:53:44,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:53:44,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1299359058, now seen corresponding path program 1 times [2022-02-20 23:53:44,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:53:44,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821320832] [2022-02-20 23:53:44,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:53:44,051 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:53:44,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:53:44,052 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:53:44,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:53:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:44,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:53:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:53:44,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:53:44,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {1100#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);~a9~0.base, ~a9~0.offset := 0bv32, 0bv32; {1100#true} is VALID [2022-02-20 23:53:44,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {1100#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;assume { :begin_inline_entry_point } true;havoc entry_point_#t~ret39#1, entry_point_~ret~0#1;assume { :begin_inline_probe_9 } true;havoc probe_9_#res#1;havoc probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset; {1108#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:53:44,378 INFO L272 TraceCheckUtils]: 2: Hoare triple {1108#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset := ldv_malloc(4bv32); {1112#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:53:44,378 INFO L290 TraceCheckUtils]: 3: Hoare triple {1112#(= |old(#valid)| |#valid|)} ~size := #in~size; {1112#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:53:44,380 INFO L290 TraceCheckUtils]: 4: Hoare triple {1112#(= |old(#valid)| |#valid|)} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {1119#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_13) |#valid|)))} is VALID [2022-02-20 23:53:44,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {1119#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_13) |#valid|)))} assume true; {1119#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_13) |#valid|)))} is VALID [2022-02-20 23:53:44,382 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1119#(and (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)) (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_13) |#valid|)))} {1108#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #40#return; {1126#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_probe_9_#t~ret38#1.base|))) (exists ((v_ArrVal_13 (_ BitVec 1))) (= |#valid| (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_probe_9_#t~ret38#1.base| v_ArrVal_13))))} is VALID [2022-02-20 23:53:44,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {1126#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_probe_9_#t~ret38#1.base|))) (exists ((v_ArrVal_13 (_ BitVec 1))) (= |#valid| (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_probe_9_#t~ret38#1.base| v_ArrVal_13))))} ~a9~0.base, ~a9~0.offset := probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset;havoc probe_9_#t~ret38#1.base, probe_9_#t~ret38#1.offset; {1130#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a9~0.base v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a9~0.base))))} is VALID [2022-02-20 23:53:44,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {1130#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a9~0.base v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a9~0.base))))} assume ~a9~0.base != 0bv32 || ~a9~0.offset != 0bv32;probe_9_#res#1 := 0bv32; {1130#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a9~0.base v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a9~0.base))))} is VALID [2022-02-20 23:53:44,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {1130#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a9~0.base v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a9~0.base))))} entry_point_#t~ret39#1 := probe_9_#res#1;assume { :end_inline_probe_9 } true;entry_point_~ret~0#1 := entry_point_#t~ret39#1;havoc entry_point_#t~ret39#1; {1130#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a9~0.base v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a9~0.base))))} is VALID [2022-02-20 23:53:44,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {1130#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a9~0.base v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a9~0.base))))} assume 0bv32 == entry_point_~ret~0#1;assume { :begin_inline_disconnect_9 } true; {1130#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a9~0.base v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a9~0.base))))} is VALID [2022-02-20 23:53:44,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {1130#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a9~0.base v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a9~0.base))))} assume 0bv32 == ~a9~0.offset; {1130#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a9~0.base v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a9~0.base))))} is VALID [2022-02-20 23:53:44,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {1130#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a9~0.base v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a9~0.base))))} assume ~bvult32(~a9~0.base, #StackHeapBarrier); {1130#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a9~0.base v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a9~0.base))))} is VALID [2022-02-20 23:53:44,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {1130#(and (exists ((v_ArrVal_13 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a9~0.base v_ArrVal_13) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a9~0.base))))} assume 0bv32 == ~a9~0.base || 1bv1 == #valid[~a9~0.base];call ULTIMATE.dealloc(~a9~0.base, ~a9~0.offset); {1149#(exists ((~a9~0.base (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a9~0.base))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a9~0.base (_ bv0 1)) |#valid|)))} is VALID [2022-02-20 23:53:44,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {1149#(exists ((~a9~0.base (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a9~0.base))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a9~0.base (_ bv0 1)) |#valid|)))} assume { :end_inline_disconnect_9 } true; {1149#(exists ((~a9~0.base (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a9~0.base))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a9~0.base (_ bv0 1)) |#valid|)))} is VALID [2022-02-20 23:53:44,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {1149#(exists ((~a9~0.base (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a9~0.base))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a9~0.base (_ bv0 1)) |#valid|)))} ~a9~0.base, ~a9~0.offset := 0bv32, 0bv32; {1149#(exists ((~a9~0.base (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a9~0.base))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a9~0.base (_ bv0 1)) |#valid|)))} is VALID [2022-02-20 23:53:44,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {1149#(exists ((~a9~0.base (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a9~0.base))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a9~0.base (_ bv0 1)) |#valid|)))} assume { :end_inline_entry_point } true; {1149#(exists ((~a9~0.base (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a9~0.base))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a9~0.base (_ bv0 1)) |#valid|)))} is VALID [2022-02-20 23:53:44,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {1149#(exists ((~a9~0.base (_ BitVec 32))) (and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| ~a9~0.base))) (= (store |ULTIMATE.start_main_old_#valid#1| ~a9~0.base (_ bv0 1)) |#valid|)))} assume !(#valid == main_old_#valid#1); {1101#false} is VALID [2022-02-20 23:53:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:53:44,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:53:44,393 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:53:44,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821320832] [2022-02-20 23:53:44,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821320832] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:53:44,397 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:53:44,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:53:44,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631784079] [2022-02-20 23:53:44,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:53:44,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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 18 [2022-02-20 23:53:44,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:53:44,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:44,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:44,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:53:44,419 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:53:44,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:53:44,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:53:44,420 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:44,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:44,483 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2022-02-20 23:53:44,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:53:44,483 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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 18 [2022-02-20 23:53:44,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:53:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2022-02-20 23:53:44,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:44,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2022-02-20 23:53:44,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 18 transitions. [2022-02-20 23:53:44,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:53:44,504 INFO L225 Difference]: With dead ends: 18 [2022-02-20 23:53:44,504 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 23:53:44,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:53:44,504 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:53:44,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 47 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 21 Unchecked, 0.0s Time] [2022-02-20 23:53:44,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 23:53:44,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 23:53:44,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:53:44,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:44,505 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:44,505 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:44,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:44,505 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:53:44,506 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:53:44,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:44,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:44,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 23:53:44,506 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 23:53:44,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:53:44,506 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 23:53:44,506 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:53:44,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:44,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:53:44,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:53:44,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:53:44,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:53:44,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 23:53:44,507 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-02-20 23:53:44,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:53:44,507 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 23:53:44,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:53:44,507 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 23:53:44,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:53:44,509 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_FREE (3 of 4 remaining) [2022-02-20 23:53:44,509 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (2 of 4 remaining) [2022-02-20 23:53:44,509 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (1 of 4 remaining) [2022-02-20 23:53:44,509 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_LEAK (0 of 4 remaining) [2022-02-20 23:53:44,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:53:44,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:53:44,712 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:53:44,713 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:53:44,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:53:44 BoogieIcfgContainer [2022-02-20 23:53:44,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:53:44,716 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:53:44,716 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:53:44,717 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:53:44,717 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:53:39" (3/4) ... [2022-02-20 23:53:44,719 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 23:53:44,724 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-02-20 23:53:44,728 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-02-20 23:53:44,728 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 23:53:44,728 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 23:53:44,757 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:53:44,758 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:53:44,759 INFO L158 Benchmark]: Toolchain (without parser) took 5993.61ms. Allocated memory was 52.4MB in the beginning and 83.9MB in the end (delta: 31.5MB). Free memory was 28.2MB in the beginning and 52.1MB in the end (delta: -24.0MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2022-02-20 23:53:44,759 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 52.4MB. Free memory was 33.9MB in the beginning and 33.8MB in the end (delta: 37.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:53:44,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 657.75ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 27.9MB in the beginning and 47.0MB in the end (delta: -19.1MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2022-02-20 23:53:44,760 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.85ms. Allocated memory is still 69.2MB. Free memory was 47.0MB in the beginning and 44.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:53:44,760 INFO L158 Benchmark]: Boogie Preprocessor took 25.81ms. Allocated memory is still 69.2MB. Free memory was 44.9MB in the beginning and 43.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:53:44,760 INFO L158 Benchmark]: RCFGBuilder took 385.38ms. Allocated memory is still 69.2MB. Free memory was 43.4MB in the beginning and 32.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:53:44,760 INFO L158 Benchmark]: TraceAbstraction took 4833.09ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 32.0MB in the beginning and 55.0MB in the end (delta: -23.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:53:44,761 INFO L158 Benchmark]: Witness Printer took 41.44ms. Allocated memory is still 83.9MB. Free memory was 55.0MB in the beginning and 52.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 23:53:44,764 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 52.4MB. Free memory was 33.9MB in the beginning and 33.8MB in the end (delta: 37.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 657.75ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 27.9MB in the beginning and 47.0MB in the end (delta: -19.1MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.85ms. Allocated memory is still 69.2MB. Free memory was 47.0MB in the beginning and 44.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.81ms. Allocated memory is still 69.2MB. Free memory was 44.9MB in the beginning and 43.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 385.38ms. Allocated memory is still 69.2MB. Free memory was 43.4MB in the beginning and 32.3MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4833.09ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 32.0MB in the beginning and 55.0MB in the end (delta: -23.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 41.44ms. Allocated memory is still 83.9MB. Free memory was 55.0MB in the beginning and 52.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 766]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 766]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 766]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 775]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 446 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 21 IncrementalHoareTripleChecker+Unchecked, 283 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 148 IncrementalHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 163 mSDtfsCounter, 148 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 109 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=3, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 103 ConstructedInterpolants, 13 QuantifiedInterpolants, 448 SizeOfPredicates, 3 NumberOfNonLiveVariables, 349 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 23:53:44,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE