./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.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_test10-2.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 5fd80c822f4c545ea9a48882a667e8fa2630e37e10bf15ea7aea35e48f16af74 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:49:46,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:49:46,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:49:46,606 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:49:46,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:49:46,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:49:46,612 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:49:46,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:49:46,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:49:46,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:49:46,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:49:46,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:49:46,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:49:46,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:49:46,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:49:46,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:49:46,626 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:49:46,627 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:49:46,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:49:46,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:49:46,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:49:46,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:49:46,637 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:49:46,638 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:49:46,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:49:46,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:49:46,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:49:46,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:49:46,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:49:46,643 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:49:46,643 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:49:46,644 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:49:46,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:49:46,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:49:46,646 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:49:46,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:49:46,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:49:46,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:49:46,648 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:49:46,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:49:46,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:49:46,650 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:49:46,674 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:49:46,674 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:49:46,675 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:49:46,675 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:49:46,676 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:49:46,676 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:49:46,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:49:46,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:49:46,676 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:49:46,677 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:49:46,678 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:49:46,678 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:49:46,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:49:46,678 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:49:46,678 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:49:46,678 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:49:46,679 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:49:46,679 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:49:46,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:49:46,679 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:49:46,679 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:49:46,679 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:49:46,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:49:46,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:49:46,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:49:46,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:46,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:49:46,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:49:46,682 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:49:46,682 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:49:46,682 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 -> 5fd80c822f4c545ea9a48882a667e8fa2630e37e10bf15ea7aea35e48f16af74 [2022-02-20 23:49:46,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:49:46,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:49:46,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:49:46,898 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:49:46,899 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:49:46,900 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.i [2022-02-20 23:49:46,946 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d94df4a3/de5848fde7f84ecb9007504893e02800/FLAG01f0d73d3 [2022-02-20 23:49:47,392 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:49:47,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.i [2022-02-20 23:49:47,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d94df4a3/de5848fde7f84ecb9007504893e02800/FLAG01f0d73d3 [2022-02-20 23:49:47,424 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d94df4a3/de5848fde7f84ecb9007504893e02800 [2022-02-20 23:49:47,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:49:47,428 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:49:47,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:47,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:49:47,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:49:47,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:47" (1/1) ... [2022-02-20 23:49:47,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46896daf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:47, skipping insertion in model container [2022-02-20 23:49:47,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:47" (1/1) ... [2022-02-20 23:49:47,438 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:49:47,471 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:49:47,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:47,815 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:49:47,815 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5889d16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:47, skipping insertion in model container [2022-02-20 23:49:47,815 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:47,816 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-02-20 23:49:47,817 INFO L158 Benchmark]: Toolchain (without parser) took 388.86ms. Allocated memory is still 132.1MB. Free memory was 98.8MB in the beginning and 99.9MB in the end (delta: -1.2MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-02-20 23:49:47,817 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 79.7MB. Free memory is still 40.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:49:47,818 INFO L158 Benchmark]: CACSL2BoogieTranslator took 385.92ms. Allocated memory is still 132.1MB. Free memory was 98.5MB in the beginning and 99.9MB in the end (delta: -1.5MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-02-20 23:49:47,819 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 79.7MB. Free memory is still 40.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 385.92ms. Allocated memory is still 132.1MB. Free memory was 98.5MB in the beginning and 99.9MB in the end (delta: -1.5MB). Peak memory consumption was 7.8MB. 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_test10-2.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 5fd80c822f4c545ea9a48882a667e8fa2630e37e10bf15ea7aea35e48f16af74 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:49:49,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:49:49,440 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:49:49,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:49:49,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:49:49,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:49:49,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:49:49,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:49:49,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:49:49,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:49:49,483 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:49:49,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:49:49,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:49:49,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:49:49,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:49:49,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:49:49,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:49:49,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:49:49,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:49:49,497 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:49:49,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:49:49,499 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:49:49,500 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:49:49,501 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:49:49,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:49:49,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:49:49,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:49:49,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:49:49,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:49:49,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:49:49,509 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:49:49,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:49:49,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:49:49,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:49:49,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:49:49,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:49:49,513 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:49:49,513 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:49:49,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:49:49,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:49:49,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:49:49,519 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:49:49,547 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:49:49,547 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:49:49,548 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:49:49,548 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:49:49,549 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:49:49,549 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:49:49,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:49:49,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:49:49,550 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:49:49,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:49:49,551 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:49:49,552 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:49:49,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:49:49,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:49:49,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:49:49,552 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:49:49,552 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:49:49,552 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:49:49,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:49:49,553 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:49:49,553 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:49:49,553 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:49:49,553 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:49:49,553 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:49:49,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:49:49,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:49:49,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:49:49,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:49,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:49:49,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:49:49,561 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:49:49,561 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:49:49,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:49:49,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 -> 5fd80c822f4c545ea9a48882a667e8fa2630e37e10bf15ea7aea35e48f16af74 [2022-02-20 23:49:49,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:49:49,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:49:49,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:49:49,854 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:49:49,855 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:49:49,856 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.i [2022-02-20 23:49:49,903 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac72ca6bc/f76694e2ea1d4a53b7bd88d5adb8efc0/FLAGfa573f528 [2022-02-20 23:49:50,345 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:49:50,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test10-2.i [2022-02-20 23:49:50,359 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac72ca6bc/f76694e2ea1d4a53b7bd88d5adb8efc0/FLAGfa573f528 [2022-02-20 23:49:50,369 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac72ca6bc/f76694e2ea1d4a53b7bd88d5adb8efc0 [2022-02-20 23:49:50,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:49:50,373 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:49:50,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:50,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:49:50,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:49:50,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:50" (1/1) ... [2022-02-20 23:49:50,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72b17777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:50, skipping insertion in model container [2022-02-20 23:49:50,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:50" (1/1) ... [2022-02-20 23:49:50,385 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:49:50,429 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:49:50,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:50,821 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-02-20 23:49:50,829 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:49:50,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:50,909 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:49:50,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:50,997 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:49:50,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:50 WrapperNode [2022-02-20 23:49:50,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:50,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:49:50,999 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:49:50,999 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:49:51,004 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:49:50" (1/1) ... [2022-02-20 23:49:51,025 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:49:50" (1/1) ... [2022-02-20 23:49:51,067 INFO L137 Inliner]: procedures = 167, calls = 92, calls flagged for inlining = 23, calls inlined = 5, statements flattened = 78 [2022-02-20 23:49:51,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:49:51,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:49:51,069 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:49:51,069 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:49:51,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:50" (1/1) ... [2022-02-20 23:49:51,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:50" (1/1) ... [2022-02-20 23:49:51,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:50" (1/1) ... [2022-02-20 23:49:51,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:50" (1/1) ... [2022-02-20 23:49:51,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:50" (1/1) ... [2022-02-20 23:49:51,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:50" (1/1) ... [2022-02-20 23:49:51,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:50" (1/1) ... [2022-02-20 23:49:51,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:49:51,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:49:51,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:49:51,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:49:51,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:50" (1/1) ... [2022-02-20 23:49:51,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:51,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:51,126 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:49:51,163 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:49:51,184 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 23:49:51,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 23:49:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:49:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:49:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:49:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:49:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:49:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:49:51,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:49:51,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:49:51,277 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:49:51,279 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:49:51,597 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:49:51,602 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:49:51,602 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 23:49:51,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:49:51 BoogieIcfgContainer [2022-02-20 23:49:51,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:49:51,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:49:51,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:49:51,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:49:51,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:49:50" (1/3) ... [2022-02-20 23:49:51,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21415a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:49:51, skipping insertion in model container [2022-02-20 23:49:51,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:50" (2/3) ... [2022-02-20 23:49:51,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21415a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:49:51, skipping insertion in model container [2022-02-20 23:49:51,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:49:51" (3/3) ... [2022-02-20 23:49:51,610 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test10-2.i [2022-02-20 23:49:51,614 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:49:51,614 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 43 error locations. [2022-02-20 23:49:51,639 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:49:51,643 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:49:51,644 INFO L340 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2022-02-20 23:49:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 87 states have internal predecessors, (91), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:49:51,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:49:51,664 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:51,665 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:51,665 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2022-02-20 23:49:51,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:51,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1192529059, now seen corresponding path program 1 times [2022-02-20 23:49:51,678 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:51,678 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430863804] [2022-02-20 23:49:51,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:51,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:51,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:51,691 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:49:51,695 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:49:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:51,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:49:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:51,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:51,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {96#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); {96#true} is VALID [2022-02-20 23:49:51,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {96#true} is VALID [2022-02-20 23:49:51,870 INFO L272 TraceCheckUtils]: 2: Hoare triple {96#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {96#true} is VALID [2022-02-20 23:49:51,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {96#true} ~size := #in~size; {96#true} is VALID [2022-02-20 23:49:51,872 INFO L290 TraceCheckUtils]: 4: Hoare triple {96#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; {113#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:51,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {113#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {113#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:51,874 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {113#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {96#true} #114#return; {120#(not (= |ULTIMATE.start_entry_point_#t~ret44#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:51,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {120#(not (= |ULTIMATE.start_entry_point_#t~ret44#1.base| (_ bv0 32)))} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {124#(not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:49:51,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {124#(not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32)))} assume entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32; {97#false} is VALID [2022-02-20 23:49:51,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {97#false} assume { :end_inline_entry_point } true; {97#false} is VALID [2022-02-20 23:49:51,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {97#false} assume !(#valid == main_old_#valid#1); {97#false} is VALID [2022-02-20 23:49:51,876 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:49:51,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:51,877 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:49:51,877 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430863804] [2022-02-20 23:49:51,878 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430863804] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:51,878 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:51,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:49:51,879 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211744509] [2022-02-20 23:49:51,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:51,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:49:51,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:51,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:51,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:51,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:49:51,899 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:49:51,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:49:51,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:51,925 INFO L87 Difference]: Start difference. First operand has 93 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 87 states have internal predecessors, (91), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:52,773 INFO L93 Difference]: Finished difference Result 180 states and 197 transitions. [2022-02-20 23:49:52,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:49:52,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:49:52,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:52,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2022-02-20 23:49:52,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:52,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 198 transitions. [2022-02-20 23:49:52,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 198 transitions. [2022-02-20 23:49:52,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:52,988 INFO L225 Difference]: With dead ends: 180 [2022-02-20 23:49:52,989 INFO L226 Difference]: Without dead ends: 176 [2022-02-20 23:49:52,990 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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:49:52,992 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 83 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:52,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 492 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:49:53,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-02-20 23:49:53,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 95. [2022-02-20 23:49:53,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:53,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 95 states, 46 states have (on average 2.0) internal successors, (92), 88 states have internal predecessors, (92), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 23:49:53,032 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 95 states, 46 states have (on average 2.0) internal successors, (92), 88 states have internal predecessors, (92), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 23:49:53,035 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 95 states, 46 states have (on average 2.0) internal successors, (92), 88 states have internal predecessors, (92), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 23:49:53,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:53,048 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2022-02-20 23:49:53,048 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 193 transitions. [2022-02-20 23:49:53,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:53,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:53,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 46 states have (on average 2.0) internal successors, (92), 88 states have internal predecessors, (92), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Second operand 176 states. [2022-02-20 23:49:53,054 INFO L87 Difference]: Start difference. First operand has 95 states, 46 states have (on average 2.0) internal successors, (92), 88 states have internal predecessors, (92), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Second operand 176 states. [2022-02-20 23:49:53,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:53,069 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2022-02-20 23:49:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 193 transitions. [2022-02-20 23:49:53,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:53,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:53,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:53,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 46 states have (on average 2.0) internal successors, (92), 88 states have internal predecessors, (92), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-20 23:49:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2022-02-20 23:49:53,075 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 11 [2022-02-20 23:49:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:53,076 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2022-02-20 23:49:53,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2022-02-20 23:49:53,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:49:53,077 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:53,077 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:53,088 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:49:53,279 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:49:53,280 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2022-02-20 23:49:53,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:53,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2080032740, now seen corresponding path program 1 times [2022-02-20 23:49:53,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:53,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017437046] [2022-02-20 23:49:53,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:53,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:53,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:53,291 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:49:53,302 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:49:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:53,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:49:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:53,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:53,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {760#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); {760#true} is VALID [2022-02-20 23:49:53,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {768#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:49:53,387 INFO L272 TraceCheckUtils]: 2: Hoare triple {768#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {772#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:49:53,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {772#(= |old(#valid)| |#valid|)} ~size := #in~size; {772#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:49:53,388 INFO L290 TraceCheckUtils]: 4: Hoare triple {772#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {772#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:49:53,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {772#(= |old(#valid)| |#valid|)} assume true; {772#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:49:53,389 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {772#(= |old(#valid)| |#valid|)} {768#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #114#return; {768#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:49:53,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {768#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {768#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:49:53,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {768#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32; {768#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:49:53,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {768#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume { :end_inline_entry_point } true; {768#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:49:53,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {768#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {761#false} is VALID [2022-02-20 23:49:53,391 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:49:53,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:53,391 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:49:53,391 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017437046] [2022-02-20 23:49:53,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017437046] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:53,392 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:53,392 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:49:53,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480026477] [2022-02-20 23:49:53,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:53,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:49:53,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:53,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:53,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:53,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:49:53,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:49:53,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:49:53,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:49:53,412 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:54,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:54,357 INFO L93 Difference]: Finished difference Result 163 states and 179 transitions. [2022-02-20 23:49:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:49:54,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-02-20 23:49:54,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:54,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2022-02-20 23:49:54,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2022-02-20 23:49:54,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 180 transitions. [2022-02-20 23:49:54,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:54,561 INFO L225 Difference]: With dead ends: 163 [2022-02-20 23:49:54,562 INFO L226 Difference]: Without dead ends: 161 [2022-02-20 23:49:54,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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:49:54,563 INFO L933 BasicCegarLoop]: 141 mSDtfsCounter, 63 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:54,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 281 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:49:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-02-20 23:49:54,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 91. [2022-02-20 23:49:54,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:54,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 91 states, 43 states have (on average 2.046511627906977) internal successors, (88), 85 states have internal predecessors, (88), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:49:54,573 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 91 states, 43 states have (on average 2.046511627906977) internal successors, (88), 85 states have internal predecessors, (88), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:49:54,573 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 91 states, 43 states have (on average 2.046511627906977) internal successors, (88), 85 states have internal predecessors, (88), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:49:54,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:54,584 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2022-02-20 23:49:54,584 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 177 transitions. [2022-02-20 23:49:54,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:54,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:54,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 43 states have (on average 2.046511627906977) internal successors, (88), 85 states have internal predecessors, (88), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 161 states. [2022-02-20 23:49:54,592 INFO L87 Difference]: Start difference. First operand has 91 states, 43 states have (on average 2.046511627906977) internal successors, (88), 85 states have internal predecessors, (88), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 161 states. [2022-02-20 23:49:54,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:54,600 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2022-02-20 23:49:54,600 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 177 transitions. [2022-02-20 23:49:54,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:54,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:54,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:54,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:54,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 43 states have (on average 2.046511627906977) internal successors, (88), 85 states have internal predecessors, (88), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:49:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2022-02-20 23:49:54,604 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 11 [2022-02-20 23:49:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:54,604 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2022-02-20 23:49:54,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2022-02-20 23:49:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:49:54,605 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:54,605 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:54,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 23:49:54,828 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:49:54,828 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2022-02-20 23:49:54,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:54,829 INFO L85 PathProgramCache]: Analyzing trace with hash -895923568, now seen corresponding path program 1 times [2022-02-20 23:49:54,831 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:54,831 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940659692] [2022-02-20 23:49:54,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:54,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:54,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:54,833 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:49:54,834 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:49:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:54,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:49:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:54,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:54,918 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:49:55,013 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:49:55,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-02-20 23:49:55,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {1372#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); {1372#true} is VALID [2022-02-20 23:49:55,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {1372#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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {1372#true} is VALID [2022-02-20 23:49:55,027 INFO L272 TraceCheckUtils]: 2: Hoare triple {1372#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {1372#true} is VALID [2022-02-20 23:49:55,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {1372#true} ~size := #in~size; {1372#true} is VALID [2022-02-20 23:49:55,028 INFO L290 TraceCheckUtils]: 4: Hoare triple {1372#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; {1389#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:49:55,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {1389#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {1389#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:49:55,029 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1389#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {1372#true} #114#return; {1396#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:55,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {1396#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1))} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {1400#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:55,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {1400#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} assume !(entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32); {1400#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:55,031 INFO L272 TraceCheckUtils]: 9: Hoare triple {1400#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {1407#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:49:55,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {1407#(= |old(#valid)| |#valid|)} ~size := #in~size; {1407#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:49:55,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {1407#(= |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; {1414#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:49:55,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {1414#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} assume true; {1414#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:49:55,036 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1414#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} {1400#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} #116#return; {1400#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:55,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {1400#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[entry_point_~a10~0#1.base]); {1373#false} is VALID [2022-02-20 23:49:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:55,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:55,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {1400#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[entry_point_~a10~0#1.base]); {1373#false} is VALID [2022-02-20 23:49:55,274 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1430#(forall ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2|))))} {1400#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} #116#return; {1400#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:55,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {1430#(forall ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2|))))} assume true; {1430#(forall ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2|))))} is VALID [2022-02-20 23:49:55,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {1430#(forall ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2|))))} 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; {1430#(forall ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2|))))} is VALID [2022-02-20 23:49:55,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {1430#(forall ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2|))))} ~size := #in~size; {1430#(forall ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2|))))} is VALID [2022-02-20 23:49:55,281 INFO L272 TraceCheckUtils]: 9: Hoare triple {1400#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {1430#(forall ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (select |old(#valid)| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2|) (_ bv1 1))) (= (_ bv1 1) (select |#valid| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_2|))))} is VALID [2022-02-20 23:49:55,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {1400#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} assume !(entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32); {1400#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:55,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {1396#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1))} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {1400#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:55,283 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1389#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {1372#true} #114#return; {1396#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:49:55,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {1389#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {1389#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:49:55,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {1372#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; {1389#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:49:55,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {1372#true} ~size := #in~size; {1372#true} is VALID [2022-02-20 23:49:55,284 INFO L272 TraceCheckUtils]: 2: Hoare triple {1372#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {1372#true} is VALID [2022-02-20 23:49:55,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {1372#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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {1372#true} is VALID [2022-02-20 23:49:55,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {1372#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); {1372#true} is VALID [2022-02-20 23:49:55,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:55,285 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:49:55,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940659692] [2022-02-20 23:49:55,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [940659692] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:55,285 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:49:55,286 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2022-02-20 23:49:55,286 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322528306] [2022-02-20 23:49:55,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:55,286 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 15 [2022-02-20 23:49:55,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:55,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:49:55,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:55,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:49:55,316 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:49:55,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:49:55,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:49:55,317 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:49:56,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:56,516 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-02-20 23:49:56,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:49:56,516 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 15 [2022-02-20 23:49:56,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:49:56,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2022-02-20 23:49:56,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:49:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2022-02-20 23:49:56,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 145 transitions. [2022-02-20 23:49:56,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:56,649 INFO L225 Difference]: With dead ends: 129 [2022-02-20 23:49:56,649 INFO L226 Difference]: Without dead ends: 129 [2022-02-20 23:49:56,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:49:56,659 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 65 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:56,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 336 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 297 Invalid, 0 Unknown, 84 Unchecked, 0.4s Time] [2022-02-20 23:49:56,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-02-20 23:49:56,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 102. [2022-02-20 23:49:56,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:56,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 102 states, 54 states have (on average 1.9259259259259258) internal successors, (104), 93 states have internal predecessors, (104), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 23:49:56,668 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 102 states, 54 states have (on average 1.9259259259259258) internal successors, (104), 93 states have internal predecessors, (104), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 23:49:56,668 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 102 states, 54 states have (on average 1.9259259259259258) internal successors, (104), 93 states have internal predecessors, (104), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 23:49:56,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:56,671 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-02-20 23:49:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2022-02-20 23:49:56,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:56,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:56,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 54 states have (on average 1.9259259259259258) internal successors, (104), 93 states have internal predecessors, (104), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) Second operand 129 states. [2022-02-20 23:49:56,672 INFO L87 Difference]: Start difference. First operand has 102 states, 54 states have (on average 1.9259259259259258) internal successors, (104), 93 states have internal predecessors, (104), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) Second operand 129 states. [2022-02-20 23:49:56,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:56,689 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2022-02-20 23:49:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2022-02-20 23:49:56,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:56,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:56,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:56,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:56,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 54 states have (on average 1.9259259259259258) internal successors, (104), 93 states have internal predecessors, (104), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2022-02-20 23:49:56,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2022-02-20 23:49:56,702 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 15 [2022-02-20 23:49:56,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:56,702 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2022-02-20 23:49:56,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:49:56,703 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2022-02-20 23:49:56,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:49:56,704 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:56,704 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:56,732 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:49:56,911 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:49:56,911 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2022-02-20 23:49:56,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:56,912 INFO L85 PathProgramCache]: Analyzing trace with hash -895923567, now seen corresponding path program 1 times [2022-02-20 23:49:56,913 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:56,913 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314186498] [2022-02-20 23:49:56,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:56,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:56,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:56,914 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:49:56,915 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:49:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:56,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 23:49:56,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:56,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:56,981 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:50:01,148 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:50:01,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:01,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {1957#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); {1957#true} is VALID [2022-02-20 23:50:01,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {1957#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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {1957#true} is VALID [2022-02-20 23:50:01,163 INFO L272 TraceCheckUtils]: 2: Hoare triple {1957#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {1957#true} is VALID [2022-02-20 23:50:01,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {1957#true} ~size := #in~size; {1971#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:01,165 INFO L290 TraceCheckUtils]: 4: Hoare triple {1971#(= ldv_malloc_~size |ldv_malloc_#in~size|)} 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; {1975#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:01,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {1975#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {1975#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:01,166 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1975#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {1957#true} #114#return; {1982#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:01,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {1982#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {1986#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:01,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {1986#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} assume !(entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32); {1986#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:01,168 INFO L272 TraceCheckUtils]: 9: Hoare triple {1986#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {1993#(= |#length| |old(#length)|)} is VALID [2022-02-20 23:50:01,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {1993#(= |#length| |old(#length)|)} ~size := #in~size; {1997#(and (= ldv_malloc_~size |ldv_malloc_#in~size|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:01,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {1997#(and (= ldv_malloc_~size |ldv_malloc_#in~size|) (= |#length| |old(#length)|))} 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; {2001#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| |ldv_malloc_#in~size|) |#length|))} is VALID [2022-02-20 23:50:01,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {2001#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| |ldv_malloc_#in~size|) |#length|))} assume true; {2001#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| |ldv_malloc_#in~size|) |#length|))} is VALID [2022-02-20 23:50:01,171 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2001#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| |ldv_malloc_#in~size|) |#length|))} {1986#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} #116#return; {1986#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:01,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {1986#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, entry_point_~a10~0#1.offset), #length[entry_point_~a10~0#1.base]) && ~bvule32(entry_point_~a10~0#1.offset, ~bvadd32(4bv32, entry_point_~a10~0#1.offset))) && ~bvule32(0bv32, entry_point_~a10~0#1.offset)); {1958#false} is VALID [2022-02-20 23:50:01,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:50:01,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:01,466 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:01,466 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [314186498] [2022-02-20 23:50:01,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [314186498] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:01,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1991773513] [2022-02-20 23:50:01,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:01,467 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:01,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:50:01,482 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:50:01,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-02-20 23:50:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:01,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:50:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:01,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:01,604 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:50:01,609 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:50:03,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:03,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:03,867 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:03,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-02-20 23:50:03,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {1957#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); {1957#true} is VALID [2022-02-20 23:50:03,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {1957#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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {1957#true} is VALID [2022-02-20 23:50:03,879 INFO L272 TraceCheckUtils]: 2: Hoare triple {1957#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {1957#true} is VALID [2022-02-20 23:50:03,879 INFO L290 TraceCheckUtils]: 3: Hoare triple {1957#true} ~size := #in~size; {1971#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:03,880 INFO L290 TraceCheckUtils]: 4: Hoare triple {1971#(= ldv_malloc_~size |ldv_malloc_#in~size|)} 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; {2031#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:03,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {2031#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {2031#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:03,882 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2031#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {1957#true} #114#return; {2038#(and (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:03,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {2038#(and (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {2042#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:03,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {2042#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} assume !(entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32); {2042#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:03,883 INFO L272 TraceCheckUtils]: 9: Hoare triple {2042#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {2049#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:03,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {2049#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {2049#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:03,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {2049#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} 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; {2056#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_24 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_24))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:03,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {2056#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_24 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_24))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {2056#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_24 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_24))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:03,887 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2056#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_24 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_24))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {2042#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} #116#return; {1986#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:03,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {1986#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, entry_point_~a10~0#1.offset), #length[entry_point_~a10~0#1.base]) && ~bvule32(entry_point_~a10~0#1.offset, ~bvadd32(4bv32, entry_point_~a10~0#1.offset))) && ~bvule32(0bv32, entry_point_~a10~0#1.offset)); {1958#false} is VALID [2022-02-20 23:50:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:50:03,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:04,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1991773513] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:04,134 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:04,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-02-20 23:50:04,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975475444] [2022-02-20 23:50:04,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:04,135 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 15 [2022-02-20 23:50:04,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:04,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:50:04,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:04,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:50:04,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:04,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:50:04,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=226, Unknown=3, NotChecked=0, Total=272 [2022-02-20 23:50:04,159 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:50:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:11,845 INFO L93 Difference]: Finished difference Result 177 states and 198 transitions. [2022-02-20 23:50:11,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:50:11,846 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 15 [2022-02-20 23:50:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:11,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:50:11,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2022-02-20 23:50:11,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:50:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2022-02-20 23:50:11,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 195 transitions. [2022-02-20 23:50:12,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:12,035 INFO L225 Difference]: With dead ends: 177 [2022-02-20 23:50:12,035 INFO L226 Difference]: Without dead ends: 177 [2022-02-20 23:50:12,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=56, Invalid=281, Unknown=5, NotChecked=0, Total=342 [2022-02-20 23:50:12,036 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 73 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 214 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:12,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 728 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 845 Invalid, 0 Unknown, 214 Unchecked, 1.3s Time] [2022-02-20 23:50:12,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-02-20 23:50:12,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 137. [2022-02-20 23:50:12,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:12,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 137 states, 87 states have (on average 1.9195402298850575) internal successors, (167), 126 states have internal predecessors, (167), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (14), 9 states have call predecessors, (14), 7 states have call successors, (14) [2022-02-20 23:50:12,041 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 137 states, 87 states have (on average 1.9195402298850575) internal successors, (167), 126 states have internal predecessors, (167), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (14), 9 states have call predecessors, (14), 7 states have call successors, (14) [2022-02-20 23:50:12,042 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 137 states, 87 states have (on average 1.9195402298850575) internal successors, (167), 126 states have internal predecessors, (167), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (14), 9 states have call predecessors, (14), 7 states have call successors, (14) [2022-02-20 23:50:12,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:12,047 INFO L93 Difference]: Finished difference Result 177 states and 198 transitions. [2022-02-20 23:50:12,047 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 198 transitions. [2022-02-20 23:50:12,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:12,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:12,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 87 states have (on average 1.9195402298850575) internal successors, (167), 126 states have internal predecessors, (167), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (14), 9 states have call predecessors, (14), 7 states have call successors, (14) Second operand 177 states. [2022-02-20 23:50:12,048 INFO L87 Difference]: Start difference. First operand has 137 states, 87 states have (on average 1.9195402298850575) internal successors, (167), 126 states have internal predecessors, (167), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (14), 9 states have call predecessors, (14), 7 states have call successors, (14) Second operand 177 states. [2022-02-20 23:50:12,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:12,052 INFO L93 Difference]: Finished difference Result 177 states and 198 transitions. [2022-02-20 23:50:12,052 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 198 transitions. [2022-02-20 23:50:12,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:12,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:12,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:12,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:12,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 87 states have (on average 1.9195402298850575) internal successors, (167), 126 states have internal predecessors, (167), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (14), 9 states have call predecessors, (14), 7 states have call successors, (14) [2022-02-20 23:50:12,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 188 transitions. [2022-02-20 23:50:12,056 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 188 transitions. Word has length 15 [2022-02-20 23:50:12,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:12,056 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 188 transitions. [2022-02-20 23:50:12,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 23:50:12,057 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 188 transitions. [2022-02-20 23:50:12,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:50:12,057 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:12,057 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:12,068 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:50:12,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:12,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:12,471 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2022-02-20 23:50:12,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:12,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1602092369, now seen corresponding path program 1 times [2022-02-20 23:50:12,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:12,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170920646] [2022-02-20 23:50:12,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:12,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:12,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:12,474 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:50:12,475 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:50:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:12,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:50:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:12,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:12,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {2744#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); {2744#true} is VALID [2022-02-20 23:50:12,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {2744#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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {2744#true} is VALID [2022-02-20 23:50:12,607 INFO L272 TraceCheckUtils]: 2: Hoare triple {2744#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {2744#true} is VALID [2022-02-20 23:50:12,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {2744#true} ~size := #in~size; {2744#true} is VALID [2022-02-20 23:50:12,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {2744#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {2761#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:12,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {2761#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {2761#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:12,610 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2761#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {2744#true} #114#return; {2768#(and (= |ULTIMATE.start_entry_point_#t~ret44#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:12,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {2768#(and (= |ULTIMATE.start_entry_point_#t~ret44#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {2772#(and (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:12,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {2772#(and (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} assume !(entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32); {2745#false} is VALID [2022-02-20 23:50:12,611 INFO L272 TraceCheckUtils]: 9: Hoare triple {2745#false} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {2745#false} is VALID [2022-02-20 23:50:12,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {2745#false} ~size := #in~size; {2745#false} is VALID [2022-02-20 23:50:12,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {2745#false} 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; {2745#false} is VALID [2022-02-20 23:50:12,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {2745#false} assume true; {2745#false} is VALID [2022-02-20 23:50:12,611 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {2745#false} {2745#false} #116#return; {2745#false} is VALID [2022-02-20 23:50:12,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {2745#false} assume !(1bv1 == #valid[entry_point_~a10~0#1.base]); {2745#false} is VALID [2022-02-20 23:50:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:50:12,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:12,612 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:12,612 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170920646] [2022-02-20 23:50:12,612 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170920646] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:12,612 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:12,612 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:50:12,612 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581067121] [2022-02-20 23:50:12,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:12,612 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2022-02-20 23:50:12,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:12,613 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:12,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:12,623 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:12,623 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:12,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:12,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:12,624 INFO L87 Difference]: Start difference. First operand 137 states and 188 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:13,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:13,016 INFO L93 Difference]: Finished difference Result 122 states and 163 transitions. [2022-02-20 23:50:13,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:13,016 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2022-02-20 23:50:13,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:13,016 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:13,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-02-20 23:50:13,017 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-02-20 23:50:13,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 97 transitions. [2022-02-20 23:50:13,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:13,092 INFO L225 Difference]: With dead ends: 122 [2022-02-20 23:50:13,092 INFO L226 Difference]: Without dead ends: 120 [2022-02-20 23:50:13,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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:50:13,093 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:13,093 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:50:13,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-20 23:50:13,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-02-20 23:50:13,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:13,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 120 states, 76 states have (on average 1.9342105263157894) internal successors, (147), 112 states have internal predecessors, (147), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-02-20 23:50:13,098 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 120 states, 76 states have (on average 1.9342105263157894) internal successors, (147), 112 states have internal predecessors, (147), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-02-20 23:50:13,098 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 120 states, 76 states have (on average 1.9342105263157894) internal successors, (147), 112 states have internal predecessors, (147), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-02-20 23:50:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:13,101 INFO L93 Difference]: Finished difference Result 120 states and 161 transitions. [2022-02-20 23:50:13,101 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 161 transitions. [2022-02-20 23:50:13,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:13,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:13,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 76 states have (on average 1.9342105263157894) internal successors, (147), 112 states have internal predecessors, (147), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Second operand 120 states. [2022-02-20 23:50:13,102 INFO L87 Difference]: Start difference. First operand has 120 states, 76 states have (on average 1.9342105263157894) internal successors, (147), 112 states have internal predecessors, (147), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Second operand 120 states. [2022-02-20 23:50:13,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:13,108 INFO L93 Difference]: Finished difference Result 120 states and 161 transitions. [2022-02-20 23:50:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 161 transitions. [2022-02-20 23:50:13,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:13,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:13,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:13,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:13,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 76 states have (on average 1.9342105263157894) internal successors, (147), 112 states have internal predecessors, (147), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-02-20 23:50:13,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 161 transitions. [2022-02-20 23:50:13,111 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 161 transitions. Word has length 15 [2022-02-20 23:50:13,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:13,111 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 161 transitions. [2022-02-20 23:50:13,113 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), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:50:13,113 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 161 transitions. [2022-02-20 23:50:13,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:50:13,113 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:13,113 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:13,129 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:50:13,319 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:50:13,320 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2022-02-20 23:50:13,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:13,321 INFO L85 PathProgramCache]: Analyzing trace with hash 684574475, now seen corresponding path program 1 times [2022-02-20 23:50:13,321 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:13,321 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422882613] [2022-02-20 23:50:13,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:13,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:13,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:13,322 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:50:13,324 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:50:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:13,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:50:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:13,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:13,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:50:13,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-02-20 23:50:13,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {3275#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); {3275#true} is VALID [2022-02-20 23:50:13,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {3275#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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {3275#true} is VALID [2022-02-20 23:50:13,459 INFO L272 TraceCheckUtils]: 2: Hoare triple {3275#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {3275#true} is VALID [2022-02-20 23:50:13,459 INFO L290 TraceCheckUtils]: 3: Hoare triple {3275#true} ~size := #in~size; {3275#true} is VALID [2022-02-20 23:50:13,459 INFO L290 TraceCheckUtils]: 4: Hoare triple {3275#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; {3275#true} is VALID [2022-02-20 23:50:13,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {3275#true} assume true; {3275#true} is VALID [2022-02-20 23:50:13,461 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3275#true} {3275#true} #114#return; {3275#true} is VALID [2022-02-20 23:50:13,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {3275#true} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {3275#true} is VALID [2022-02-20 23:50:13,461 INFO L290 TraceCheckUtils]: 8: Hoare triple {3275#true} assume !(entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32); {3275#true} is VALID [2022-02-20 23:50:13,462 INFO L272 TraceCheckUtils]: 9: Hoare triple {3275#true} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {3275#true} is VALID [2022-02-20 23:50:13,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {3275#true} ~size := #in~size; {3275#true} is VALID [2022-02-20 23:50:13,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {3275#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; {3313#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:13,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {3313#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {3313#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:13,463 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3313#(not (= |ldv_malloc_#res.base| (_ bv0 32)))} {3275#true} #116#return; {3320#(not (= |ULTIMATE.start_entry_point_#t~ret45#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:13,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {3320#(not (= |ULTIMATE.start_entry_point_#t~ret45#1.base| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L775-1 {3324#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} is VALID [2022-02-20 23:50:13,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {3324#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {3324#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} is VALID [2022-02-20 23:50:13,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {3324#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} SUMMARY for call entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L776 {3331#(not (= |ULTIMATE.start_entry_point_#t~mem46#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:13,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {3331#(not (= |ULTIMATE.start_entry_point_#t~mem46#1.base| (_ bv0 32)))} assume entry_point_#t~mem46#1.base == 0bv32 && entry_point_#t~mem46#1.offset == 0bv32;havoc entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset; {3276#false} is VALID [2022-02-20 23:50:13,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {3276#false} assume 0bv32 == entry_point_~a10~0#1.offset; {3276#false} is VALID [2022-02-20 23:50:13,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {3276#false} assume !~bvult32(entry_point_~a10~0#1.base, #StackHeapBarrier); {3276#false} is VALID [2022-02-20 23:50:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:13,469 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:13,469 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:13,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422882613] [2022-02-20 23:50:13,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422882613] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:13,469 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:13,470 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:50:13,470 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753576712] [2022-02-20 23:50:13,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:13,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-02-20 23:50:13,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:13,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:50:13,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:13,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:50:13,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:13,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:50:13,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:13,485 INFO L87 Difference]: Start difference. First operand 120 states and 161 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:50:14,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:14,040 INFO L93 Difference]: Finished difference Result 130 states and 175 transitions. [2022-02-20 23:50:14,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:50:14,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-02-20 23:50:14,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:14,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:50:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-02-20 23:50:14,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:50:14,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-02-20 23:50:14,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 106 transitions. [2022-02-20 23:50:14,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:14,136 INFO L225 Difference]: With dead ends: 130 [2022-02-20 23:50:14,136 INFO L226 Difference]: Without dead ends: 130 [2022-02-20 23:50:14,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:50:14,138 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 5 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:14,138 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 406 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:50:14,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-02-20 23:50:14,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2022-02-20 23:50:14,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:14,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 124 states, 80 states have (on average 1.8875) internal successors, (151), 115 states have internal predecessors, (151), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-02-20 23:50:14,155 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 124 states, 80 states have (on average 1.8875) internal successors, (151), 115 states have internal predecessors, (151), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-02-20 23:50:14,155 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 124 states, 80 states have (on average 1.8875) internal successors, (151), 115 states have internal predecessors, (151), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-02-20 23:50:14,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:14,158 INFO L93 Difference]: Finished difference Result 130 states and 175 transitions. [2022-02-20 23:50:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 175 transitions. [2022-02-20 23:50:14,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:14,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:14,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 80 states have (on average 1.8875) internal successors, (151), 115 states have internal predecessors, (151), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Second operand 130 states. [2022-02-20 23:50:14,159 INFO L87 Difference]: Start difference. First operand has 124 states, 80 states have (on average 1.8875) internal successors, (151), 115 states have internal predecessors, (151), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Second operand 130 states. [2022-02-20 23:50:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:14,161 INFO L93 Difference]: Finished difference Result 130 states and 175 transitions. [2022-02-20 23:50:14,161 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 175 transitions. [2022-02-20 23:50:14,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:14,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:14,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:14,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:14,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 80 states have (on average 1.8875) internal successors, (151), 115 states have internal predecessors, (151), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-02-20 23:50:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 165 transitions. [2022-02-20 23:50:14,166 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 165 transitions. Word has length 20 [2022-02-20 23:50:14,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:14,167 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 165 transitions. [2022-02-20 23:50:14,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 23:50:14,167 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 165 transitions. [2022-02-20 23:50:14,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:50:14,167 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:14,167 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:14,176 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:50:14,374 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:50:14,374 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2022-02-20 23:50:14,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:14,375 INFO L85 PathProgramCache]: Analyzing trace with hash -1122879988, now seen corresponding path program 1 times [2022-02-20 23:50:14,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:14,375 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956170617] [2022-02-20 23:50:14,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:14,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:14,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:14,376 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:50:14,378 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:50:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:14,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:50:14,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:14,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:14,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {3858#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); {3863#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:14,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {3863#(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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {3863#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:14,770 INFO L272 TraceCheckUtils]: 2: Hoare triple {3863#(bvult (_ bv0 32) |#StackHeapBarrier|)} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {3863#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:14,771 INFO L290 TraceCheckUtils]: 3: Hoare triple {3863#(bvult (_ bv0 32) |#StackHeapBarrier|)} ~size := #in~size; {3863#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:14,771 INFO L290 TraceCheckUtils]: 4: Hoare triple {3863#(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; {3876#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:14,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {3876#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} assume true; {3876#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:14,772 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3876#(and (bvult |ldv_malloc_#res.base| |#StackHeapBarrier|) (not (= |ldv_malloc_#res.base| (_ bv0 32))))} {3863#(bvult (_ bv0 32) |#StackHeapBarrier|)} #114#return; {3883#(and (not (= |ULTIMATE.start_entry_point_#t~ret44#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_entry_point_#t~ret44#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:50:14,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {3883#(and (not (= |ULTIMATE.start_entry_point_#t~ret44#1.base| (_ bv0 32))) (bvult |ULTIMATE.start_entry_point_#t~ret44#1.base| |#StackHeapBarrier|))} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {3887#(and (bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:14,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {3887#(and (bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32))))} assume !(entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32); {3887#(and (bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:14,776 INFO L272 TraceCheckUtils]: 9: Hoare triple {3887#(and (bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32))))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {3894#(exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} is VALID [2022-02-20 23:50:14,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {3894#(exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} ~size := #in~size; {3894#(exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} is VALID [2022-02-20 23:50:14,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {3894#(exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {3894#(exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} is VALID [2022-02-20 23:50:14,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {3894#(exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} assume true; {3894#(exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} is VALID [2022-02-20 23:50:14,781 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3894#(exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| (_ BitVec 32))) (and (bvult |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_5| (_ bv0 32)))))} {3887#(and (bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32))))} #116#return; {3887#(and (bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:14,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {3887#(and (bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32))))} SUMMARY for call write~$Pointer$(entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L775-1 {3887#(and (bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:14,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {3887#(and (bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32))))} havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {3887#(and (bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:14,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {3887#(and (bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32))))} SUMMARY for call entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L776 {3887#(and (bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:14,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {3887#(and (bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32))))} assume entry_point_#t~mem46#1.base == 0bv32 && entry_point_#t~mem46#1.offset == 0bv32;havoc entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset; {3887#(and (bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:14,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {3887#(and (bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32))))} assume 0bv32 == entry_point_~a10~0#1.offset; {3887#(and (bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:50:14,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {3887#(and (bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 32))))} assume !~bvult32(entry_point_~a10~0#1.base, #StackHeapBarrier); {3859#false} is VALID [2022-02-20 23:50:14,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:50:14,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:14,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {3925#(bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|)} assume !~bvult32(entry_point_~a10~0#1.base, #StackHeapBarrier); {3859#false} is VALID [2022-02-20 23:50:14,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {3925#(bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|)} assume 0bv32 == entry_point_~a10~0#1.offset; {3925#(bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:14,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {3925#(bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|)} assume entry_point_#t~mem46#1.base == 0bv32 && entry_point_#t~mem46#1.offset == 0bv32;havoc entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset; {3925#(bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:14,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {3925#(bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|)} SUMMARY for call entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L776 {3925#(bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:14,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {3925#(bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|)} havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {3925#(bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:14,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {3925#(bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L775-1 {3925#(bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:14,908 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {3858#true} {3925#(bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|)} #116#return; {3925#(bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:14,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {3858#true} assume true; {3858#true} is VALID [2022-02-20 23:50:14,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {3858#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {3858#true} is VALID [2022-02-20 23:50:14,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {3858#true} ~size := #in~size; {3858#true} is VALID [2022-02-20 23:50:14,909 INFO L272 TraceCheckUtils]: 9: Hoare triple {3925#(bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|)} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {3858#true} is VALID [2022-02-20 23:50:14,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {3925#(bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|)} assume !(entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32); {3925#(bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:14,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {3962#(bvult |ULTIMATE.start_entry_point_#t~ret44#1.base| |#StackHeapBarrier|)} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {3925#(bvult |ULTIMATE.start_entry_point_~a10~0#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:14,910 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {3969#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} {3858#true} #114#return; {3962#(bvult |ULTIMATE.start_entry_point_#t~ret44#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:14,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {3969#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} assume true; {3969#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:14,911 INFO L290 TraceCheckUtils]: 4: Hoare triple {3858#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; {3969#(bvult |ldv_malloc_#res.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:50:14,911 INFO L290 TraceCheckUtils]: 3: Hoare triple {3858#true} ~size := #in~size; {3858#true} is VALID [2022-02-20 23:50:14,911 INFO L272 TraceCheckUtils]: 2: Hoare triple {3858#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {3858#true} is VALID [2022-02-20 23:50:14,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {3858#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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {3858#true} is VALID [2022-02-20 23:50:14,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {3858#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); {3858#true} is VALID [2022-02-20 23:50:14,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:14,911 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:14,911 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956170617] [2022-02-20 23:50:14,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956170617] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:50:14,911 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:14,911 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2022-02-20 23:50:14,911 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568870068] [2022-02-20 23:50:14,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:14,912 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 20 [2022-02-20 23:50:14,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:14,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:14,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:14,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:50:14,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:14,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:50:14,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:50:14,953 INFO L87 Difference]: Start difference. First operand 124 states and 165 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:15,959 INFO L93 Difference]: Finished difference Result 127 states and 167 transitions. [2022-02-20 23:50:15,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:50:15,959 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 20 [2022-02-20 23:50:15,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:15,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-02-20 23:50:15,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:15,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-02-20 23:50:15,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 98 transitions. [2022-02-20 23:50:16,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:16,068 INFO L225 Difference]: With dead ends: 127 [2022-02-20 23:50:16,068 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 23:50:16,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:50:16,069 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 78 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:16,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 291 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 14 Unchecked, 0.3s Time] [2022-02-20 23:50:16,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 23:50:16,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-02-20 23:50:16,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:16,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 127 states, 83 states have (on average 1.8433734939759037) internal successors, (153), 117 states have internal predecessors, (153), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-02-20 23:50:16,072 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 127 states, 83 states have (on average 1.8433734939759037) internal successors, (153), 117 states have internal predecessors, (153), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-02-20 23:50:16,072 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 127 states, 83 states have (on average 1.8433734939759037) internal successors, (153), 117 states have internal predecessors, (153), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-02-20 23:50:16,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:16,075 INFO L93 Difference]: Finished difference Result 127 states and 167 transitions. [2022-02-20 23:50:16,075 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 167 transitions. [2022-02-20 23:50:16,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:16,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:16,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 83 states have (on average 1.8433734939759037) internal successors, (153), 117 states have internal predecessors, (153), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Second operand 127 states. [2022-02-20 23:50:16,076 INFO L87 Difference]: Start difference. First operand has 127 states, 83 states have (on average 1.8433734939759037) internal successors, (153), 117 states have internal predecessors, (153), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) Second operand 127 states. [2022-02-20 23:50:16,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:16,078 INFO L93 Difference]: Finished difference Result 127 states and 167 transitions. [2022-02-20 23:50:16,078 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 167 transitions. [2022-02-20 23:50:16,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:16,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:16,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:16,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:16,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 83 states have (on average 1.8433734939759037) internal successors, (153), 117 states have internal predecessors, (153), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-02-20 23:50:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 167 transitions. [2022-02-20 23:50:16,081 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 167 transitions. Word has length 20 [2022-02-20 23:50:16,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:16,081 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 167 transitions. [2022-02-20 23:50:16,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:16,082 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 167 transitions. [2022-02-20 23:50:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:50:16,082 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:16,082 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:16,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-02-20 23:50:16,288 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:50:16,289 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2022-02-20 23:50:16,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:16,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1782681151, now seen corresponding path program 1 times [2022-02-20 23:50:16,289 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:16,289 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [255900285] [2022-02-20 23:50:16,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:16,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:16,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:16,291 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:16,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:50:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:16,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:50:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:16,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:16,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {4494#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); {4494#true} is VALID [2022-02-20 23:50:16,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {4494#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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {4502#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:50:16,586 INFO L272 TraceCheckUtils]: 2: Hoare triple {4502#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {4506#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:16,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {4506#(= |old(#valid)| |#valid|)} ~size := #in~size; {4506#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:16,587 INFO L290 TraceCheckUtils]: 4: Hoare triple {4506#(= |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; {4513#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_59) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} is VALID [2022-02-20 23:50:16,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {4513#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_59) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} assume true; {4513#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_59) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} is VALID [2022-02-20 23:50:16,588 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4513#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_59) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} {4502#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} #114#return; {4520#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret44#1.base|))) (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret44#1.base| v_ArrVal_59) |#valid|)))} is VALID [2022-02-20 23:50:16,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {4520#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret44#1.base|))) (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret44#1.base| v_ArrVal_59) |#valid|)))} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {4524#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))))} is VALID [2022-02-20 23:50:16,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {4524#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))))} assume !(entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32); {4524#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))))} is VALID [2022-02-20 23:50:16,590 INFO L272 TraceCheckUtils]: 9: Hoare triple {4524#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {4506#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:16,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {4506#(= |old(#valid)| |#valid|)} ~size := #in~size; {4506#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:16,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {4506#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {4506#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:16,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {4506#(= |old(#valid)| |#valid|)} assume true; {4506#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:16,592 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4506#(= |old(#valid)| |#valid|)} {4524#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))))} #116#return; {4524#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))))} is VALID [2022-02-20 23:50:16,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {4524#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))))} SUMMARY for call write~$Pointer$(entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L775-1 {4524#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))))} is VALID [2022-02-20 23:50:16,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {4524#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))))} havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {4524#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))))} is VALID [2022-02-20 23:50:16,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {4524#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))))} SUMMARY for call entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L776 {4524#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))))} is VALID [2022-02-20 23:50:16,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {4524#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))))} assume entry_point_#t~mem46#1.base == 0bv32 && entry_point_#t~mem46#1.offset == 0bv32;havoc entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset; {4524#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))))} is VALID [2022-02-20 23:50:16,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {4524#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))))} assume 0bv32 == entry_point_~a10~0#1.offset; {4524#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))))} is VALID [2022-02-20 23:50:16,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {4524#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))))} assume ~bvult32(entry_point_~a10~0#1.base, #StackHeapBarrier); {4524#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))))} is VALID [2022-02-20 23:50:16,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {4524#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))))} assume 0bv32 == entry_point_~a10~0#1.base || 1bv1 == #valid[entry_point_~a10~0#1.base];call ULTIMATE.dealloc(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset); {4564#(exists ((|ULTIMATE.start_entry_point_~a10~0#1.base| (_ BitVec 32))) (and (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 1)) |#valid|) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|)))))} is VALID [2022-02-20 23:50:16,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {4564#(exists ((|ULTIMATE.start_entry_point_~a10~0#1.base| (_ BitVec 32))) (and (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 1)) |#valid|) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|)))))} assume { :end_inline_entry_point } true; {4564#(exists ((|ULTIMATE.start_entry_point_~a10~0#1.base| (_ BitVec 32))) (and (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 1)) |#valid|) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|)))))} is VALID [2022-02-20 23:50:16,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {4564#(exists ((|ULTIMATE.start_entry_point_~a10~0#1.base| (_ BitVec 32))) (and (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 1)) |#valid|) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|)))))} assume !(#valid == main_old_#valid#1); {4495#false} is VALID [2022-02-20 23:50:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:16,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:20,782 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:20,783 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [255900285] [2022-02-20 23:50:20,783 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [255900285] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:20,783 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [19817944] [2022-02-20 23:50:20,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:20,783 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:20,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:50:20,784 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:50:20,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-02-20 23:50:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:20,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:50:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:20,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:21,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {4494#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); {4625#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} is VALID [2022-02-20 23:50:21,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {4625#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} 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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {4629#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} is VALID [2022-02-20 23:50:21,182 INFO L272 TraceCheckUtils]: 2: Hoare triple {4629#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {4506#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:21,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {4506#(= |old(#valid)| |#valid|)} ~size := #in~size; {4506#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:21,183 INFO L290 TraceCheckUtils]: 4: Hoare triple {4506#(= |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; {4513#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_59) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} is VALID [2022-02-20 23:50:21,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {4513#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_59) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} assume true; {4513#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_59) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} is VALID [2022-02-20 23:50:21,184 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {4513#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |old(#valid)| |ldv_malloc_#res.base| v_ArrVal_59) |#valid|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} {4629#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} #114#return; {4645#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret44#1.base|))) (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret44#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:21,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {4645#(and (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret44#1.base|))) (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_#t~ret44#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {4649#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:21,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {4649#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} assume !(entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32); {4649#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:21,186 INFO L272 TraceCheckUtils]: 9: Hoare triple {4649#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {4506#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:21,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {4506#(= |old(#valid)| |#valid|)} ~size := #in~size; {4506#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:21,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {4506#(= |old(#valid)| |#valid|)} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {4506#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:21,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {4506#(= |old(#valid)| |#valid|)} assume true; {4506#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:21,196 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {4506#(= |old(#valid)| |#valid|)} {4649#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} #116#return; {4649#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:21,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {4649#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} SUMMARY for call write~$Pointer$(entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L775-1 {4649#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:21,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {4649#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {4649#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:21,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {4649#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} SUMMARY for call entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L776 {4649#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:21,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {4649#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} assume entry_point_#t~mem46#1.base == 0bv32 && entry_point_#t~mem46#1.offset == 0bv32;havoc entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset; {4649#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:21,198 INFO L290 TraceCheckUtils]: 18: Hoare triple {4649#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} assume 0bv32 == entry_point_~a10~0#1.offset; {4649#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:21,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {4649#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} assume ~bvult32(entry_point_~a10~0#1.base, #StackHeapBarrier); {4649#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} is VALID [2022-02-20 23:50:21,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {4649#(and (exists ((v_ArrVal_59 (_ BitVec 1))) (= (store |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base| v_ArrVal_59) |#valid|)) (= (_ bv0 1) (bvneg (select |ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_entry_point_~a10~0#1.base|))) (= (_ bv0 1) (select |ULTIMATE.start_main_old_#valid#1| (_ bv0 32))))} assume 0bv32 == entry_point_~a10~0#1.base || 1bv1 == #valid[entry_point_~a10~0#1.base];call ULTIMATE.dealloc(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset); {4629#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} is VALID [2022-02-20 23:50:21,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {4629#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} assume { :end_inline_entry_point } true; {4629#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} is VALID [2022-02-20 23:50:21,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {4629#(and (= |#valid| |ULTIMATE.start_main_old_#valid#1|) (= (_ bv0 1) (select |#valid| (_ bv0 32))))} assume !(#valid == main_old_#valid#1); {4495#false} is VALID [2022-02-20 23:50:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:21,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:25,365 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [19817944] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:25,365 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:25,365 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2022-02-20 23:50:25,365 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663554363] [2022-02-20 23:50:25,365 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:25,365 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2022-02-20 23:50:25,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:25,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:25,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:25,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:50:25,399 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:25,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:50:25,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=166, Unknown=2, NotChecked=0, Total=210 [2022-02-20 23:50:25,400 INFO L87 Difference]: Start difference. First operand 127 states and 167 transitions. Second operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:26,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:26,093 INFO L93 Difference]: Finished difference Result 137 states and 177 transitions. [2022-02-20 23:50:26,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:50:26,093 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2022-02-20 23:50:26,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:26,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2022-02-20 23:50:26,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2022-02-20 23:50:26,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 111 transitions. [2022-02-20 23:50:26,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:26,194 INFO L225 Difference]: With dead ends: 137 [2022-02-20 23:50:26,194 INFO L226 Difference]: Without dead ends: 130 [2022-02-20 23:50:26,194 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=50, Invalid=220, Unknown=2, NotChecked=0, Total=272 [2022-02-20 23:50:26,195 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 9 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 234 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:26,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 370 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 120 Invalid, 0 Unknown, 234 Unchecked, 0.1s Time] [2022-02-20 23:50:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-02-20 23:50:26,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2022-02-20 23:50:26,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:26,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 124 states, 79 states have (on average 1.8734177215189873) internal successors, (148), 114 states have internal predecessors, (148), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-02-20 23:50:26,199 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 124 states, 79 states have (on average 1.8734177215189873) internal successors, (148), 114 states have internal predecessors, (148), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-02-20 23:50:26,200 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 124 states, 79 states have (on average 1.8734177215189873) internal successors, (148), 114 states have internal predecessors, (148), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-02-20 23:50:26,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:26,203 INFO L93 Difference]: Finished difference Result 130 states and 170 transitions. [2022-02-20 23:50:26,203 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 170 transitions. [2022-02-20 23:50:26,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:26,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:26,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 79 states have (on average 1.8734177215189873) internal successors, (148), 114 states have internal predecessors, (148), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Second operand 130 states. [2022-02-20 23:50:26,211 INFO L87 Difference]: Start difference. First operand has 124 states, 79 states have (on average 1.8734177215189873) internal successors, (148), 114 states have internal predecessors, (148), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Second operand 130 states. [2022-02-20 23:50:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:26,213 INFO L93 Difference]: Finished difference Result 130 states and 170 transitions. [2022-02-20 23:50:26,213 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 170 transitions. [2022-02-20 23:50:26,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:26,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:26,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:26,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:26,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 79 states have (on average 1.8734177215189873) internal successors, (148), 114 states have internal predecessors, (148), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-02-20 23:50:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 162 transitions. [2022-02-20 23:50:26,216 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 162 transitions. Word has length 23 [2022-02-20 23:50:26,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:26,216 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 162 transitions. [2022-02-20 23:50:26,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:50:26,216 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 162 transitions. [2022-02-20 23:50:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:50:26,217 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:26,217 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:26,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:26,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:26,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:26,625 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2022-02-20 23:50:26,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:26,626 INFO L85 PathProgramCache]: Analyzing trace with hash -931351798, now seen corresponding path program 1 times [2022-02-20 23:50:26,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:26,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634422269] [2022-02-20 23:50:26,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:26,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:26,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:26,628 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:26,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 23:50:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:26,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:50:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:26,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:26,723 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:50:26,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:50:26,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-20 23:50:26,836 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:50:26,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-02-20 23:50:26,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {5270#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); {5270#true} is VALID [2022-02-20 23:50:26,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {5270#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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {5270#true} is VALID [2022-02-20 23:50:26,847 INFO L272 TraceCheckUtils]: 2: Hoare triple {5270#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {5270#true} is VALID [2022-02-20 23:50:26,847 INFO L290 TraceCheckUtils]: 3: Hoare triple {5270#true} ~size := #in~size; {5270#true} is VALID [2022-02-20 23:50:26,847 INFO L290 TraceCheckUtils]: 4: Hoare triple {5270#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; {5270#true} is VALID [2022-02-20 23:50:26,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-02-20 23:50:26,847 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5270#true} {5270#true} #114#return; {5270#true} is VALID [2022-02-20 23:50:26,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {5270#true} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {5270#true} is VALID [2022-02-20 23:50:26,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {5270#true} assume !(entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32); {5270#true} is VALID [2022-02-20 23:50:26,847 INFO L272 TraceCheckUtils]: 9: Hoare triple {5270#true} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {5270#true} is VALID [2022-02-20 23:50:26,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {5270#true} ~size := #in~size; {5270#true} is VALID [2022-02-20 23:50:26,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {5270#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; {5308#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:26,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {5308#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {5308#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:26,850 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5308#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {5270#true} #116#return; {5315#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret45#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:26,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {5315#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret45#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L775-1 {5319#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} is VALID [2022-02-20 23:50:26,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {5319#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {5319#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} is VALID [2022-02-20 23:50:26,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {5319#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} SUMMARY for call entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L776 {5319#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} is VALID [2022-02-20 23:50:26,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {5319#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} assume !(entry_point_#t~mem46#1.base == 0bv32 && entry_point_#t~mem46#1.offset == 0bv32);havoc entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset; {5319#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} is VALID [2022-02-20 23:50:26,853 INFO L290 TraceCheckUtils]: 18: Hoare triple {5319#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} SUMMARY for call entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L777 {5332#(= (select |#valid| |ULTIMATE.start_entry_point_#t~mem47#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:26,853 INFO L272 TraceCheckUtils]: 19: Hoare triple {5332#(= (select |#valid| |ULTIMATE.start_entry_point_#t~mem47#1.base|) (_ bv1 1))} call entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc(4bv32); {5336#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:26,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {5336#(= |old(#valid)| |#valid|)} ~size := #in~size; {5336#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:26,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {5336#(= |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; {5343#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:50:26,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {5343#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} assume true; {5343#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:50:26,856 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5343#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} {5332#(= (select |#valid| |ULTIMATE.start_entry_point_#t~mem47#1.base|) (_ bv1 1))} #118#return; {5332#(= (select |#valid| |ULTIMATE.start_entry_point_#t~mem47#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:26,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {5332#(= (select |#valid| |ULTIMATE.start_entry_point_#t~mem47#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[entry_point_#t~mem47#1.base]); {5271#false} is VALID [2022-02-20 23:50:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:26,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:27,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {5332#(= (select |#valid| |ULTIMATE.start_entry_point_#t~mem47#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[entry_point_#t~mem47#1.base]); {5271#false} is VALID [2022-02-20 23:50:27,046 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5359#(forall ((|v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2|) (_ bv1 1))))} {5332#(= (select |#valid| |ULTIMATE.start_entry_point_#t~mem47#1.base|) (_ bv1 1))} #118#return; {5332#(= (select |#valid| |ULTIMATE.start_entry_point_#t~mem47#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:27,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {5359#(forall ((|v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2|) (_ bv1 1))))} assume true; {5359#(forall ((|v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2|) (_ bv1 1))))} is VALID [2022-02-20 23:50:27,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {5359#(forall ((|v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2|) (_ bv1 1))))} assume 0bv32 != #t~nondet11;havoc #t~nondet11;call #t~malloc12.base, #t~malloc12.offset := #Ultimate.allocOnHeap(~size);#res.base, #res.offset := #t~malloc12.base, #t~malloc12.offset;havoc #t~malloc12.base, #t~malloc12.offset; {5359#(forall ((|v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2|) (_ bv1 1))))} is VALID [2022-02-20 23:50:27,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {5359#(forall ((|v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2|) (_ bv1 1))))} ~size := #in~size; {5359#(forall ((|v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2|) (_ bv1 1))))} is VALID [2022-02-20 23:50:27,048 INFO L272 TraceCheckUtils]: 19: Hoare triple {5332#(= (select |#valid| |ULTIMATE.start_entry_point_#t~mem47#1.base|) (_ bv1 1))} call entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc(4bv32); {5359#(forall ((|v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2| (_ BitVec 32))) (or (not (= (_ bv1 1) (select |old(#valid)| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2|))) (= (select |#valid| |v_ULTIMATE.start_entry_point_#t~mem47#1.base_BEFORE_CALL_2|) (_ bv1 1))))} is VALID [2022-02-20 23:50:27,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {5319#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} SUMMARY for call entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L777 {5332#(= (select |#valid| |ULTIMATE.start_entry_point_#t~mem47#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:27,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {5319#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} assume !(entry_point_#t~mem46#1.base == 0bv32 && entry_point_#t~mem46#1.offset == 0bv32);havoc entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset; {5319#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} is VALID [2022-02-20 23:50:27,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {5319#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} SUMMARY for call entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L776 {5319#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} is VALID [2022-02-20 23:50:27,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {5319#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {5319#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} is VALID [2022-02-20 23:50:27,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {5315#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret45#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L775-1 {5319#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} is VALID [2022-02-20 23:50:27,052 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {5308#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {5270#true} #116#return; {5315#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret45#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:27,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {5308#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {5308#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:27,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {5270#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; {5308#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:27,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {5270#true} ~size := #in~size; {5270#true} is VALID [2022-02-20 23:50:27,053 INFO L272 TraceCheckUtils]: 9: Hoare triple {5270#true} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {5270#true} is VALID [2022-02-20 23:50:27,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {5270#true} assume !(entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32); {5270#true} is VALID [2022-02-20 23:50:27,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {5270#true} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {5270#true} is VALID [2022-02-20 23:50:27,053 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5270#true} {5270#true} #114#return; {5270#true} is VALID [2022-02-20 23:50:27,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-02-20 23:50:27,054 INFO L290 TraceCheckUtils]: 4: Hoare triple {5270#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; {5270#true} is VALID [2022-02-20 23:50:27,054 INFO L290 TraceCheckUtils]: 3: Hoare triple {5270#true} ~size := #in~size; {5270#true} is VALID [2022-02-20 23:50:27,054 INFO L272 TraceCheckUtils]: 2: Hoare triple {5270#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {5270#true} is VALID [2022-02-20 23:50:27,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {5270#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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {5270#true} is VALID [2022-02-20 23:50:27,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {5270#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); {5270#true} is VALID [2022-02-20 23:50:27,054 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:27,054 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:27,054 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634422269] [2022-02-20 23:50:27,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634422269] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:50:27,055 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:27,055 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2022-02-20 23:50:27,055 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231461242] [2022-02-20 23:50:27,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:27,055 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-02-20 23:50:27,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:27,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:27,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:27,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:50:27,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:27,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:50:27,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:50:27,081 INFO L87 Difference]: Start difference. First operand 124 states and 162 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:27,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:27,923 INFO L93 Difference]: Finished difference Result 140 states and 179 transitions. [2022-02-20 23:50:27,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:50:27,923 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-02-20 23:50:27,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:27,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2022-02-20 23:50:27,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:27,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2022-02-20 23:50:27,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 111 transitions. [2022-02-20 23:50:28,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:28,022 INFO L225 Difference]: With dead ends: 140 [2022-02-20 23:50:28,022 INFO L226 Difference]: Without dead ends: 140 [2022-02-20 23:50:28,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:50:28,022 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 8 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:28,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 312 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 54 Unchecked, 0.3s Time] [2022-02-20 23:50:28,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-02-20 23:50:28,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2022-02-20 23:50:28,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:28,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 138 states, 90 states have (on average 1.8) internal successors, (162), 124 states have internal predecessors, (162), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-20 23:50:28,025 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 138 states, 90 states have (on average 1.8) internal successors, (162), 124 states have internal predecessors, (162), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-20 23:50:28,026 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 138 states, 90 states have (on average 1.8) internal successors, (162), 124 states have internal predecessors, (162), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-20 23:50:28,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:28,030 INFO L93 Difference]: Finished difference Result 140 states and 179 transitions. [2022-02-20 23:50:28,030 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 179 transitions. [2022-02-20 23:50:28,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:28,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:28,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 90 states have (on average 1.8) internal successors, (162), 124 states have internal predecessors, (162), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) Second operand 140 states. [2022-02-20 23:50:28,031 INFO L87 Difference]: Start difference. First operand has 138 states, 90 states have (on average 1.8) internal successors, (162), 124 states have internal predecessors, (162), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) Second operand 140 states. [2022-02-20 23:50:28,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:28,033 INFO L93 Difference]: Finished difference Result 140 states and 179 transitions. [2022-02-20 23:50:28,033 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 179 transitions. [2022-02-20 23:50:28,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:28,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:28,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:28,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 90 states have (on average 1.8) internal successors, (162), 124 states have internal predecessors, (162), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-20 23:50:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 179 transitions. [2022-02-20 23:50:28,037 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 179 transitions. Word has length 25 [2022-02-20 23:50:28,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:28,037 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 179 transitions. [2022-02-20 23:50:28,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:28,038 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 179 transitions. [2022-02-20 23:50:28,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:50:28,038 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:28,038 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:28,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:28,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:28,246 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2022-02-20 23:50:28,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:28,247 INFO L85 PathProgramCache]: Analyzing trace with hash -931351797, now seen corresponding path program 1 times [2022-02-20 23:50:28,247 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:28,247 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1370904666] [2022-02-20 23:50:28,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:28,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:28,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:28,248 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:28,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 23:50:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:28,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 23:50:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:28,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:28,357 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:50:28,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:50:28,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:50:28,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-20 23:50:28,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:50:32,592 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:50:32,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:32,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {5989#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); {5989#true} is VALID [2022-02-20 23:50:32,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {5989#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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {5989#true} is VALID [2022-02-20 23:50:32,607 INFO L272 TraceCheckUtils]: 2: Hoare triple {5989#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {5989#true} is VALID [2022-02-20 23:50:32,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {5989#true} ~size := #in~size; {5989#true} is VALID [2022-02-20 23:50:32,607 INFO L290 TraceCheckUtils]: 4: Hoare triple {5989#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; {5989#true} is VALID [2022-02-20 23:50:32,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {5989#true} assume true; {5989#true} is VALID [2022-02-20 23:50:32,607 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5989#true} {5989#true} #114#return; {5989#true} is VALID [2022-02-20 23:50:32,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {5989#true} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {5989#true} is VALID [2022-02-20 23:50:32,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {5989#true} assume !(entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32); {5989#true} is VALID [2022-02-20 23:50:32,607 INFO L272 TraceCheckUtils]: 9: Hoare triple {5989#true} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {5989#true} is VALID [2022-02-20 23:50:32,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {5989#true} ~size := #in~size; {6024#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:32,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {6024#(= ldv_malloc_~size |ldv_malloc_#in~size|)} 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; {6028#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:32,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {6028#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {6028#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:32,610 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6028#(and (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {5989#true} #116#return; {6035#(and (= (select |#length| |ULTIMATE.start_entry_point_#t~ret45#1.base|) (_ bv4 32)) (= |ULTIMATE.start_entry_point_#t~ret45#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:32,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {6035#(and (= (select |#length| |ULTIMATE.start_entry_point_#t~ret45#1.base|) (_ bv4 32)) (= |ULTIMATE.start_entry_point_#t~ret45#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L775-1 {6039#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} is VALID [2022-02-20 23:50:32,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {6039#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {6039#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} is VALID [2022-02-20 23:50:32,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {6039#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} SUMMARY for call entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L776 {6039#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} is VALID [2022-02-20 23:50:32,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {6039#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} assume !(entry_point_#t~mem46#1.base == 0bv32 && entry_point_#t~mem46#1.offset == 0bv32);havoc entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset; {6039#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} is VALID [2022-02-20 23:50:32,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {6039#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} SUMMARY for call entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L777 {6052#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~mem47#1.base|)) (= |ULTIMATE.start_entry_point_#t~mem47#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:32,614 INFO L272 TraceCheckUtils]: 19: Hoare triple {6052#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~mem47#1.base|)) (= |ULTIMATE.start_entry_point_#t~mem47#1.offset| (_ bv0 32)))} call entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc(4bv32); {6056#(= |#length| |old(#length)|)} is VALID [2022-02-20 23:50:32,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {6056#(= |#length| |old(#length)|)} ~size := #in~size; {6060#(and (= ldv_malloc_~size |ldv_malloc_#in~size|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:32,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {6060#(and (= ldv_malloc_~size |ldv_malloc_#in~size|) (= |#length| |old(#length)|))} 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; {6064#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| |ldv_malloc_#in~size|) |#length|))} is VALID [2022-02-20 23:50:32,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {6064#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| |ldv_malloc_#in~size|) |#length|))} assume true; {6064#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| |ldv_malloc_#in~size|) |#length|))} is VALID [2022-02-20 23:50:32,617 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6064#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| |ldv_malloc_#in~size|) |#length|))} {6052#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~mem47#1.base|)) (= |ULTIMATE.start_entry_point_#t~mem47#1.offset| (_ bv0 32)))} #118#return; {6052#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~mem47#1.base|)) (= |ULTIMATE.start_entry_point_#t~mem47#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:32,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {6052#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~mem47#1.base|)) (= |ULTIMATE.start_entry_point_#t~mem47#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, entry_point_#t~mem47#1.offset), #length[entry_point_#t~mem47#1.base]) && ~bvule32(entry_point_#t~mem47#1.offset, ~bvadd32(4bv32, entry_point_#t~mem47#1.offset))) && ~bvule32(0bv32, entry_point_#t~mem47#1.offset)); {5990#false} is VALID [2022-02-20 23:50:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:50:32,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:32,823 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:32,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1370904666] [2022-02-20 23:50:32,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1370904666] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:32,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1125419092] [2022-02-20 23:50:32,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:32,824 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:32,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:50:32,826 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:50:32,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-02-20 23:50:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:32,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 23:50:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:32,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:32,960 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:50:32,966 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:50:33,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:50:33,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:50:33,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-02-20 23:50:33,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:50:37,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:37,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:37,323 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:37,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-02-20 23:50:37,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {5989#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); {5989#true} is VALID [2022-02-20 23:50:37,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {5989#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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {5989#true} is VALID [2022-02-20 23:50:37,346 INFO L272 TraceCheckUtils]: 2: Hoare triple {5989#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {5989#true} is VALID [2022-02-20 23:50:37,346 INFO L290 TraceCheckUtils]: 3: Hoare triple {5989#true} ~size := #in~size; {5989#true} is VALID [2022-02-20 23:50:37,346 INFO L290 TraceCheckUtils]: 4: Hoare triple {5989#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; {5989#true} is VALID [2022-02-20 23:50:37,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {5989#true} assume true; {5989#true} is VALID [2022-02-20 23:50:37,346 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {5989#true} {5989#true} #114#return; {5989#true} is VALID [2022-02-20 23:50:37,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {5989#true} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {5989#true} is VALID [2022-02-20 23:50:37,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {5989#true} assume !(entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32); {5989#true} is VALID [2022-02-20 23:50:37,347 INFO L272 TraceCheckUtils]: 9: Hoare triple {5989#true} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {5989#true} is VALID [2022-02-20 23:50:37,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {5989#true} ~size := #in~size; {6024#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:37,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {6024#(= ldv_malloc_~size |ldv_malloc_#in~size|)} 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; {6115#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:37,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {6115#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {6115#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:37,349 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6115#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {5989#true} #116#return; {6122#(and (= (select |#length| |ULTIMATE.start_entry_point_#t~ret45#1.base|) (_ bv4 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret45#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_#t~ret45#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:37,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {6122#(and (= (select |#length| |ULTIMATE.start_entry_point_#t~ret45#1.base|) (_ bv4 32)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret45#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_#t~ret45#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L775-1 {6126#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} is VALID [2022-02-20 23:50:37,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {6126#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {6126#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} is VALID [2022-02-20 23:50:37,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {6126#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} SUMMARY for call entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L776 {6126#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} is VALID [2022-02-20 23:50:37,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {6126#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} assume !(entry_point_#t~mem46#1.base == 0bv32 && entry_point_#t~mem46#1.offset == 0bv32);havoc entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset; {6126#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} is VALID [2022-02-20 23:50:37,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {6126#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))) (= (_ bv4 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} SUMMARY for call entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L777 {6139#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~mem47#1.base|)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~mem47#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_#t~mem47#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:37,354 INFO L272 TraceCheckUtils]: 19: Hoare triple {6139#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~mem47#1.base|)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~mem47#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_#t~mem47#1.offset| (_ bv0 32)))} call entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc(4bv32); {6143#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:37,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {6143#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {6143#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:37,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {6143#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} 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; {6150#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_133 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_133) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:37,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {6150#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_133 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_133) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {6150#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_133 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_133) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:37,357 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6150#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_133 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_133) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {6139#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~mem47#1.base|)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~mem47#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_#t~mem47#1.offset| (_ bv0 32)))} #118#return; {6052#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~mem47#1.base|)) (= |ULTIMATE.start_entry_point_#t~mem47#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:37,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {6052#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~mem47#1.base|)) (= |ULTIMATE.start_entry_point_#t~mem47#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, entry_point_#t~mem47#1.offset), #length[entry_point_#t~mem47#1.base]) && ~bvule32(entry_point_#t~mem47#1.offset, ~bvadd32(4bv32, entry_point_#t~mem47#1.offset))) && ~bvule32(0bv32, entry_point_#t~mem47#1.offset)); {5990#false} is VALID [2022-02-20 23:50:37,358 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:50:37,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:37,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1125419092] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:37,587 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:37,587 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-02-20 23:50:37,587 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442255036] [2022-02-20 23:50:37,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:37,589 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2022-02-20 23:50:37,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:37,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 23:50:37,625 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:50:37,625 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 23:50:37,625 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:37,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 23:50:37,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=290, Unknown=4, NotChecked=0, Total=342 [2022-02-20 23:50:37,626 INFO L87 Difference]: Start difference. First operand 138 states and 179 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 23:50:45,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:45,828 INFO L93 Difference]: Finished difference Result 140 states and 179 transitions. [2022-02-20 23:50:45,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:50:45,828 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2022-02-20 23:50:45,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:45,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 23:50:45,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2022-02-20 23:50:45,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 23:50:45,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 105 transitions. [2022-02-20 23:50:45,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 105 transitions. [2022-02-20 23:50:45,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:45,950 INFO L225 Difference]: With dead ends: 140 [2022-02-20 23:50:45,950 INFO L226 Difference]: Without dead ends: 140 [2022-02-20 23:50:45,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=76, Invalid=425, Unknown=5, NotChecked=0, Total=506 [2022-02-20 23:50:45,951 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 10 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:45,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 603 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 368 Invalid, 0 Unknown, 85 Unchecked, 0.6s Time] [2022-02-20 23:50:45,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-02-20 23:50:45,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2022-02-20 23:50:45,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:45,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 138 states, 90 states have (on average 1.7777777777777777) internal successors, (160), 124 states have internal predecessors, (160), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-20 23:50:45,957 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 138 states, 90 states have (on average 1.7777777777777777) internal successors, (160), 124 states have internal predecessors, (160), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-20 23:50:45,957 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 138 states, 90 states have (on average 1.7777777777777777) internal successors, (160), 124 states have internal predecessors, (160), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-20 23:50:45,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:45,960 INFO L93 Difference]: Finished difference Result 140 states and 179 transitions. [2022-02-20 23:50:45,960 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 179 transitions. [2022-02-20 23:50:45,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:45,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:45,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 90 states have (on average 1.7777777777777777) internal successors, (160), 124 states have internal predecessors, (160), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) Second operand 140 states. [2022-02-20 23:50:45,961 INFO L87 Difference]: Start difference. First operand has 138 states, 90 states have (on average 1.7777777777777777) internal successors, (160), 124 states have internal predecessors, (160), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) Second operand 140 states. [2022-02-20 23:50:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:45,963 INFO L93 Difference]: Finished difference Result 140 states and 179 transitions. [2022-02-20 23:50:45,964 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 179 transitions. [2022-02-20 23:50:45,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:45,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:45,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:45,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:45,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 90 states have (on average 1.7777777777777777) internal successors, (160), 124 states have internal predecessors, (160), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (11), 9 states have call predecessors, (11), 6 states have call successors, (11) [2022-02-20 23:50:45,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 177 transitions. [2022-02-20 23:50:45,966 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 177 transitions. Word has length 25 [2022-02-20 23:50:45,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:45,967 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 177 transitions. [2022-02-20 23:50:45,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-20 23:50:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 177 transitions. [2022-02-20 23:50:45,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:50:45,968 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:45,968 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:45,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:46,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:46,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:46,401 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2022-02-20 23:50:46,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:46,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1436910423, now seen corresponding path program 1 times [2022-02-20 23:50:46,403 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:46,403 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32654314] [2022-02-20 23:50:46,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:46,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:46,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:46,412 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:46,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-20 23:50:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:46,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:50:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:46,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:46,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:50:46,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:50:46,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:50:46,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:50:46,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {6733#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); {6733#true} is VALID [2022-02-20 23:50:46,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {6733#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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {6733#true} is VALID [2022-02-20 23:50:46,597 INFO L272 TraceCheckUtils]: 2: Hoare triple {6733#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {6733#true} is VALID [2022-02-20 23:50:46,597 INFO L290 TraceCheckUtils]: 3: Hoare triple {6733#true} ~size := #in~size; {6733#true} is VALID [2022-02-20 23:50:46,597 INFO L290 TraceCheckUtils]: 4: Hoare triple {6733#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; {6733#true} is VALID [2022-02-20 23:50:46,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {6733#true} assume true; {6733#true} is VALID [2022-02-20 23:50:46,597 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {6733#true} {6733#true} #114#return; {6733#true} is VALID [2022-02-20 23:50:46,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {6733#true} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {6733#true} is VALID [2022-02-20 23:50:46,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {6733#true} assume !(entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32); {6733#true} is VALID [2022-02-20 23:50:46,597 INFO L272 TraceCheckUtils]: 9: Hoare triple {6733#true} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {6733#true} is VALID [2022-02-20 23:50:46,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {6733#true} ~size := #in~size; {6733#true} is VALID [2022-02-20 23:50:46,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {6733#true} assume !(0bv32 != #t~nondet11);havoc #t~nondet11;#res.base, #res.offset := 0bv32, 0bv32; {6771#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:46,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {6771#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} assume true; {6771#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} is VALID [2022-02-20 23:50:46,599 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {6771#(and (= |ldv_malloc_#res.offset| (_ bv0 32)) (= |ldv_malloc_#res.base| (_ bv0 32)))} {6733#true} #116#return; {6778#(and (= |ULTIMATE.start_entry_point_#t~ret45#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~ret45#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:46,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {6778#(and (= |ULTIMATE.start_entry_point_#t~ret45#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~ret45#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L775-1 {6782#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} is VALID [2022-02-20 23:50:46,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {6782#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {6782#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} is VALID [2022-02-20 23:50:46,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {6782#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} SUMMARY for call entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L776 {6789#(and (= |ULTIMATE.start_entry_point_#t~mem46#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~mem46#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:46,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {6789#(and (= |ULTIMATE.start_entry_point_#t~mem46#1.base| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~mem46#1.offset| (_ bv0 32)))} assume !(entry_point_#t~mem46#1.base == 0bv32 && entry_point_#t~mem46#1.offset == 0bv32);havoc entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset; {6734#false} is VALID [2022-02-20 23:50:46,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {6734#false} SUMMARY for call entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L777 {6734#false} is VALID [2022-02-20 23:50:46,608 INFO L272 TraceCheckUtils]: 19: Hoare triple {6734#false} call entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc(4bv32); {6734#false} is VALID [2022-02-20 23:50:46,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {6734#false} ~size := #in~size; {6734#false} is VALID [2022-02-20 23:50:46,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {6734#false} 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; {6734#false} is VALID [2022-02-20 23:50:46,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {6734#false} assume true; {6734#false} is VALID [2022-02-20 23:50:46,608 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6734#false} {6734#false} #118#return; {6734#false} is VALID [2022-02-20 23:50:46,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {6734#false} assume !(1bv1 == #valid[entry_point_#t~mem47#1.base]); {6734#false} is VALID [2022-02-20 23:50:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:46,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:46,609 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:46,609 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32654314] [2022-02-20 23:50:46,609 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32654314] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:46,609 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:46,609 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:50:46,609 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210351395] [2022-02-20 23:50:46,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:46,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-20 23:50:46,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:46,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:46,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:46,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:50:46,630 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:46,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:50:46,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:50:46,631 INFO L87 Difference]: Start difference. First operand 138 states and 177 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:47,236 INFO L93 Difference]: Finished difference Result 132 states and 166 transitions. [2022-02-20 23:50:47,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:50:47,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-02-20 23:50:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-02-20 23:50:47,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:47,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 94 transitions. [2022-02-20 23:50:47,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 94 transitions. [2022-02-20 23:50:47,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:47,313 INFO L225 Difference]: With dead ends: 132 [2022-02-20 23:50:47,313 INFO L226 Difference]: Without dead ends: 126 [2022-02-20 23:50:47,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:50:47,314 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:47,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 406 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:50:47,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-02-20 23:50:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-02-20 23:50:47,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:47,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 126 states, 82 states have (on average 1.7926829268292683) internal successors, (147), 115 states have internal predecessors, (147), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-20 23:50:47,316 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 126 states, 82 states have (on average 1.7926829268292683) internal successors, (147), 115 states have internal predecessors, (147), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-20 23:50:47,316 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 126 states, 82 states have (on average 1.7926829268292683) internal successors, (147), 115 states have internal predecessors, (147), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-20 23:50:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:47,318 INFO L93 Difference]: Finished difference Result 126 states and 160 transitions. [2022-02-20 23:50:47,318 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 160 transitions. [2022-02-20 23:50:47,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:47,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:47,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 82 states have (on average 1.7926829268292683) internal successors, (147), 115 states have internal predecessors, (147), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Second operand 126 states. [2022-02-20 23:50:47,319 INFO L87 Difference]: Start difference. First operand has 126 states, 82 states have (on average 1.7926829268292683) internal successors, (147), 115 states have internal predecessors, (147), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Second operand 126 states. [2022-02-20 23:50:47,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:47,320 INFO L93 Difference]: Finished difference Result 126 states and 160 transitions. [2022-02-20 23:50:47,320 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 160 transitions. [2022-02-20 23:50:47,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:47,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:47,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:47,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 82 states have (on average 1.7926829268292683) internal successors, (147), 115 states have internal predecessors, (147), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-20 23:50:47,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 160 transitions. [2022-02-20 23:50:47,322 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 160 transitions. Word has length 25 [2022-02-20 23:50:47,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:47,322 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 160 transitions. [2022-02-20 23:50:47,322 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:47,322 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 160 transitions. [2022-02-20 23:50:47,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:50:47,323 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:47,323 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:47,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:47,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:47,523 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2022-02-20 23:50:47,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:47,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1675880117, now seen corresponding path program 1 times [2022-02-20 23:50:47,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:47,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247812407] [2022-02-20 23:50:47,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:47,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:47,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:47,525 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:47,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-02-20 23:50:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:47,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 23:50:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:47,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:47,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:50:47,712 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:50:47,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-02-20 23:50:47,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {7327#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); {7327#true} is VALID [2022-02-20 23:50:47,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {7327#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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {7327#true} is VALID [2022-02-20 23:50:47,725 INFO L272 TraceCheckUtils]: 2: Hoare triple {7327#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {7327#true} is VALID [2022-02-20 23:50:47,725 INFO L290 TraceCheckUtils]: 3: Hoare triple {7327#true} ~size := #in~size; {7327#true} is VALID [2022-02-20 23:50:47,725 INFO L290 TraceCheckUtils]: 4: Hoare triple {7327#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; {7327#true} is VALID [2022-02-20 23:50:47,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {7327#true} assume true; {7327#true} is VALID [2022-02-20 23:50:47,725 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7327#true} {7327#true} #114#return; {7327#true} is VALID [2022-02-20 23:50:47,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {7327#true} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {7327#true} is VALID [2022-02-20 23:50:47,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {7327#true} assume !(entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32); {7327#true} is VALID [2022-02-20 23:50:47,725 INFO L272 TraceCheckUtils]: 9: Hoare triple {7327#true} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {7327#true} is VALID [2022-02-20 23:50:47,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {7327#true} ~size := #in~size; {7327#true} is VALID [2022-02-20 23:50:47,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {7327#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; {7327#true} is VALID [2022-02-20 23:50:47,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {7327#true} assume true; {7327#true} is VALID [2022-02-20 23:50:47,725 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {7327#true} {7327#true} #116#return; {7327#true} is VALID [2022-02-20 23:50:47,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {7327#true} SUMMARY for call write~$Pointer$(entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L775-1 {7374#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:47,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {7374#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {7374#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:47,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {7374#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} SUMMARY for call entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L776 {7374#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:47,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {7374#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} assume !(entry_point_#t~mem46#1.base == 0bv32 && entry_point_#t~mem46#1.offset == 0bv32);havoc entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset; {7374#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:47,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {7374#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} SUMMARY for call entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L777 {7374#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:47,734 INFO L272 TraceCheckUtils]: 19: Hoare triple {7374#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} call entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc(4bv32); {7390#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:47,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {7390#(= |old(#valid)| |#valid|)} ~size := #in~size; {7390#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:47,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {7390#(= |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; {7397#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:50:47,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {7397#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} assume true; {7397#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} is VALID [2022-02-20 23:50:47,736 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7397#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (= (store |old(#valid)| |ldv_malloc_#res.base| (_ bv1 1)) |#valid|))} {7374#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} #118#return; {7374#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:47,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {7374#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, 4bv32); srcloc: L777-2 {7374#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:47,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {7374#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} havoc entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; {7374#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:47,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {7374#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[entry_point_~a10~0#1.base]); {7328#false} is VALID [2022-02-20 23:50:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:50:47,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:50:47,738 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:47,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247812407] [2022-02-20 23:50:47,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247812407] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:50:47,738 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:50:47,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:50:47,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647485999] [2022-02-20 23:50:47,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:50:47,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-02-20 23:50:47,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:47,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:47,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:47,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:50:47,759 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:47,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:50:47,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:50:47,760 INFO L87 Difference]: Start difference. First operand 126 states and 160 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:48,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:48,226 INFO L93 Difference]: Finished difference Result 146 states and 179 transitions. [2022-02-20 23:50:48,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:50:48,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-02-20 23:50:48,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-02-20 23:50:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:48,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-02-20 23:50:48,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 111 transitions. [2022-02-20 23:50:48,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:48,320 INFO L225 Difference]: With dead ends: 146 [2022-02-20 23:50:48,321 INFO L226 Difference]: Without dead ends: 146 [2022-02-20 23:50:48,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 1 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:50:48,321 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 49 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:48,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 141 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 105 Invalid, 0 Unknown, 54 Unchecked, 0.1s Time] [2022-02-20 23:50:48,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-02-20 23:50:48,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 125. [2022-02-20 23:50:48,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:48,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 125 states, 82 states have (on average 1.7804878048780488) internal successors, (146), 114 states have internal predecessors, (146), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-20 23:50:48,326 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 125 states, 82 states have (on average 1.7804878048780488) internal successors, (146), 114 states have internal predecessors, (146), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-20 23:50:48,326 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 125 states, 82 states have (on average 1.7804878048780488) internal successors, (146), 114 states have internal predecessors, (146), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-20 23:50:48,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:48,328 INFO L93 Difference]: Finished difference Result 146 states and 179 transitions. [2022-02-20 23:50:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2022-02-20 23:50:48,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:48,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:48,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 82 states have (on average 1.7804878048780488) internal successors, (146), 114 states have internal predecessors, (146), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Second operand 146 states. [2022-02-20 23:50:48,329 INFO L87 Difference]: Start difference. First operand has 125 states, 82 states have (on average 1.7804878048780488) internal successors, (146), 114 states have internal predecessors, (146), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Second operand 146 states. [2022-02-20 23:50:48,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:48,331 INFO L93 Difference]: Finished difference Result 146 states and 179 transitions. [2022-02-20 23:50:48,331 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 179 transitions. [2022-02-20 23:50:48,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:48,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:48,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:48,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:48,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 82 states have (on average 1.7804878048780488) internal successors, (146), 114 states have internal predecessors, (146), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2022-02-20 23:50:48,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 159 transitions. [2022-02-20 23:50:48,333 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 159 transitions. Word has length 27 [2022-02-20 23:50:48,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:48,334 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 159 transitions. [2022-02-20 23:50:48,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 23:50:48,334 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 159 transitions. [2022-02-20 23:50:48,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:50:48,334 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:48,334 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:48,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-02-20 23:50:48,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:50:48,542 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2022-02-20 23:50:48,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:48,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1675880116, now seen corresponding path program 1 times [2022-02-20 23:50:48,542 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:48,543 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1268770928] [2022-02-20 23:50:48,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:48,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:48,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:48,544 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:48,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-02-20 23:50:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:48,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-20 23:50:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:48,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:48,638 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:50:48,644 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:50:48,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:48,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:48,831 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:48,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-02-20 23:50:48,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:48,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:48,982 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:48,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-02-20 23:50:49,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {7975#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); {7975#true} is VALID [2022-02-20 23:50:49,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {7975#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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {7975#true} is VALID [2022-02-20 23:50:49,003 INFO L272 TraceCheckUtils]: 2: Hoare triple {7975#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {7975#true} is VALID [2022-02-20 23:50:49,003 INFO L290 TraceCheckUtils]: 3: Hoare triple {7975#true} ~size := #in~size; {7989#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:49,004 INFO L290 TraceCheckUtils]: 4: Hoare triple {7989#(= ldv_malloc_~size |ldv_malloc_#in~size|)} 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; {7993#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {7993#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {7993#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,005 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7993#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {7975#true} #114#return; {8000#(and (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {8000#(and (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} assume !(entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32); {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,006 INFO L272 TraceCheckUtils]: 9: Hoare triple {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {8011#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:49,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {8011#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {8011#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:49,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {8011#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} 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; {8018#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_191 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_191))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:49,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {8018#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_191 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_191))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {8018#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_191 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_191))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:49,010 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {8018#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_191 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_191))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} #116#return; {8025#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {8025#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L775-1 {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} SUMMARY for call entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L776 {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} assume !(entry_point_#t~mem46#1.base == 0bv32 && entry_point_#t~mem46#1.offset == 0bv32);havoc entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset; {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} SUMMARY for call entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L777 {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,012 INFO L272 TraceCheckUtils]: 19: Hoare triple {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} call entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc(4bv32); {8011#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:49,013 INFO L290 TraceCheckUtils]: 20: Hoare triple {8011#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {8011#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:49,014 INFO L290 TraceCheckUtils]: 21: Hoare triple {8011#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} 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; {8018#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_191 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_191))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:49,014 INFO L290 TraceCheckUtils]: 22: Hoare triple {8018#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_191 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_191))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {8018#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_191 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_191))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:49,016 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8018#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_191 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_191))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} #118#return; {8025#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {8025#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, 4bv32); srcloc: L777-2 {8025#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {8025#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} havoc entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; {8025#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,017 INFO L290 TraceCheckUtils]: 26: Hoare triple {8025#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, entry_point_~a10~0#1.offset), #length[entry_point_~a10~0#1.base]) && ~bvule32(entry_point_~a10~0#1.offset, ~bvadd32(4bv32, entry_point_~a10~0#1.offset))) && ~bvule32(0bv32, entry_point_~a10~0#1.offset)); {7976#false} is VALID [2022-02-20 23:50:49,017 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:50:49,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:49,278 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:49,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1268770928] [2022-02-20 23:50:49,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1268770928] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:49,278 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [485084996] [2022-02-20 23:50:49,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:49,278 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:49,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:50:49,280 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:50:49,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-02-20 23:50:49,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:49,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 30 conjunts are in the unsatisfiable core [2022-02-20 23:50:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:49,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:49,424 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:50:49,431 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:50:49,550 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:49,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-02-20 23:50:49,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:49,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:50:49,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-02-20 23:50:49,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:50:49,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:50:49,759 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:49,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-02-20 23:50:49,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {7975#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); {7975#true} is VALID [2022-02-20 23:50:49,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {7975#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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {7975#true} is VALID [2022-02-20 23:50:49,785 INFO L272 TraceCheckUtils]: 2: Hoare triple {7975#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {7975#true} is VALID [2022-02-20 23:50:49,785 INFO L290 TraceCheckUtils]: 3: Hoare triple {7975#true} ~size := #in~size; {7989#(= ldv_malloc_~size |ldv_malloc_#in~size|)} is VALID [2022-02-20 23:50:49,786 INFO L290 TraceCheckUtils]: 4: Hoare triple {7989#(= ldv_malloc_~size |ldv_malloc_#in~size|)} 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; {7993#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {7993#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} assume true; {7993#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,788 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {7993#(and (= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|)) (= (select |#length| |ldv_malloc_#res.base|) |ldv_malloc_#in~size|) (= |ldv_malloc_#res.offset| (_ bv0 32)))} {7975#true} #114#return; {8000#(and (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {8000#(and (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_#t~ret44#1.base|)) (= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32)))} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} assume !(entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32); {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,789 INFO L272 TraceCheckUtils]: 9: Hoare triple {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {8011#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:49,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {8011#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {8011#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:49,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {8011#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} 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; {8112#(and (exists ((v_ArrVal_216 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_216) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} is VALID [2022-02-20 23:50:49,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {8112#(and (exists ((v_ArrVal_216 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_216) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} assume true; {8112#(and (exists ((v_ArrVal_216 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_216) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} is VALID [2022-02-20 23:50:49,793 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {8112#(and (exists ((v_ArrVal_216 (_ BitVec 32))) (= (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_216) |#length|)) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1)))} {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} #116#return; {8119#(and (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| |ULTIMATE.start_entry_point_#t~ret45#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {8119#(and (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| |ULTIMATE.start_entry_point_#t~ret45#1.base|)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L775-1 {8123#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} is VALID [2022-02-20 23:50:49,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {8123#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {8123#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} is VALID [2022-02-20 23:50:49,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {8123#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} SUMMARY for call entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L776 {8123#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} is VALID [2022-02-20 23:50:49,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {8123#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} assume !(entry_point_#t~mem46#1.base == 0bv32 && entry_point_#t~mem46#1.offset == 0bv32);havoc entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset; {8123#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} is VALID [2022-02-20 23:50:49,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {8123#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} SUMMARY for call entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L777 {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,796 INFO L272 TraceCheckUtils]: 19: Hoare triple {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} call entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc(4bv32); {8011#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:49,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {8011#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} ~size := #in~size; {8011#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} is VALID [2022-02-20 23:50:49,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {8011#(and (= |old(#valid)| |#valid|) (= |#length| |old(#length)|))} 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; {8018#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_191 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_191))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:49,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {8018#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_191 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_191))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} assume true; {8018#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_191 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_191))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} is VALID [2022-02-20 23:50:49,800 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8018#(exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (exists ((v_ArrVal_191 (_ BitVec 32))) (= |#length| (store |old(#length)| |ldv_malloc_#res.base| v_ArrVal_191))) (= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))))} {8004#(and (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} #118#return; {8025#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {8025#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, 4bv32); srcloc: L777-2 {8025#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {8025#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} havoc entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; {8025#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:49,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {8025#(and (= (_ bv4 32) (select |#length| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, entry_point_~a10~0#1.offset), #length[entry_point_~a10~0#1.base]) && ~bvule32(entry_point_~a10~0#1.offset, ~bvadd32(4bv32, entry_point_~a10~0#1.offset))) && ~bvule32(0bv32, entry_point_~a10~0#1.offset)); {7976#false} is VALID [2022-02-20 23:50:49,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:50:49,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:51,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [485084996] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:51,991 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:51,991 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 11 [2022-02-20 23:50:51,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004303612] [2022-02-20 23:50:51,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:51,991 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-02-20 23:50:51,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:51,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:52,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:52,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:50:52,026 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:52,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:50:52,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:50:52,026 INFO L87 Difference]: Start difference. First operand 125 states and 159 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:55,750 INFO L93 Difference]: Finished difference Result 171 states and 203 transitions. [2022-02-20 23:50:55,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:50:55,750 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-02-20 23:50:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:50:55,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2022-02-20 23:50:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2022-02-20 23:50:55,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 142 transitions. [2022-02-20 23:50:55,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:55,880 INFO L225 Difference]: With dead ends: 171 [2022-02-20 23:50:55,886 INFO L226 Difference]: Without dead ends: 171 [2022-02-20 23:50:55,889 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:50:55,892 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 114 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:50:55,893 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 255 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 423 Invalid, 0 Unknown, 120 Unchecked, 0.7s Time] [2022-02-20 23:50:55,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-02-20 23:50:55,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 113. [2022-02-20 23:50:55,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:50:55,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 113 states, 73 states have (on average 1.7534246575342465) internal successors, (128), 103 states have internal predecessors, (128), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:50:55,896 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 113 states, 73 states have (on average 1.7534246575342465) internal successors, (128), 103 states have internal predecessors, (128), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:50:55,896 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 113 states, 73 states have (on average 1.7534246575342465) internal successors, (128), 103 states have internal predecessors, (128), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:50:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:55,898 INFO L93 Difference]: Finished difference Result 171 states and 203 transitions. [2022-02-20 23:50:55,899 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 203 transitions. [2022-02-20 23:50:55,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:55,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:55,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 73 states have (on average 1.7534246575342465) internal successors, (128), 103 states have internal predecessors, (128), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 171 states. [2022-02-20 23:50:55,900 INFO L87 Difference]: Start difference. First operand has 113 states, 73 states have (on average 1.7534246575342465) internal successors, (128), 103 states have internal predecessors, (128), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Second operand 171 states. [2022-02-20 23:50:55,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:50:55,902 INFO L93 Difference]: Finished difference Result 171 states and 203 transitions. [2022-02-20 23:50:55,902 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 203 transitions. [2022-02-20 23:50:55,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:50:55,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:50:55,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:50:55,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:50:55,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 73 states have (on average 1.7534246575342465) internal successors, (128), 103 states have internal predecessors, (128), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:50:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 137 transitions. [2022-02-20 23:50:55,905 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 137 transitions. Word has length 27 [2022-02-20 23:50:55,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:50:55,905 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 137 transitions. [2022-02-20 23:50:55,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 23:50:55,905 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2022-02-20 23:50:55,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:50:55,906 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:50:55,906 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:50:55,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:56,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2022-02-20 23:50:56,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:56,316 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 39 more)] === [2022-02-20 23:50:56,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:50:56,317 INFO L85 PathProgramCache]: Analyzing trace with hash -412676065, now seen corresponding path program 1 times [2022-02-20 23:50:56,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:50:56,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098952868] [2022-02-20 23:50:56,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:56,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:50:56,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:50:56,318 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:50:56,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-02-20 23:50:56,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:56,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 23:50:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:56,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:56,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:50:56,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:50:56,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:50:56,569 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:50:56,644 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-02-20 23:50:56,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2022-02-20 23:50:56,732 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:50:56,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2022-02-20 23:50:56,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {8805#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); {8805#true} is VALID [2022-02-20 23:50:56,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {8805#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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {8805#true} is VALID [2022-02-20 23:50:56,787 INFO L272 TraceCheckUtils]: 2: Hoare triple {8805#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {8805#true} is VALID [2022-02-20 23:50:56,788 INFO L290 TraceCheckUtils]: 3: Hoare triple {8805#true} ~size := #in~size; {8805#true} is VALID [2022-02-20 23:50:56,788 INFO L290 TraceCheckUtils]: 4: Hoare triple {8805#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; {8822#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:56,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {8822#(= |ldv_malloc_#res.offset| (_ bv0 32))} assume true; {8822#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:56,789 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8822#(= |ldv_malloc_#res.offset| (_ bv0 32))} {8805#true} #114#return; {8829#(= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:56,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {8829#(= |ULTIMATE.start_entry_point_#t~ret44#1.offset| (_ bv0 32))} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {8833#(= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:56,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {8833#(= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32))} assume !(entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32); {8833#(= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:56,790 INFO L272 TraceCheckUtils]: 9: Hoare triple {8833#(= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {8805#true} is VALID [2022-02-20 23:50:56,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {8805#true} ~size := #in~size; {8805#true} is VALID [2022-02-20 23:50:56,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {8805#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; {8822#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:56,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {8822#(= |ldv_malloc_#res.offset| (_ bv0 32))} assume true; {8822#(= |ldv_malloc_#res.offset| (_ bv0 32))} is VALID [2022-02-20 23:50:56,791 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {8822#(= |ldv_malloc_#res.offset| (_ bv0 32))} {8833#(= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32))} #116#return; {8852#(and (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~ret45#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:56,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {8852#(and (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~ret45#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L775-1 {8856#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:56,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {8856#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {8856#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:56,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {8856#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} SUMMARY for call entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L776 {8856#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:56,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {8856#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} assume !(entry_point_#t~mem46#1.base == 0bv32 && entry_point_#t~mem46#1.offset == 0bv32);havoc entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset; {8856#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:56,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {8856#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)))} SUMMARY for call entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L777 {8869#(and (= |ULTIMATE.start_entry_point_#t~mem47#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~mem47#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:56,794 INFO L272 TraceCheckUtils]: 19: Hoare triple {8869#(and (= |ULTIMATE.start_entry_point_#t~mem47#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~mem47#1.offset| (_ bv0 32)))} call entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc(4bv32); {8805#true} is VALID [2022-02-20 23:50:56,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {8805#true} ~size := #in~size; {8805#true} is VALID [2022-02-20 23:50:56,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {8805#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; {8879#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:56,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {8879#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {8879#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:56,796 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8879#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {8869#(and (= |ULTIMATE.start_entry_point_#t~mem47#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~mem47#1.offset| (_ bv0 32)))} #118#return; {8886#(and (= |ULTIMATE.start_entry_point_#t~mem47#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret48#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~mem47#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:50:56,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {8886#(and (= |ULTIMATE.start_entry_point_#t~mem47#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_entry_point_#t~ret48#1.base|) (_ bv1 1)) (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_entry_point_#t~mem47#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, 4bv32); srcloc: L777-2 {8890#(and (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)) (or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv0 32))) (_ bv1 1)) (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))) (and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)) (_ bv0 32))) (_ bv1 1)))))} is VALID [2022-02-20 23:50:56,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {8890#(and (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)) (or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv0 32))) (_ bv1 1)) (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))) (and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)) (_ bv0 32))) (_ bv1 1)))))} havoc entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; {8890#(and (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)) (or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv0 32))) (_ bv1 1)) (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))) (and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)) (_ bv0 32))) (_ bv1 1)))))} is VALID [2022-02-20 23:50:56,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {8890#(and (= |ULTIMATE.start_entry_point_~a10~0#1.offset| (_ bv0 32)) (or (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv0 32))) (_ bv1 1)) (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))) (and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)) (_ bv0 32))) (_ bv1 1)))))} SUMMARY for call entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L778 {8897#(exists ((v_arrayElimCell_36 (_ BitVec 32)) (|ULTIMATE.start_entry_point_~a10~0#1.base| (_ BitVec 32))) (and (or (and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~mem49#1.base|)) (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))) (and (= (_ bv1 1) (select |#valid| v_arrayElimCell_36)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~mem49#1.base|)))) (or (not (= |ULTIMATE.start_entry_point_#t~mem49#1.base| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_#t~mem49#1.base| v_arrayElimCell_36))))} is VALID [2022-02-20 23:50:56,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {8897#(exists ((v_arrayElimCell_36 (_ BitVec 32)) (|ULTIMATE.start_entry_point_~a10~0#1.base| (_ BitVec 32))) (and (or (and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~mem49#1.base|)) (= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))) (and (= (_ bv1 1) (select |#valid| v_arrayElimCell_36)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~mem49#1.base|)))) (or (not (= |ULTIMATE.start_entry_point_#t~mem49#1.base| |ULTIMATE.start_entry_point_~a10~0#1.base|)) (= |ULTIMATE.start_entry_point_#t~mem49#1.base| v_arrayElimCell_36))))} assume !(1bv1 == #valid[entry_point_#t~mem49#1.base]); {8806#false} is VALID [2022-02-20 23:50:56,801 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 23:50:56,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:56,913 INFO L356 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2022-02-20 23:50:56,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 64 [2022-02-20 23:50:56,967 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:50:56,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098952868] [2022-02-20 23:50:56,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098952868] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:56,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [225305496] [2022-02-20 23:50:56,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:50:56,967 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 23:50:56,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 23:50:56,968 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 23:50:56,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-02-20 23:50:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:57,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 23:50:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:50:57,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:50:57,099 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:50:57,198 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:50:57,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-02-20 23:50:57,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:50:59,305 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_9| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_9|)))) is different from true [2022-02-20 23:50:59,389 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:50:59,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-02-20 23:50:59,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-02-20 23:50:59,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {8805#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); {8805#true} is VALID [2022-02-20 23:50:59,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {8805#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~ret44#1.base, entry_point_#t~ret44#1.offset, entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset, entry_point_#t~mem50#1.base, entry_point_#t~mem50#1.offset, entry_point_#t~mem51#1.base, entry_point_#t~mem51#1.offset, entry_point_#t~mem52#1.base, entry_point_#t~mem52#1.offset, entry_point_#t~mem53#1.base, entry_point_#t~mem53#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset; {8805#true} is VALID [2022-02-20 23:50:59,451 INFO L272 TraceCheckUtils]: 2: Hoare triple {8805#true} call entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset := ldv_malloc(4bv32); {8805#true} is VALID [2022-02-20 23:50:59,451 INFO L290 TraceCheckUtils]: 3: Hoare triple {8805#true} ~size := #in~size; {8805#true} is VALID [2022-02-20 23:50:59,452 INFO L290 TraceCheckUtils]: 4: Hoare triple {8805#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; {8879#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:59,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {8879#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} assume true; {8879#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} is VALID [2022-02-20 23:50:59,453 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {8879#(= (_ bv1 1) (select |#valid| |ldv_malloc_#res.base|))} {8805#true} #114#return; {8938#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:59,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {8938#(= (select |#valid| |ULTIMATE.start_entry_point_#t~ret44#1.base|) (_ bv1 1))} entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset := entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset;havoc entry_point_#t~ret44#1.base, entry_point_#t~ret44#1.offset; {8942#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:59,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {8942#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} assume !(entry_point_~a10~0#1.base == 0bv32 && entry_point_~a10~0#1.offset == 0bv32); {8942#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:50:59,454 INFO L272 TraceCheckUtils]: 9: Hoare triple {8942#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} call entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset := ldv_malloc(4bv32); {8949#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:59,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {8949#(= |old(#valid)| |#valid|)} ~size := #in~size; {8949#(= |old(#valid)| |#valid|)} is VALID [2022-02-20 23:50:59,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {8949#(= |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; {8956#(= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))} is VALID [2022-02-20 23:50:59,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {8956#(= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))} assume true; {8956#(= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))} is VALID [2022-02-20 23:50:59,456 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {8956#(= (bvneg (select |old(#valid)| |ldv_malloc_#res.base|)) (_ bv0 1))} {8942#(= (select |#valid| |ULTIMATE.start_entry_point_~a10~0#1.base|) (_ bv1 1))} #116#return; {8963#(not (= |ULTIMATE.start_entry_point_~a10~0#1.base| |ULTIMATE.start_entry_point_#t~ret45#1.base|))} is VALID [2022-02-20 23:50:59,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {8963#(not (= |ULTIMATE.start_entry_point_~a10~0#1.base| |ULTIMATE.start_entry_point_#t~ret45#1.base|))} SUMMARY for call write~$Pointer$(entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset, entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L775-1 {8967#(not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} is VALID [2022-02-20 23:50:59,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {8967#(not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} havoc entry_point_#t~ret45#1.base, entry_point_#t~ret45#1.offset; {8967#(not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} is VALID [2022-02-20 23:50:59,459 INFO L290 TraceCheckUtils]: 16: Hoare triple {8967#(not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} SUMMARY for call entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L776 {8967#(not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} is VALID [2022-02-20 23:50:59,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {8967#(not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} assume !(entry_point_#t~mem46#1.base == 0bv32 && entry_point_#t~mem46#1.offset == 0bv32);havoc entry_point_#t~mem46#1.base, entry_point_#t~mem46#1.offset; {8967#(not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} is VALID [2022-02-20 23:50:59,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {8967#(not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)))} SUMMARY for call entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L777 {8980#(and (= |ULTIMATE.start_entry_point_#t~mem47#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} is VALID [2022-02-20 23:50:59,461 INFO L272 TraceCheckUtils]: 19: Hoare triple {8980#(and (= |ULTIMATE.start_entry_point_#t~mem47#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} call entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset := ldv_malloc(4bv32); {8984#(exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_9| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_9|))))} is VALID [2022-02-20 23:50:59,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {8984#(exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_9| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_9|))))} ~size := #in~size; {8984#(exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_9| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_9|))))} is VALID [2022-02-20 23:50:59,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {8984#(exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_9| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_9|))))} 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; {8984#(exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_9| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_9|))))} is VALID [2022-02-20 23:50:59,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {8984#(exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_9| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_9|))))} assume true; {8984#(exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_9| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_9|))))} is VALID [2022-02-20 23:50:59,463 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8984#(exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_9| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_9|))))} {8980#(and (= |ULTIMATE.start_entry_point_#t~mem47#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} #118#return; {8980#(and (= |ULTIMATE.start_entry_point_#t~mem47#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} is VALID [2022-02-20 23:50:59,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {8980#(and (= |ULTIMATE.start_entry_point_#t~mem47#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|)) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} SUMMARY for call write~$Pointer$(entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset, entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset, 4bv32); srcloc: L777-2 {9000#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} is VALID [2022-02-20 23:50:59,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {9000#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} havoc entry_point_#t~mem47#1.base, entry_point_#t~mem47#1.offset;havoc entry_point_#t~ret48#1.base, entry_point_#t~ret48#1.offset; {9000#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} is VALID [2022-02-20 23:50:59,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {9000#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))) (not (= |ULTIMATE.start_entry_point_~a10~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_entry_point_~a10~0#1.base|) |ULTIMATE.start_entry_point_~a10~0#1.offset|))))} SUMMARY for call entry_point_#t~mem49#1.base, entry_point_#t~mem49#1.offset := read~$Pointer$(entry_point_~a10~0#1.base, entry_point_~a10~0#1.offset, 4bv32); srcloc: L778 {8901#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~mem49#1.base|))} is VALID [2022-02-20 23:50:59,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {8901#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_entry_point_#t~mem49#1.base|))} assume !(1bv1 == #valid[entry_point_#t~mem49#1.base]); {8806#false} is VALID [2022-02-20 23:50:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-02-20 23:50:59,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:50:59,496 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-02-20 23:50:59,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-02-20 23:50:59,506 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_270) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) |c_ULTIMATE.start_entry_point_#t~mem47#1.base|)) is different from false [2022-02-20 23:50:59,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [225305496] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:50:59,518 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:50:59,518 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2022-02-20 23:50:59,518 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802539851] [2022-02-20 23:50:59,518 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:50:59,519 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 28 [2022-02-20 23:50:59,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:50:59,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-20 23:50:59,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:50:59,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 23:50:59,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:50:59,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 23:50:59,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=492, Unknown=2, NotChecked=90, Total=650 [2022-02-20 23:50:59,575 INFO L87 Difference]: Start difference. First operand 113 states and 137 transitions. Second operand has 22 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6)